java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/apache-escape-absolute.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:43:15,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:43:15,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:43:15,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:43:15,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:43:15,736 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:43:15,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:43:15,739 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:43:15,740 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:43:15,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:43:15,743 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:43:15,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:43:15,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:43:15,745 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:43:15,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:43:15,750 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:43:15,752 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:43:15,765 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:43:15,767 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:43:15,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:43:15,769 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:43:15,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:43:15,771 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:43:15,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:43:15,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:43:15,773 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:43:15,773 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:43:15,777 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:43:15,778 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:43:15,778 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:43:15,779 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:43:15,784 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:43:15,784 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:43:15,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:43:15,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:43:15,786 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:43:15,806 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:43:15,807 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:43:15,808 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:43:15,808 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:43:15,809 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:43:15,809 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:43:15,809 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:43:15,809 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:43:15,810 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:43:15,810 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:43:15,810 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:43:15,810 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:43:15,810 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:43:15,811 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:43:15,811 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:43:15,811 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:43:15,811 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:43:15,811 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:43:15,812 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:43:15,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:43:15,812 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:43:15,813 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:43:15,813 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:43:15,852 INFO ]: Repository-Root is: /tmp [2018-06-25 00:43:15,869 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:43:15,874 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:43:15,875 INFO ]: Initializing SmtParser... [2018-06-25 00:43:15,875 INFO ]: SmtParser initialized [2018-06-25 00:43:15,876 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/apache-escape-absolute.c.smt2 [2018-06-25 00:43:15,877 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 00:43:15,968 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/apache-escape-absolute.c.smt2 unknown [2018-06-25 00:43:16,478 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/apache-escape-absolute.c.smt2 [2018-06-25 00:43:16,483 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:43:16,488 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:43:16,489 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:43:16,489 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:43:16,489 INFO ]: ChcToBoogie initialized [2018-06-25 00:43:16,492 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:43:16" (1/1) ... [2018-06-25 00:43:16,563 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:16 Unit [2018-06-25 00:43:16,563 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:43:16,563 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:43:16,563 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:43:16,563 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:43:16,577 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:16" (1/1) ... [2018-06-25 00:43:16,578 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:16" (1/1) ... [2018-06-25 00:43:16,586 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:16" (1/1) ... [2018-06-25 00:43:16,586 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:16" (1/1) ... [2018-06-25 00:43:16,601 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:16" (1/1) ... [2018-06-25 00:43:16,602 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:16" (1/1) ... [2018-06-25 00:43:16,607 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:16" (1/1) ... [2018-06-25 00:43:16,611 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:43:16,611 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:43:16,611 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:43:16,611 INFO ]: RCFGBuilder initialized [2018-06-25 00:43:16,612 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 00:43:16,625 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:43:16,625 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:43:16,625 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:43:16,625 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:43:16,625 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:43:16,625 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:43:16,955 INFO ]: Using library mode [2018-06-25 00:43:16,956 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:43:16 BoogieIcfgContainer [2018-06-25 00:43:16,956 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:43:16,956 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:43:16,956 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:43:16,958 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:43:16,958 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:43:16" (1/1) ... [2018-06-25 00:43:16,973 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:43:16,974 INFO ]: Using Remove infeasible edges [2018-06-25 00:43:16,975 INFO ]: Using Maximize final states [2018-06-25 00:43:16,975 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:43:16,975 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:43:16,977 INFO ]: Using Remove sink states [2018-06-25 00:43:16,978 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:43:16,978 INFO ]: Using Use SBE [2018-06-25 00:43:16,984 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 00:43:17,720 WARN ]: aborting because of expected exponential blowup for input size 124 [2018-06-25 00:43:17,733 WARN ]: aborting because of expected exponential blowup for input size 124 [2018-06-25 00:43:17,733 INFO ]: SBE split 1 edges [2018-06-25 00:43:17,739 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:43:17,742 INFO ]: 0 new accepting states [2018-06-25 00:43:18,098 INFO ]: Removed 21 edges and 2 locations by large block encoding [2018-06-25 00:43:18,100 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:43:18,101 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:43:18,101 INFO ]: 0 new accepting states [2018-06-25 00:43:18,102 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:43:18,104 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:43:18,104 INFO ]: Encoded RCFG 6 locations, 23 edges [2018-06-25 00:43:18,104 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:43:18 BasicIcfg [2018-06-25 00:43:18,104 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:43:18,106 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:43:18,106 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:43:18,110 INFO ]: TraceAbstraction initialized [2018-06-25 00:43:18,110 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:43:16" (1/4) ... [2018-06-25 00:43:18,111 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a156e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:43:18, skipping insertion in model container [2018-06-25 00:43:18,111 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:43:16" (2/4) ... [2018-06-25 00:43:18,112 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a156e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:43:18, skipping insertion in model container [2018-06-25 00:43:18,112 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:43:16" (3/4) ... [2018-06-25 00:43:18,112 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a156e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:43:18, skipping insertion in model container [2018-06-25 00:43:18,113 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:43:18" (4/4) ... [2018-06-25 00:43:18,114 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:43:18,124 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:43:18,134 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:43:18,182 INFO ]: Using default assertion order modulation [2018-06-25 00:43:18,183 INFO ]: Interprodecural is true [2018-06-25 00:43:18,183 INFO ]: Hoare is false [2018-06-25 00:43:18,183 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:43:18,183 INFO ]: Backedges is TWOTRACK [2018-06-25 00:43:18,183 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:43:18,183 INFO ]: Difference is false [2018-06-25 00:43:18,183 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:43:18,183 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:43:18,196 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:43:18,208 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:43:18,209 INFO ]: Found error trace [2018-06-25 00:43:18,209 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:43:18,210 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:18,215 INFO ]: Analyzing trace with hash 36091599, now seen corresponding path program 1 times [2018-06-25 00:43:18,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:18,218 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:18,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:18,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:18,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:18,300 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:18,404 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:18,408 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:43:18,408 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:43:18,410 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:43:18,425 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:43:18,425 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:43:18,428 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:43:18,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:18,677 INFO ]: Finished difference Result 7 states and 24 transitions. [2018-06-25 00:43:18,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:43:18,699 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:43:18,699 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:18,712 INFO ]: With dead ends: 7 [2018-06-25 00:43:18,712 INFO ]: Without dead ends: 7 [2018-06-25 00:43:18,722 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:43:18,749 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:43:18,778 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:43:18,779 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:43:18,780 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-06-25 00:43:18,781 INFO ]: Start accepts. Automaton has 7 states and 24 transitions. Word has length 5 [2018-06-25 00:43:18,782 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:18,783 INFO ]: Abstraction has 7 states and 24 transitions. [2018-06-25 00:43:18,783 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:43:18,783 INFO ]: Start isEmpty. Operand 7 states and 24 transitions. [2018-06-25 00:43:18,783 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:43:18,783 INFO ]: Found error trace [2018-06-25 00:43:18,783 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:43:18,783 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:18,783 INFO ]: Analyzing trace with hash 36240554, now seen corresponding path program 1 times [2018-06-25 00:43:18,783 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:18,783 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:18,784 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:18,784 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:18,784 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:18,790 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:18,823 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:18,823 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:43:18,823 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:43:18,825 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:43:18,825 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:43:18,825 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:43:18,825 INFO ]: Start difference. First operand 7 states and 24 transitions. Second operand 3 states. [2018-06-25 00:43:19,032 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:19,032 INFO ]: Finished difference Result 9 states and 26 transitions. [2018-06-25 00:43:19,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:43:19,033 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:43:19,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:19,033 INFO ]: With dead ends: 9 [2018-06-25 00:43:19,033 INFO ]: Without dead ends: 9 [2018-06-25 00:43:19,034 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:43:19,034 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:43:19,035 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 00:43:19,035 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:43:19,035 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-06-25 00:43:19,035 INFO ]: Start accepts. Automaton has 7 states and 24 transitions. Word has length 5 [2018-06-25 00:43:19,036 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:19,036 INFO ]: Abstraction has 7 states and 24 transitions. [2018-06-25 00:43:19,036 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:43:19,036 INFO ]: Start isEmpty. Operand 7 states and 24 transitions. [2018-06-25 00:43:19,036 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:43:19,036 INFO ]: Found error trace [2018-06-25 00:43:19,036 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:43:19,036 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:19,036 INFO ]: Analyzing trace with hash 36300136, now seen corresponding path program 1 times [2018-06-25 00:43:19,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:19,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:19,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:19,038 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:19,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:19,044 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:19,081 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:19,081 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:43:19,081 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:43:19,081 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:43:19,081 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:43:19,081 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:43:19,082 INFO ]: Start difference. First operand 7 states and 24 transitions. Second operand 3 states. [2018-06-25 00:43:19,213 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:19,213 INFO ]: Finished difference Result 9 states and 26 transitions. [2018-06-25 00:43:19,213 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:43:19,213 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:43:19,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:19,213 INFO ]: With dead ends: 9 [2018-06-25 00:43:19,213 INFO ]: Without dead ends: 9 [2018-06-25 00:43:19,214 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:43:19,214 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:43:19,216 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 00:43:19,216 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:43:19,216 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-06-25 00:43:19,216 INFO ]: Start accepts. Automaton has 7 states and 24 transitions. Word has length 5 [2018-06-25 00:43:19,216 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:19,216 INFO ]: Abstraction has 7 states and 24 transitions. [2018-06-25 00:43:19,216 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:43:19,216 INFO ]: Start isEmpty. Operand 7 states and 24 transitions. [2018-06-25 00:43:19,217 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:43:19,217 INFO ]: Found error trace [2018-06-25 00:43:19,217 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:43:19,217 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:19,217 INFO ]: Analyzing trace with hash 36329927, now seen corresponding path program 1 times [2018-06-25 00:43:19,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:19,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:19,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:19,218 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:19,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:19,223 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:19,234 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:19,234 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:43:19,234 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:43:19,235 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:43:19,235 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:43:19,235 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:43:19,235 INFO ]: Start difference. First operand 7 states and 24 transitions. Second operand 3 states. [2018-06-25 00:43:19,318 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:19,319 INFO ]: Finished difference Result 9 states and 26 transitions. [2018-06-25 00:43:19,320 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:43:19,320 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:43:19,320 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:19,321 INFO ]: With dead ends: 9 [2018-06-25 00:43:19,321 INFO ]: Without dead ends: 9 [2018-06-25 00:43:19,321 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:43:19,321 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:43:19,323 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 00:43:19,323 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:43:19,323 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-06-25 00:43:19,323 INFO ]: Start accepts. Automaton has 7 states and 24 transitions. Word has length 5 [2018-06-25 00:43:19,323 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:19,323 INFO ]: Abstraction has 7 states and 24 transitions. [2018-06-25 00:43:19,323 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:43:19,324 INFO ]: Start isEmpty. Operand 7 states and 24 transitions. [2018-06-25 00:43:19,324 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:43:19,324 INFO ]: Found error trace [2018-06-25 00:43:19,324 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:43:19,324 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:19,324 INFO ]: Analyzing trace with hash 1117564481, now seen corresponding path program 1 times [2018-06-25 00:43:19,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:19,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:19,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:19,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:19,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:19,475 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:19,612 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:19,612 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:43:19,612 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 00:43:19,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:43:19,708 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:19,714 INFO ]: Computing forward predicates... [2018-06-25 00:43:20,411 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:20,440 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:43:20,440 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 00:43:20,440 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:43:20,440 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:43:20,440 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:43:20,441 INFO ]: Start difference. First operand 7 states and 24 transitions. Second operand 5 states. [2018-06-25 00:43:20,592 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-06-25 00:43:20,707 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 12 [2018-06-25 00:43:20,923 WARN ]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-06-25 00:43:21,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:21,191 INFO ]: Finished difference Result 11 states and 28 transitions. [2018-06-25 00:43:21,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:43:21,191 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 00:43:21,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:21,191 INFO ]: With dead ends: 11 [2018-06-25 00:43:21,191 INFO ]: Without dead ends: 11 [2018-06-25 00:43:21,192 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:43:21,192 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:43:21,194 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-25 00:43:21,194 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:43:21,194 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-06-25 00:43:21,194 INFO ]: Start accepts. Automaton has 8 states and 25 transitions. Word has length 6 [2018-06-25 00:43:21,194 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:21,194 INFO ]: Abstraction has 8 states and 25 transitions. [2018-06-25 00:43:21,194 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:43:21,194 INFO ]: Start isEmpty. Operand 8 states and 25 transitions. [2018-06-25 00:43:21,194 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:43:21,194 INFO ]: Found error trace [2018-06-25 00:43:21,194 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:43:21,195 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:21,195 INFO ]: Analyzing trace with hash 1119411523, now seen corresponding path program 1 times [2018-06-25 00:43:21,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:21,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:21,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:21,195 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:21,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:21,234 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:21,369 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:21,369 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:43:21,369 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:43:21,376 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:21,429 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:21,432 INFO ]: Computing forward predicates... [2018-06-25 00:43:22,051 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:22,076 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:43:22,076 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 00:43:22,076 INFO ]: Interpolant automaton has 4 states [2018-06-25 00:43:22,076 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 00:43:22,076 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 00:43:22,076 INFO ]: Start difference. First operand 8 states and 25 transitions. Second operand 4 states. [2018-06-25 00:43:22,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:22,133 INFO ]: Finished difference Result 11 states and 28 transitions. [2018-06-25 00:43:22,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 00:43:22,135 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 00:43:22,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:22,135 INFO ]: With dead ends: 11 [2018-06-25 00:43:22,135 INFO ]: Without dead ends: 11 [2018-06-25 00:43:22,136 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 00:43:22,136 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:43:22,137 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-25 00:43:22,137 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:43:22,138 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-06-25 00:43:22,138 INFO ]: Start accepts. Automaton has 8 states and 25 transitions. Word has length 6 [2018-06-25 00:43:22,138 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:22,138 INFO ]: Abstraction has 8 states and 25 transitions. [2018-06-25 00:43:22,138 INFO ]: Interpolant automaton has 4 states. [2018-06-25 00:43:22,138 INFO ]: Start isEmpty. Operand 8 states and 25 transitions. [2018-06-25 00:43:22,138 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:43:22,138 INFO ]: Found error trace [2018-06-25 00:43:22,138 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:43:22,139 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:22,139 INFO ]: Analyzing trace with hash 1124029128, now seen corresponding path program 1 times [2018-06-25 00:43:22,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:22,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:22,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:22,140 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:22,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:22,164 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:22,271 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:22,272 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:43:22,272 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:43:22,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:22,319 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:22,321 INFO ]: Computing forward predicates... [2018-06-25 00:43:23,375 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:23,395 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:43:23,395 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 00:43:23,395 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:43:23,395 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:43:23,395 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:43:23,395 INFO ]: Start difference. First operand 8 states and 25 transitions. Second operand 5 states. [2018-06-25 00:43:23,475 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:23,476 INFO ]: Finished difference Result 13 states and 30 transitions. [2018-06-25 00:43:23,476 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 00:43:23,476 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 00:43:23,476 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:23,476 INFO ]: With dead ends: 13 [2018-06-25 00:43:23,476 INFO ]: Without dead ends: 13 [2018-06-25 00:43:23,477 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:43:23,477 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:43:23,478 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 8. [2018-06-25 00:43:23,479 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:43:23,479 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-06-25 00:43:23,479 INFO ]: Start accepts. Automaton has 8 states and 25 transitions. Word has length 6 [2018-06-25 00:43:23,479 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:23,479 INFO ]: Abstraction has 8 states and 25 transitions. [2018-06-25 00:43:23,479 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:43:23,479 INFO ]: Start isEmpty. Operand 8 states and 25 transitions. [2018-06-25 00:43:23,479 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:43:23,479 INFO ]: Found error trace [2018-06-25 00:43:23,479 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:43:23,479 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:23,480 INFO ]: Analyzing trace with hash 1114793918, now seen corresponding path program 1 times [2018-06-25 00:43:23,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:23,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:23,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:23,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:23,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:23,501 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:23,852 WARN ]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 00:43:23,853 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:23,888 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:43:23,888 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 00:43:23,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:43:23,946 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:23,948 INFO ]: Computing forward predicates... [2018-06-25 00:43:26,925 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:26,946 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:43:26,946 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 00:43:26,946 INFO ]: Interpolant automaton has 4 states [2018-06-25 00:43:26,946 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 00:43:26,946 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 00:43:26,946 INFO ]: Start difference. First operand 8 states and 25 transitions. Second operand 4 states. [2018-06-25 00:43:26,996 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:26,996 INFO ]: Finished difference Result 12 states and 29 transitions. [2018-06-25 00:43:26,996 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 00:43:26,996 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 00:43:26,996 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:26,997 INFO ]: With dead ends: 12 [2018-06-25 00:43:26,997 INFO ]: Without dead ends: 12 [2018-06-25 00:43:26,997 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 00:43:26,997 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 00:43:26,999 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-06-25 00:43:26,999 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:43:26,999 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-06-25 00:43:26,999 INFO ]: Start accepts. Automaton has 8 states and 25 transitions. Word has length 6 [2018-06-25 00:43:26,999 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:26,999 INFO ]: Abstraction has 8 states and 25 transitions. [2018-06-25 00:43:26,999 INFO ]: Interpolant automaton has 4 states. [2018-06-25 00:43:26,999 INFO ]: Start isEmpty. Operand 8 states and 25 transitions. [2018-06-25 00:43:26,999 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:43:26,999 INFO ]: Found error trace [2018-06-25 00:43:26,999 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:43:26,999 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:27,000 INFO ]: Analyzing trace with hash 283485455, now seen corresponding path program 2 times [2018-06-25 00:43:27,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:27,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:27,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:27,000 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:27,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:27,057 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:27,289 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:27,289 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:43:27,289 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:43:27,296 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:43:27,380 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:43:27,380 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:27,382 INFO ]: Computing forward predicates... [2018-06-25 00:43:43,871 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:43,891 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:43:43,891 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 00:43:43,891 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:43:43,891 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:43:43,891 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:43:43,891 INFO ]: Start difference. First operand 8 states and 25 transitions. Second operand 6 states. [2018-06-25 00:43:43,978 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:43,978 INFO ]: Finished difference Result 13 states and 30 transitions. [2018-06-25 00:43:43,978 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:43:43,979 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 00:43:43,979 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:43,979 INFO ]: With dead ends: 13 [2018-06-25 00:43:43,979 INFO ]: Without dead ends: 13 [2018-06-25 00:43:43,979 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:43:43,979 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:43:43,982 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-25 00:43:43,982 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:43:43,982 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-06-25 00:43:43,982 INFO ]: Start accepts. Automaton has 9 states and 26 transitions. Word has length 7 [2018-06-25 00:43:43,982 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:43,982 INFO ]: Abstraction has 9 states and 26 transitions. [2018-06-25 00:43:43,982 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:43:43,982 INFO ]: Start isEmpty. Operand 9 states and 26 transitions. [2018-06-25 00:43:43,983 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:43:43,983 INFO ]: Found error trace [2018-06-25 00:43:43,983 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:43:43,983 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:43,983 INFO ]: Analyzing trace with hash 340743757, now seen corresponding path program 2 times [2018-06-25 00:43:43,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:43,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:43,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:43,984 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:43:43,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:44,030 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:44,190 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:44,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:43:44,190 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:43:44,202 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:43:44,273 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:43:44,273 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:44,276 INFO ]: Computing forward predicates... [2018-06-25 00:43:44,517 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 00:43:51,136 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 00:43:56,986 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:57,005 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:43:57,006 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 00:43:57,006 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:43:57,006 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:43:57,006 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:43:57,006 INFO ]: Start difference. First operand 9 states and 26 transitions. Second operand 6 states. [2018-06-25 00:43:57,130 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:43:57,130 INFO ]: Finished difference Result 16 states and 33 transitions. [2018-06-25 00:43:57,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:43:57,130 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 00:43:57,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:43:57,130 INFO ]: With dead ends: 16 [2018-06-25 00:43:57,131 INFO ]: Without dead ends: 16 [2018-06-25 00:43:57,131 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:43:57,131 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 00:43:57,132 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 9. [2018-06-25 00:43:57,132 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:43:57,133 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-06-25 00:43:57,133 INFO ]: Start accepts. Automaton has 9 states and 26 transitions. Word has length 7 [2018-06-25 00:43:57,133 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:43:57,133 INFO ]: Abstraction has 9 states and 26 transitions. [2018-06-25 00:43:57,133 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:43:57,133 INFO ]: Start isEmpty. Operand 9 states and 26 transitions. [2018-06-25 00:43:57,133 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:43:57,133 INFO ]: Found error trace [2018-06-25 00:43:57,133 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:43:57,133 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:43:57,133 INFO ]: Analyzing trace with hash 426631210, now seen corresponding path program 1 times [2018-06-25 00:43:57,133 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:43:57,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:43:57,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:57,134 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:43:57,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:43:57,185 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:57,445 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:43:57,445 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:43:57,445 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:43:57,454 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:43:57,517 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:43:57,519 INFO ]: Computing forward predicates... [2018-06-25 00:44:01,224 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 00:44:12,944 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:12,963 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:44:13,012 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 00:44:13,012 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:44:13,013 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:44:13,013 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:44:13,013 INFO ]: Start difference. First operand 9 states and 26 transitions. Second operand 6 states. [2018-06-25 00:44:13,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:44:13,089 INFO ]: Finished difference Result 16 states and 33 transitions. [2018-06-25 00:44:13,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:44:13,089 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 00:44:13,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:44:13,090 INFO ]: With dead ends: 16 [2018-06-25 00:44:13,090 INFO ]: Without dead ends: 16 [2018-06-25 00:44:13,090 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:44:13,090 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 00:44:13,092 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 9. [2018-06-25 00:44:13,092 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:44:13,092 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-06-25 00:44:13,092 INFO ]: Start accepts. Automaton has 9 states and 26 transitions. Word has length 7 [2018-06-25 00:44:13,092 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:44:13,092 INFO ]: Abstraction has 9 states and 26 transitions. [2018-06-25 00:44:13,092 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:44:13,092 INFO ]: Start isEmpty. Operand 9 states and 26 transitions. [2018-06-25 00:44:13,092 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:44:13,092 INFO ]: Found error trace [2018-06-25 00:44:13,092 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:44:13,092 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:44:13,092 INFO ]: Analyzing trace with hash 197598002, now seen corresponding path program 2 times [2018-06-25 00:44:13,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:44:13,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:44:13,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:13,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:44:13,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:13,126 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:13,299 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:13,299 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:44:13,299 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:44:13,305 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:44:13,370 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:44:13,370 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:13,373 INFO ]: Computing forward predicates... [2018-06-25 00:44:13,532 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 00:44:20,398 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:20,426 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:44:20,426 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 00:44:20,426 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:44:20,426 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:44:20,426 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:44:20,427 INFO ]: Start difference. First operand 9 states and 26 transitions. Second operand 5 states. [2018-06-25 00:44:20,518 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:44:20,518 INFO ]: Finished difference Result 15 states and 32 transitions. [2018-06-25 00:44:20,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:44:20,518 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-25 00:44:20,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:44:20,519 INFO ]: With dead ends: 15 [2018-06-25 00:44:20,519 INFO ]: Without dead ends: 15 [2018-06-25 00:44:20,519 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:44:20,519 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:44:20,520 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 9. [2018-06-25 00:44:20,520 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:44:20,520 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-06-25 00:44:20,521 INFO ]: Start accepts. Automaton has 9 states and 26 transitions. Word has length 7 [2018-06-25 00:44:20,521 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:44:20,521 INFO ]: Abstraction has 9 states and 26 transitions. [2018-06-25 00:44:20,521 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:44:20,521 INFO ]: Start isEmpty. Operand 9 states and 26 transitions. [2018-06-25 00:44:20,521 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:44:20,521 INFO ]: Found error trace [2018-06-25 00:44:20,521 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 00:44:20,521 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:44:20,521 INFO ]: Analyzing trace with hash 196839425, now seen corresponding path program 3 times [2018-06-25 00:44:20,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:44:20,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:44:20,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:20,522 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:44:20,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:20,583 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-25 00:44:21,178 WARN ]: Removed 9 from assertion stack [2018-06-25 00:44:21,179 WARN ]: Verification canceled [2018-06-25 00:44:21,181 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:44:21,182 WARN ]: Timeout [2018-06-25 00:44:21,182 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:44:21 BasicIcfg [2018-06-25 00:44:21,182 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:44:21,183 INFO ]: Toolchain (without parser) took 64700.14 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 242.8 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 71.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:44:21,184 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:44:21,184 INFO ]: ChcToBoogie took 74.45 ms. Allocated memory is still 309.3 MB. Free memory was 242.8 MB in the beginning and 239.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:44:21,187 INFO ]: Boogie Preprocessor took 47.31 ms. Allocated memory is still 309.3 MB. Free memory was 239.8 MB in the beginning and 237.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:44:21,187 INFO ]: RCFGBuilder took 344.82 ms. Allocated memory is still 309.3 MB. Free memory was 237.8 MB in the beginning and 215.7 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:44:21,188 INFO ]: BlockEncodingV2 took 1147.95 ms. Allocated memory was 309.3 MB in the beginning and 323.5 MB in the end (delta: 14.2 MB). Free memory was 215.7 MB in the beginning and 279.0 MB in the end (delta: -63.3 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:44:21,188 INFO ]: TraceAbstraction took 63076.81 ms. Allocated memory was 323.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 279.0 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 93.2 MB. Max. memory is 3.6 GB. [2018-06-25 00:44:21,196 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, 23 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 74.45 ms. Allocated memory is still 309.3 MB. Free memory was 242.8 MB in the beginning and 239.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 47.31 ms. Allocated memory is still 309.3 MB. Free memory was 239.8 MB in the beginning and 237.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 344.82 ms. Allocated memory is still 309.3 MB. Free memory was 237.8 MB in the beginning and 215.7 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1147.95 ms. Allocated memory was 309.3 MB in the beginning and 323.5 MB in the end (delta: 14.2 MB). Free memory was 215.7 MB in the beginning and 279.0 MB in the end (delta: -63.3 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 63076.81 ms. Allocated memory was 323.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 279.0 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 93.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 analyzing trace of length 9 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 63.0s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 267 SDtfs, 0 SDslu, 78 SDs, 0 SdLazy, 285 SolverSat, 264 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 12 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 45 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 58.7s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 2517 SizeOfPredicates, 56 NumberOfNonLiveVariables, 2072 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 0/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/apache-escape-absolute.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-44-21-212.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/apache-escape-absolute.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-44-21-212.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/apache-escape-absolute.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-44-21-212.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/apache-escape-absolute.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-44-21-212.csv Completed graceful shutdown