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/eldarica-misc/LIA/Consistency/point-location.47.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:36:34,201 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:36:34,203 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:36:34,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:36:34,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:36:34,220 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:36:34,221 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:36:34,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:36:34,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:36:34,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:36:34,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:36:34,230 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:36:34,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:36:34,232 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:36:34,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:36:34,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:36:34,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:36:34,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:36:34,247 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:36:34,248 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:36:34,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:36:34,254 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:36:34,254 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:36:34,255 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:36:34,255 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:36:34,256 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:36:34,257 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:36:34,257 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:36:34,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:36:34,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:36:34,264 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:36:34,264 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:36:34,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:36:34,265 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:36:34,268 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:36:34,268 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:36:34,303 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:36:34,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:36:34,303 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:36:34,303 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:36:34,306 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:36:34,307 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:36:34,307 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:36:34,307 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:36:34,307 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:36:34,307 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:36:34,308 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:36:34,308 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:36:34,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:36:34,308 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:36:34,308 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:36:34,308 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:36:34,309 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:36:34,310 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:36:34,310 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:36:34,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:36:34,310 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:36:34,312 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:36:34,312 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:36:34,366 INFO ]: Repository-Root is: /tmp [2018-06-24 20:36:34,422 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:36:34,427 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:36:34,429 INFO ]: Initializing SmtParser... [2018-06-24 20:36:34,429 INFO ]: SmtParser initialized [2018-06-24 20:36:34,430 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.47.smt2 [2018-06-24 20:36:34,431 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 20:36:34,510 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.47.smt2 unknown [2018-06-24 20:36:35,031 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.47.smt2 [2018-06-24 20:36:35,035 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:36:35,042 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:36:35,043 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:36:35,043 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:36:35,043 INFO ]: ChcToBoogie initialized [2018-06-24 20:36:35,046 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:36:35" (1/1) ... [2018-06-24 20:36:35,149 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:35 Unit [2018-06-24 20:36:35,149 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:36:35,150 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:36:35,150 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:36:35,150 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:36:35,175 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:35" (1/1) ... [2018-06-24 20:36:35,175 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:35" (1/1) ... [2018-06-24 20:36:35,197 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:35" (1/1) ... [2018-06-24 20:36:35,197 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:35" (1/1) ... [2018-06-24 20:36:35,225 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:35" (1/1) ... [2018-06-24 20:36:35,234 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:35" (1/1) ... [2018-06-24 20:36:35,238 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:35" (1/1) ... [2018-06-24 20:36:35,247 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:36:35,247 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:36:35,247 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:36:35,247 INFO ]: RCFGBuilder initialized [2018-06-24 20:36:35,252 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:35" (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-24 20:36:35,263 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:36:35,263 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:36:35,263 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:36:35,264 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:36:35,264 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:36:35,264 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-24 20:36:37,096 INFO ]: Using library mode [2018-06-24 20:36:37,097 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:36:37 BoogieIcfgContainer [2018-06-24 20:36:37,097 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:36:37,097 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:36:37,097 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:36:37,103 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:36:37,104 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:36:37" (1/1) ... [2018-06-24 20:36:37,143 INFO ]: Initial Icfg 147 locations, 288 edges [2018-06-24 20:36:37,144 INFO ]: Using Remove infeasible edges [2018-06-24 20:36:37,145 INFO ]: Using Maximize final states [2018-06-24 20:36:37,145 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:36:37,145 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:36:37,147 INFO ]: Using Remove sink states [2018-06-24 20:36:37,148 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:36:37,148 INFO ]: Using Use SBE [2018-06-24 20:36:37,165 INFO ]: SBE split 0 edges [2018-06-24 20:36:37,176 INFO ]: Removed 4 edges and 2 locations because of local infeasibility [2018-06-24 20:36:37,180 INFO ]: 0 new accepting states [2018-06-24 20:36:37,842 INFO ]: Removed 55 edges and 8 locations by large block encoding [2018-06-24 20:36:37,846 INFO ]: Removed 5 edges and 2 locations by removing sink states [2018-06-24 20:36:37,849 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:36:37,849 INFO ]: 0 new accepting states [2018-06-24 20:36:37,851 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:36:37,852 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:36:37,854 INFO ]: Encoded RCFG 135 locations, 271 edges [2018-06-24 20:36:37,854 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:36:37 BasicIcfg [2018-06-24 20:36:37,854 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:36:37,856 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:36:37,856 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:36:37,858 INFO ]: TraceAbstraction initialized [2018-06-24 20:36:37,859 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:36:35" (1/4) ... [2018-06-24 20:36:37,859 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646eebd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:36:37, skipping insertion in model container [2018-06-24 20:36:37,859 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:36:35" (2/4) ... [2018-06-24 20:36:37,860 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646eebd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:36:37, skipping insertion in model container [2018-06-24 20:36:37,860 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:36:37" (3/4) ... [2018-06-24 20:36:37,860 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646eebd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:36:37, skipping insertion in model container [2018-06-24 20:36:37,860 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:36:37" (4/4) ... [2018-06-24 20:36:37,862 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:36:37,870 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:36:37,894 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:36:37,936 INFO ]: Using default assertion order modulation [2018-06-24 20:36:37,937 INFO ]: Interprodecural is true [2018-06-24 20:36:37,937 INFO ]: Hoare is false [2018-06-24 20:36:37,937 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:36:37,937 INFO ]: Backedges is TWOTRACK [2018-06-24 20:36:37,937 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:36:37,937 INFO ]: Difference is false [2018-06-24 20:36:37,937 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:36:37,937 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:36:37,953 INFO ]: Start isEmpty. Operand 135 states. [2018-06-24 20:36:38,023 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:36:38,024 INFO ]: Found error trace [2018-06-24 20:36:38,024 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:36:38,032 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:38,036 INFO ]: Analyzing trace with hash 182565314, now seen corresponding path program 1 times [2018-06-24 20:36:38,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:38,039 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:38,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:38,072 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:38,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:38,164 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:38,332 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:36:38,334 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:38,334 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:36:38,335 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:36:38,348 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:36:38,349 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:36:38,351 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-24 20:36:40,280 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:40,280 INFO ]: Finished difference Result 267 states and 538 transitions. [2018-06-24 20:36:40,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:36:40,283 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:36:40,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:40,326 INFO ]: With dead ends: 267 [2018-06-24 20:36:40,326 INFO ]: Without dead ends: 267 [2018-06-24 20:36:40,328 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 20:36:40,348 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-24 20:36:40,459 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-24 20:36:40,460 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-24 20:36:40,486 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 538 transitions. [2018-06-24 20:36:40,488 INFO ]: Start accepts. Automaton has 267 states and 538 transitions. Word has length 5 [2018-06-24 20:36:40,489 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:40,489 INFO ]: Abstraction has 267 states and 538 transitions. [2018-06-24 20:36:40,489 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:36:40,489 INFO ]: Start isEmpty. Operand 267 states and 538 transitions. [2018-06-24 20:36:40,502 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:36:40,503 INFO ]: Found error trace [2018-06-24 20:36:40,503 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:36:40,503 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:40,503 INFO ]: Analyzing trace with hash 182655648, now seen corresponding path program 1 times [2018-06-24 20:36:40,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:40,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:40,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:40,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:40,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:40,546 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:40,642 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:36:40,642 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:40,643 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:36:40,644 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:36:40,644 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:36:40,644 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:36:40,644 INFO ]: Start difference. First operand 267 states and 538 transitions. Second operand 3 states. [2018-06-24 20:36:42,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:42,259 INFO ]: Finished difference Result 399 states and 806 transitions. [2018-06-24 20:36:42,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:36:42,259 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:36:42,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:42,283 INFO ]: With dead ends: 399 [2018-06-24 20:36:42,283 INFO ]: Without dead ends: 399 [2018-06-24 20:36:42,284 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 20:36:42,284 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-24 20:36:42,365 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-06-24 20:36:42,365 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-24 20:36:42,438 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 806 transitions. [2018-06-24 20:36:42,438 INFO ]: Start accepts. Automaton has 399 states and 806 transitions. Word has length 5 [2018-06-24 20:36:42,438 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:42,438 INFO ]: Abstraction has 399 states and 806 transitions. [2018-06-24 20:36:42,438 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:36:42,438 INFO ]: Start isEmpty. Operand 399 states and 806 transitions. [2018-06-24 20:36:42,472 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:36:42,472 INFO ]: Found error trace [2018-06-24 20:36:42,472 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:36:42,472 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:42,473 INFO ]: Analyzing trace with hash 2046310333, now seen corresponding path program 1 times [2018-06-24 20:36:42,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:42,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:42,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:42,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:42,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:42,503 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:42,669 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:36:42,669 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:42,669 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:36:42,669 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:36:42,669 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:36:42,669 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:36:42,669 INFO ]: Start difference. First operand 399 states and 806 transitions. Second operand 6 states. [2018-06-24 20:36:47,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:47,662 INFO ]: Finished difference Result 1100 states and 3892 transitions. [2018-06-24 20:36:47,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:36:47,684 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:36:47,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:47,844 INFO ]: With dead ends: 1100 [2018-06-24 20:36:47,844 INFO ]: Without dead ends: 1100 [2018-06-24 20:36:47,846 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:36:47,846 INFO ]: Start minimizeSevpa. Operand 1100 states. [2018-06-24 20:36:48,164 INFO ]: Finished minimizeSevpa. Reduced states from 1100 to 644. [2018-06-24 20:36:48,164 INFO ]: Start removeUnreachable. Operand 644 states. [2018-06-24 20:36:48,185 INFO ]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1441 transitions. [2018-06-24 20:36:48,185 INFO ]: Start accepts. Automaton has 644 states and 1441 transitions. Word has length 10 [2018-06-24 20:36:48,186 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:48,186 INFO ]: Abstraction has 644 states and 1441 transitions. [2018-06-24 20:36:48,186 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:36:48,186 INFO ]: Start isEmpty. Operand 644 states and 1441 transitions. [2018-06-24 20:36:48,224 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:36:48,225 INFO ]: Found error trace [2018-06-24 20:36:48,225 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:36:48,225 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:48,225 INFO ]: Analyzing trace with hash 2046312255, now seen corresponding path program 1 times [2018-06-24 20:36:48,225 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:48,225 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:48,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:48,227 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:48,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:48,271 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:48,452 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:36:48,452 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:48,452 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:36:48,452 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:36:48,452 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:36:48,452 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:36:48,453 INFO ]: Start difference. First operand 644 states and 1441 transitions. Second operand 6 states. [2018-06-24 20:36:53,142 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:53,142 INFO ]: Finished difference Result 1099 states and 3735 transitions. [2018-06-24 20:36:53,173 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:36:53,173 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:36:53,174 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:53,275 INFO ]: With dead ends: 1099 [2018-06-24 20:36:53,275 INFO ]: Without dead ends: 1099 [2018-06-24 20:36:53,275 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:36:53,277 INFO ]: Start minimizeSevpa. Operand 1099 states. [2018-06-24 20:36:53,527 INFO ]: Finished minimizeSevpa. Reduced states from 1099 to 644. [2018-06-24 20:36:53,527 INFO ]: Start removeUnreachable. Operand 644 states. [2018-06-24 20:36:53,550 INFO ]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1431 transitions. [2018-06-24 20:36:53,550 INFO ]: Start accepts. Automaton has 644 states and 1431 transitions. Word has length 10 [2018-06-24 20:36:53,550 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:53,550 INFO ]: Abstraction has 644 states and 1431 transitions. [2018-06-24 20:36:53,550 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:36:53,550 INFO ]: Start isEmpty. Operand 644 states and 1431 transitions. [2018-06-24 20:36:53,579 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:36:53,579 INFO ]: Found error trace [2018-06-24 20:36:53,579 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:36:53,580 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:53,580 INFO ]: Analyzing trace with hash 2046314177, now seen corresponding path program 1 times [2018-06-24 20:36:53,580 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:53,580 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:53,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:53,581 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:53,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:53,621 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:54,062 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:36:54,062 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:54,063 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:36:54,063 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:36:54,063 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:36:54,063 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:36:54,063 INFO ]: Start difference. First operand 644 states and 1431 transitions. Second operand 6 states. [2018-06-24 20:36:57,982 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:57,982 INFO ]: Finished difference Result 1785 states and 7272 transitions. [2018-06-24 20:36:57,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:36:57,983 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:36:57,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:58,152 INFO ]: With dead ends: 1785 [2018-06-24 20:36:58,152 INFO ]: Without dead ends: 1610 [2018-06-24 20:36:58,180 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:36:58,181 INFO ]: Start minimizeSevpa. Operand 1610 states. [2018-06-24 20:36:58,597 INFO ]: Finished minimizeSevpa. Reduced states from 1610 to 1015. [2018-06-24 20:36:58,597 INFO ]: Start removeUnreachable. Operand 1015 states. [2018-06-24 20:36:58,634 INFO ]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 2477 transitions. [2018-06-24 20:36:58,634 INFO ]: Start accepts. Automaton has 1015 states and 2477 transitions. Word has length 10 [2018-06-24 20:36:58,635 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:58,635 INFO ]: Abstraction has 1015 states and 2477 transitions. [2018-06-24 20:36:58,635 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:36:58,635 INFO ]: Start isEmpty. Operand 1015 states and 2477 transitions. [2018-06-24 20:36:58,674 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:36:58,674 INFO ]: Found error trace [2018-06-24 20:36:58,674 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:36:58,674 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:58,674 INFO ]: Analyzing trace with hash -1289861226, now seen corresponding path program 1 times [2018-06-24 20:36:58,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:58,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:58,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:58,675 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:58,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:58,695 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:58,773 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:36:58,773 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:58,773 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:36:58,773 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:36:58,773 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:36:58,773 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:36:58,774 INFO ]: Start difference. First operand 1015 states and 2477 transitions. Second operand 3 states. [2018-06-24 20:36:59,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:59,454 INFO ]: Finished difference Result 1157 states and 2824 transitions. [2018-06-24 20:36:59,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:36:59,454 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 20:36:59,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:59,494 INFO ]: With dead ends: 1157 [2018-06-24 20:36:59,494 INFO ]: Without dead ends: 1157 [2018-06-24 20:36:59,494 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 20:36:59,495 INFO ]: Start minimizeSevpa. Operand 1157 states. [2018-06-24 20:36:59,725 INFO ]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2018-06-24 20:36:59,725 INFO ]: Start removeUnreachable. Operand 1157 states. [2018-06-24 20:36:59,766 INFO ]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 2824 transitions. [2018-06-24 20:36:59,766 INFO ]: Start accepts. Automaton has 1157 states and 2824 transitions. Word has length 10 [2018-06-24 20:36:59,766 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:59,766 INFO ]: Abstraction has 1157 states and 2824 transitions. [2018-06-24 20:36:59,766 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:36:59,767 INFO ]: Start isEmpty. Operand 1157 states and 2824 transitions. [2018-06-24 20:36:59,802 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:36:59,802 INFO ]: Found error trace [2018-06-24 20:36:59,802 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:36:59,803 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:59,803 INFO ]: Analyzing trace with hash -1526868093, now seen corresponding path program 1 times [2018-06-24 20:36:59,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:59,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:59,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:59,804 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:59,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:59,820 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:59,990 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:36:59,990 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:59,990 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:36:59,991 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:36:59,991 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:36:59,991 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:36:59,991 INFO ]: Start difference. First operand 1157 states and 2824 transitions. Second operand 6 states. [2018-06-24 20:37:03,956 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:37:03,956 INFO ]: Finished difference Result 2983 states and 12545 transitions. [2018-06-24 20:37:03,956 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:37:03,957 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:37:03,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:37:04,221 INFO ]: With dead ends: 2983 [2018-06-24 20:37:04,221 INFO ]: Without dead ends: 2840 [2018-06-24 20:37:04,221 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:37:04,223 INFO ]: Start minimizeSevpa. Operand 2840 states. [2018-06-24 20:37:05,135 INFO ]: Finished minimizeSevpa. Reduced states from 2840 to 1754. [2018-06-24 20:37:05,135 INFO ]: Start removeUnreachable. Operand 1754 states. [2018-06-24 20:37:05,221 INFO ]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 5287 transitions. [2018-06-24 20:37:05,221 INFO ]: Start accepts. Automaton has 1754 states and 5287 transitions. Word has length 10 [2018-06-24 20:37:05,222 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:37:05,222 INFO ]: Abstraction has 1754 states and 5287 transitions. [2018-06-24 20:37:05,222 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:37:05,222 INFO ]: Start isEmpty. Operand 1754 states and 5287 transitions. [2018-06-24 20:37:05,255 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:37:05,255 INFO ]: Found error trace [2018-06-24 20:37:05,255 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:37:05,255 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:37:05,255 INFO ]: Analyzing trace with hash -1469609791, now seen corresponding path program 1 times [2018-06-24 20:37:05,255 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:37:05,255 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:37:05,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:05,257 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:37:05,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:05,277 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:37:05,598 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:37:05,598 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:37:05,598 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:37:05,599 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:37:05,599 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:37:05,599 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:37:05,599 INFO ]: Start difference. First operand 1754 states and 5287 transitions. Second operand 6 states. [2018-06-24 20:37:09,834 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:37:09,835 INFO ]: Finished difference Result 3738 states and 17891 transitions. [2018-06-24 20:37:09,835 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:37:09,835 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:37:09,835 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:37:10,198 INFO ]: With dead ends: 3738 [2018-06-24 20:37:10,198 INFO ]: Without dead ends: 3738 [2018-06-24 20:37:10,198 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:37:10,200 INFO ]: Start minimizeSevpa. Operand 3738 states. [2018-06-24 20:37:12,070 INFO ]: Finished minimizeSevpa. Reduced states from 3738 to 2438. [2018-06-24 20:37:12,070 INFO ]: Start removeUnreachable. Operand 2438 states. [2018-06-24 20:37:12,162 INFO ]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 8772 transitions. [2018-06-24 20:37:12,162 INFO ]: Start accepts. Automaton has 2438 states and 8772 transitions. Word has length 10 [2018-06-24 20:37:12,163 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:37:12,163 INFO ]: Abstraction has 2438 states and 8772 transitions. [2018-06-24 20:37:12,163 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:37:12,163 INFO ]: Start isEmpty. Operand 2438 states and 8772 transitions. [2018-06-24 20:37:12,225 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:37:12,225 INFO ]: Found error trace [2018-06-24 20:37:12,225 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:37:12,226 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:37:12,227 INFO ]: Analyzing trace with hash -1383722338, now seen corresponding path program 1 times [2018-06-24 20:37:12,227 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:37:12,227 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:37:12,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:12,229 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:37:12,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:12,245 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:37:12,666 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:37:12,667 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:37:12,667 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:37:12,667 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:37:12,667 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:37:12,667 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:37:12,667 INFO ]: Start difference. First operand 2438 states and 8772 transitions. Second operand 6 states. [2018-06-24 20:37:18,431 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:37:18,431 INFO ]: Finished difference Result 8376 states and 55281 transitions. [2018-06-24 20:37:18,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:37:18,432 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:37:18,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:37:20,306 INFO ]: With dead ends: 8376 [2018-06-24 20:37:20,307 INFO ]: Without dead ends: 8376 [2018-06-24 20:37:20,307 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:37:20,311 INFO ]: Start minimizeSevpa. Operand 8376 states. [2018-06-24 20:37:25,447 INFO ]: Finished minimizeSevpa. Reduced states from 8376 to 5725. [2018-06-24 20:37:25,447 INFO ]: Start removeUnreachable. Operand 5725 states. [2018-06-24 20:37:25,973 INFO ]: Finished removeUnreachable. Reduced from 5725 states to 5725 states and 30415 transitions. [2018-06-24 20:37:25,973 INFO ]: Start accepts. Automaton has 5725 states and 30415 transitions. Word has length 10 [2018-06-24 20:37:25,973 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:37:25,973 INFO ]: Abstraction has 5725 states and 30415 transitions. [2018-06-24 20:37:25,973 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:37:25,973 INFO ]: Start isEmpty. Operand 5725 states and 30415 transitions. [2018-06-24 20:37:26,068 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:37:26,069 INFO ]: Found error trace [2018-06-24 20:37:26,069 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:37:26,069 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:37:26,070 INFO ]: Analyzing trace with hash -994998545, now seen corresponding path program 1 times [2018-06-24 20:37:26,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:37:26,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:37:26,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:26,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:37:26,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:37:26,084 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:37:26,235 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:37:26,236 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:37:26,236 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:37:26,248 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:37:26,303 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:37:26,313 INFO ]: Computing forward predicates... [2018-06-24 20:37:26,456 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:37:26,476 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:37:26,476 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 20:37:26,476 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:37:26,477 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:37:26,477 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:37:26,477 INFO ]: Start difference. First operand 5725 states and 30415 transitions. Second operand 12 states. [2018-06-24 20:37:27,258 WARN ]: Spent 198.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 Received shutdown request... [2018-06-24 20:37:30,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:37:30,113 WARN ]: Verification canceled [2018-06-24 20:37:30,117 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:37:30,118 WARN ]: Timeout [2018-06-24 20:37:30,118 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:37:30 BasicIcfg [2018-06-24 20:37:30,118 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:37:30,119 INFO ]: Toolchain (without parser) took 55083.55 ms. Allocated memory was 307.8 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 237.2 MB in the beginning and 855.6 MB in the end (delta: -618.3 MB). Peak memory consumption was 840.2 MB. Max. memory is 3.6 GB. [2018-06-24 20:37:30,120 INFO ]: SmtParser took 0.28 ms. Allocated memory is still 307.8 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:37:30,120 INFO ]: ChcToBoogie took 106.69 ms. Allocated memory is still 307.8 MB. Free memory was 236.2 MB in the beginning and 232.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:37:30,122 INFO ]: Boogie Preprocessor took 96.67 ms. Allocated memory is still 307.8 MB. Free memory was 232.2 MB in the beginning and 230.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 20:37:30,122 INFO ]: RCFGBuilder took 1849.84 ms. Allocated memory was 307.8 MB in the beginning and 322.4 MB in the end (delta: 14.7 MB). Free memory was 230.2 MB in the beginning and 255.1 MB in the end (delta: -24.9 MB). Peak memory consumption was 49.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:37:30,123 INFO ]: BlockEncodingV2 took 757.07 ms. Allocated memory is still 322.4 MB. Free memory was 255.1 MB in the beginning and 211.4 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 3.6 GB. [2018-06-24 20:37:30,123 INFO ]: TraceAbstraction took 52262.78 ms. Allocated memory was 322.4 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 211.4 MB in the beginning and 855.6 MB in the end (delta: -644.2 MB). Peak memory consumption was 799.7 MB. Max. memory is 3.6 GB. [2018-06-24 20:37:30,135 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 147 locations, 288 edges - StatisticsResult: Encoded RCFG 135 locations, 271 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.28 ms. Allocated memory is still 307.8 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 106.69 ms. Allocated memory is still 307.8 MB. Free memory was 236.2 MB in the beginning and 232.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 96.67 ms. Allocated memory is still 307.8 MB. Free memory was 232.2 MB in the beginning and 230.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1849.84 ms. Allocated memory was 307.8 MB in the beginning and 322.4 MB in the end (delta: 14.7 MB). Free memory was 230.2 MB in the beginning and 255.1 MB in the end (delta: -24.9 MB). Peak memory consumption was 49.3 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 757.07 ms. Allocated memory is still 322.4 MB. Free memory was 255.1 MB in the beginning and 211.4 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 52262.78 ms. Allocated memory was 322.4 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 211.4 MB in the beginning and 855.6 MB in the end (delta: -644.2 MB). Peak memory consumption was 799.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (5725states) and interpolant automaton (currently 11 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (1335 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. TIMEOUT Result, 52.1s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 38.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7222 SDtfs, 1424 SDslu, 14960 SDs, 0 SdLazy, 19727 SolverSat, 3938 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5725occurred 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: 10.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 6543 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 2045 SizeOfPredicates, 8 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 19/21 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/point-location.47.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-37-30-151.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.47.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-37-30-151.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.47.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-37-30-151.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.47.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-37-30-151.csv Completed graceful shutdown