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.44.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:35:44,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:35:44,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:35:44,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:35:44,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:35:44,380 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:35:44,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:35:44,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:35:44,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:35:44,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:35:44,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:35:44,392 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:35:44,394 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:35:44,394 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:35:44,395 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:35:44,396 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:35:44,396 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:35:44,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:35:44,402 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:35:44,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:35:44,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:35:44,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:35:44,410 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:35:44,410 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:35:44,410 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:35:44,411 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:35:44,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:35:44,412 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:35:44,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:35:44,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:35:44,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:35:44,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:35:44,415 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:35:44,415 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:35:44,416 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:35:44,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:35:44,417 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:35:44,437 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:35:44,437 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:35:44,438 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:35:44,441 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:35:44,442 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:35:44,442 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:35:44,443 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:35:44,444 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:35:44,444 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:35:44,444 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:35:44,444 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:35:44,445 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:35:44,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:35:44,445 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:35:44,445 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:35:44,445 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:35:44,445 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:35:44,446 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:35:44,446 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:35:44,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:35:44,446 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:35:44,451 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:35:44,451 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:35:44,497 INFO ]: Repository-Root is: /tmp [2018-06-26 17:35:44,510 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:35:44,515 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:35:44,516 INFO ]: Initializing SmtParser... [2018-06-26 17:35:44,517 INFO ]: SmtParser initialized [2018-06-26 17:35:44,517 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.44.smt2 [2018-06-26 17:35:44,518 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 17:35:44,607 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.44.smt2 unknown [2018-06-26 17:35:45,241 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.44.smt2 [2018-06-26 17:35:45,246 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:35:45,252 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:35:45,253 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:35:45,253 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:35:45,253 INFO ]: ChcToBoogie initialized [2018-06-26 17:35:45,261 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:35:45" (1/1) ... [2018-06-26 17:35:45,366 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:35:45 Unit [2018-06-26 17:35:45,366 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:35:45,367 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:35:45,367 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:35:45,367 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:35:45,388 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:35:45" (1/1) ... [2018-06-26 17:35:45,388 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:35:45" (1/1) ... [2018-06-26 17:35:45,401 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:35:45" (1/1) ... [2018-06-26 17:35:45,401 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:35:45" (1/1) ... [2018-06-26 17:35:45,421 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:35:45" (1/1) ... [2018-06-26 17:35:45,478 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:35:45" (1/1) ... [2018-06-26 17:35:45,485 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:35:45" (1/1) ... [2018-06-26 17:35:45,490 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:35:45,491 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:35:45,491 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:35:45,491 INFO ]: RCFGBuilder initialized [2018-06-26 17:35:45,492 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:35:45" (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-26 17:35:45,503 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:35:45,503 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:35:45,503 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:35:45,503 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:35:45,503 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:35:45,503 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-26 17:35:47,402 INFO ]: Using library mode [2018-06-26 17:35:47,403 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:35:47 BoogieIcfgContainer [2018-06-26 17:35:47,403 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:35:47,403 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:35:47,404 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:35:47,405 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:35:47,405 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:35:47" (1/1) ... [2018-06-26 17:35:47,455 INFO ]: Initial Icfg 147 locations, 287 edges [2018-06-26 17:35:47,456 INFO ]: Using Remove infeasible edges [2018-06-26 17:35:47,457 INFO ]: Using Maximize final states [2018-06-26 17:35:47,457 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:35:47,459 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:35:47,461 INFO ]: Using Remove sink states [2018-06-26 17:35:47,461 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:35:47,461 INFO ]: Using Use SBE [2018-06-26 17:35:47,476 INFO ]: SBE split 0 edges [2018-06-26 17:35:47,487 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 17:35:47,489 INFO ]: 0 new accepting states [2018-06-26 17:35:48,365 INFO ]: Removed 64 edges and 9 locations by large block encoding [2018-06-26 17:35:48,367 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-26 17:35:48,372 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:35:48,372 INFO ]: 0 new accepting states [2018-06-26 17:35:48,375 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:35:48,376 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:35:48,378 INFO ]: Encoded RCFG 135 locations, 274 edges [2018-06-26 17:35:48,379 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:35:48 BasicIcfg [2018-06-26 17:35:48,379 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:35:48,380 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:35:48,380 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:35:48,383 INFO ]: TraceAbstraction initialized [2018-06-26 17:35:48,383 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:35:45" (1/4) ... [2018-06-26 17:35:48,384 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1440d2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:35:48, skipping insertion in model container [2018-06-26 17:35:48,384 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:35:45" (2/4) ... [2018-06-26 17:35:48,385 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1440d2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:35:48, skipping insertion in model container [2018-06-26 17:35:48,385 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:35:47" (3/4) ... [2018-06-26 17:35:48,385 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1440d2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:35:48, skipping insertion in model container [2018-06-26 17:35:48,385 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:35:48" (4/4) ... [2018-06-26 17:35:48,387 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:35:48,395 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:35:48,402 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:35:48,442 INFO ]: Using default assertion order modulation [2018-06-26 17:35:48,442 INFO ]: Interprodecural is true [2018-06-26 17:35:48,442 INFO ]: Hoare is false [2018-06-26 17:35:48,442 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:35:48,442 INFO ]: Backedges is TWOTRACK [2018-06-26 17:35:48,442 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:35:48,442 INFO ]: Difference is false [2018-06-26 17:35:48,442 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:35:48,442 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:35:48,456 INFO ]: Start isEmpty. Operand 135 states. [2018-06-26 17:35:48,500 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 17:35:48,500 INFO ]: Found error trace [2018-06-26 17:35:48,501 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 17:35:48,501 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:35:48,507 INFO ]: Analyzing trace with hash 5891136, now seen corresponding path program 1 times [2018-06-26 17:35:48,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:35:48,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:35:48,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:48,546 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:35:48,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:48,643 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:35:48,835 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:35:48,848 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:35:48,848 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:35:48,850 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:35:48,861 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:35:48,861 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:35:48,864 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-26 17:35:50,734 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:35:50,734 INFO ]: Finished difference Result 267 states and 545 transitions. [2018-06-26 17:35:50,734 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:35:50,736 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 17:35:50,736 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:35:50,791 INFO ]: With dead ends: 267 [2018-06-26 17:35:50,791 INFO ]: Without dead ends: 267 [2018-06-26 17:35:50,792 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:35:50,813 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-26 17:35:50,952 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-26 17:35:50,953 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-26 17:35:50,968 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 545 transitions. [2018-06-26 17:35:50,969 INFO ]: Start accepts. Automaton has 267 states and 545 transitions. Word has length 4 [2018-06-26 17:35:50,971 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:35:50,971 INFO ]: Abstraction has 267 states and 545 transitions. [2018-06-26 17:35:50,971 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:35:50,971 INFO ]: Start isEmpty. Operand 267 states and 545 transitions. [2018-06-26 17:35:51,011 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:35:51,011 INFO ]: Found error trace [2018-06-26 17:35:51,011 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:35:51,011 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:35:51,012 INFO ]: Analyzing trace with hash 628832350, now seen corresponding path program 1 times [2018-06-26 17:35:51,012 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:35:51,012 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:35:51,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:51,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:35:51,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:51,086 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:35:51,258 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:35:51,258 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:35:51,259 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:35:51,260 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:35:51,260 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:35:51,260 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:35:51,260 INFO ]: Start difference. First operand 267 states and 545 transitions. Second operand 5 states. [2018-06-26 17:35:54,656 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:35:54,711 INFO ]: Finished difference Result 720 states and 2422 transitions. [2018-06-26 17:35:54,711 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:35:54,711 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:35:54,711 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:35:54,782 INFO ]: With dead ends: 720 [2018-06-26 17:35:54,782 INFO ]: Without dead ends: 720 [2018-06-26 17:35:54,783 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:35:54,784 INFO ]: Start minimizeSevpa. Operand 720 states. [2018-06-26 17:35:55,136 INFO ]: Finished minimizeSevpa. Reduced states from 720 to 577. [2018-06-26 17:35:55,136 INFO ]: Start removeUnreachable. Operand 577 states. [2018-06-26 17:35:55,174 INFO ]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1635 transitions. [2018-06-26 17:35:55,174 INFO ]: Start accepts. Automaton has 577 states and 1635 transitions. Word has length 9 [2018-06-26 17:35:55,174 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:35:55,175 INFO ]: Abstraction has 577 states and 1635 transitions. [2018-06-26 17:35:55,175 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:35:55,175 INFO ]: Start isEmpty. Operand 577 states and 1635 transitions. [2018-06-26 17:35:55,244 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:35:55,244 INFO ]: Found error trace [2018-06-26 17:35:55,244 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:35:55,244 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:35:55,244 INFO ]: Analyzing trace with hash -971418792, now seen corresponding path program 1 times [2018-06-26 17:35:55,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:35:55,244 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:35:55,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:55,245 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:35:55,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:55,265 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:35:55,351 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:35:55,351 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:35:55,351 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:35:55,352 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:35:55,352 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:35:55,352 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:35:55,352 INFO ]: Start difference. First operand 577 states and 1635 transitions. Second operand 3 states. [2018-06-26 17:35:56,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:35:56,438 INFO ]: Finished difference Result 759 states and 2145 transitions. [2018-06-26 17:35:56,439 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:35:56,439 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 17:35:56,439 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:35:56,497 INFO ]: With dead ends: 759 [2018-06-26 17:35:56,497 INFO ]: Without dead ends: 759 [2018-06-26 17:35:56,497 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:35:56,498 INFO ]: Start minimizeSevpa. Operand 759 states. [2018-06-26 17:35:56,718 INFO ]: Finished minimizeSevpa. Reduced states from 759 to 759. [2018-06-26 17:35:56,718 INFO ]: Start removeUnreachable. Operand 759 states. [2018-06-26 17:35:56,813 INFO ]: Finished removeUnreachable. Reduced from 759 states to 759 states and 2145 transitions. [2018-06-26 17:35:56,813 INFO ]: Start accepts. Automaton has 759 states and 2145 transitions. Word has length 9 [2018-06-26 17:35:56,813 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:35:56,813 INFO ]: Abstraction has 759 states and 2145 transitions. [2018-06-26 17:35:56,813 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:35:56,813 INFO ]: Start isEmpty. Operand 759 states and 2145 transitions. [2018-06-26 17:35:56,873 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:35:56,873 INFO ]: Found error trace [2018-06-26 17:35:56,873 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:35:56,873 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:35:56,873 INFO ]: Analyzing trace with hash -1372226906, now seen corresponding path program 1 times [2018-06-26 17:35:56,873 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:35:56,873 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:35:56,874 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:56,874 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:35:56,874 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:56,896 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:35:56,978 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:35:57,023 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:35:57,023 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:35:57,023 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:35:57,024 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:35:57,024 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:35:57,024 INFO ]: Start difference. First operand 759 states and 2145 transitions. Second operand 3 states. [2018-06-26 17:36:00,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:36:00,868 INFO ]: Finished difference Result 831 states and 1759 transitions. [2018-06-26 17:36:00,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:36:00,868 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 17:36:00,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:36:00,896 INFO ]: With dead ends: 831 [2018-06-26 17:36:00,896 INFO ]: Without dead ends: 831 [2018-06-26 17:36:00,896 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:36:00,897 INFO ]: Start minimizeSevpa. Operand 831 states. [2018-06-26 17:36:01,015 INFO ]: Finished minimizeSevpa. Reduced states from 831 to 799. [2018-06-26 17:36:01,015 INFO ]: Start removeUnreachable. Operand 799 states. [2018-06-26 17:36:01,036 INFO ]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1649 transitions. [2018-06-26 17:36:01,036 INFO ]: Start accepts. Automaton has 799 states and 1649 transitions. Word has length 9 [2018-06-26 17:36:01,036 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:36:01,036 INFO ]: Abstraction has 799 states and 1649 transitions. [2018-06-26 17:36:01,036 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:36:01,036 INFO ]: Start isEmpty. Operand 799 states and 1649 transitions. [2018-06-26 17:36:01,064 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:36:01,064 INFO ]: Found error trace [2018-06-26 17:36:01,064 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:36:01,064 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:36:01,064 INFO ]: Analyzing trace with hash -79205052, now seen corresponding path program 1 times [2018-06-26 17:36:01,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:36:01,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:36:01,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:36:01,065 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:36:01,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:36:01,087 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:36:01,347 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:36:01,348 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:36:01,348 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:36:01,348 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:36:01,348 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:36:01,348 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:36:01,348 INFO ]: Start difference. First operand 799 states and 1649 transitions. Second operand 5 states. [2018-06-26 17:36:02,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:36:02,357 INFO ]: Finished difference Result 1160 states and 3255 transitions. [2018-06-26 17:36:02,357 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:36:02,357 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:36:02,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:36:02,412 INFO ]: With dead ends: 1160 [2018-06-26 17:36:02,412 INFO ]: Without dead ends: 1160 [2018-06-26 17:36:02,412 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:36:02,413 INFO ]: Start minimizeSevpa. Operand 1160 states. [2018-06-26 17:36:02,660 INFO ]: Finished minimizeSevpa. Reduced states from 1160 to 810. [2018-06-26 17:36:02,660 INFO ]: Start removeUnreachable. Operand 810 states. [2018-06-26 17:36:02,672 INFO ]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1734 transitions. [2018-06-26 17:36:02,672 INFO ]: Start accepts. Automaton has 810 states and 1734 transitions. Word has length 9 [2018-06-26 17:36:02,672 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:36:02,672 INFO ]: Abstraction has 810 states and 1734 transitions. [2018-06-26 17:36:02,672 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:36:02,672 INFO ]: Start isEmpty. Operand 810 states and 1734 transitions. [2018-06-26 17:36:02,687 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:36:02,687 INFO ]: Found error trace [2018-06-26 17:36:02,687 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:36:02,687 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:36:02,687 INFO ]: Analyzing trace with hash -79204091, now seen corresponding path program 1 times [2018-06-26 17:36:02,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:36:02,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:36:02,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:36:02,688 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:36:02,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:36:02,710 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:36:02,833 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:36:02,833 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:36:02,833 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:36:02,833 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:36:02,834 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:36:02,834 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:36:02,834 INFO ]: Start difference. First operand 810 states and 1734 transitions. Second operand 5 states. [2018-06-26 17:36:03,519 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:36:03,519 INFO ]: Finished difference Result 1160 states and 3235 transitions. [2018-06-26 17:36:03,519 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:36:03,519 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:36:03,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:36:03,567 INFO ]: With dead ends: 1160 [2018-06-26 17:36:03,567 INFO ]: Without dead ends: 1160 [2018-06-26 17:36:03,568 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:36:03,568 INFO ]: Start minimizeSevpa. Operand 1160 states. [2018-06-26 17:36:03,850 INFO ]: Finished minimizeSevpa. Reduced states from 1160 to 810. [2018-06-26 17:36:03,850 INFO ]: Start removeUnreachable. Operand 810 states. [2018-06-26 17:36:03,873 INFO ]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1714 transitions. [2018-06-26 17:36:03,873 INFO ]: Start accepts. Automaton has 810 states and 1714 transitions. Word has length 9 [2018-06-26 17:36:03,873 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:36:03,873 INFO ]: Abstraction has 810 states and 1714 transitions. [2018-06-26 17:36:03,873 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:36:03,873 INFO ]: Start isEmpty. Operand 810 states and 1714 transitions. [2018-06-26 17:36:03,888 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:36:03,888 INFO ]: Found error trace [2018-06-26 17:36:03,888 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:36:03,888 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:36:03,889 INFO ]: Analyzing trace with hash -79211779, now seen corresponding path program 1 times [2018-06-26 17:36:03,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:36:03,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:36:03,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:36:03,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:36:03,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:36:03,915 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:36:04,084 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:36:04,084 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:36:04,084 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:36:04,084 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:36:04,084 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:36:04,084 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:36:04,084 INFO ]: Start difference. First operand 810 states and 1714 transitions. Second operand 5 states. [2018-06-26 17:36:05,160 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:36:05,160 INFO ]: Finished difference Result 1160 states and 3230 transitions. [2018-06-26 17:36:05,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:36:05,162 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:36:05,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:36:05,211 INFO ]: With dead ends: 1160 [2018-06-26 17:36:05,214 INFO ]: Without dead ends: 1160 [2018-06-26 17:36:05,215 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:36:05,216 INFO ]: Start minimizeSevpa. Operand 1160 states. [2018-06-26 17:36:05,474 INFO ]: Finished minimizeSevpa. Reduced states from 1160 to 810. [2018-06-26 17:36:05,475 INFO ]: Start removeUnreachable. Operand 810 states. [2018-06-26 17:36:05,495 INFO ]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1709 transitions. [2018-06-26 17:36:05,495 INFO ]: Start accepts. Automaton has 810 states and 1709 transitions. Word has length 9 [2018-06-26 17:36:05,495 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:36:05,495 INFO ]: Abstraction has 810 states and 1709 transitions. [2018-06-26 17:36:05,495 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:36:05,495 INFO ]: Start isEmpty. Operand 810 states and 1709 transitions. [2018-06-26 17:36:05,515 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:36:05,515 INFO ]: Found error trace [2018-06-26 17:36:05,515 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:36:05,515 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:36:05,515 INFO ]: Analyzing trace with hash -1988741264, now seen corresponding path program 1 times [2018-06-26 17:36:05,515 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:36:05,515 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:36:05,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:36:05,517 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:36:05,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:36:05,534 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:36:05,731 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:36:05,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:36:05,732 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:36:05,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:36:05,796 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:36:05,804 INFO ]: Computing forward predicates... [2018-06-26 17:36:05,956 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:36:05,991 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:36:05,991 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-26 17:36:05,991 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:36:05,991 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:36:05,991 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:36:05,991 INFO ]: Start difference. First operand 810 states and 1709 transitions. Second operand 10 states. [2018-06-26 17:36:06,562 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-26 17:36:20,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:36:20,425 INFO ]: Finished difference Result 3101 states and 17903 transitions. [2018-06-26 17:36:20,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 17:36:20,425 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-26 17:36:20,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:36:20,936 INFO ]: With dead ends: 3101 [2018-06-26 17:36:20,936 INFO ]: Without dead ends: 3101 [2018-06-26 17:36:20,936 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:36:20,937 INFO ]: Start minimizeSevpa. Operand 3101 states. [2018-06-26 17:36:22,861 INFO ]: Finished minimizeSevpa. Reduced states from 3101 to 1229. [2018-06-26 17:36:22,861 INFO ]: Start removeUnreachable. Operand 1229 states. [2018-06-26 17:36:22,900 INFO ]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 2760 transitions. [2018-06-26 17:36:22,900 INFO ]: Start accepts. Automaton has 1229 states and 2760 transitions. Word has length 10 [2018-06-26 17:36:22,900 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:36:22,900 INFO ]: Abstraction has 1229 states and 2760 transitions. [2018-06-26 17:36:22,900 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:36:22,900 INFO ]: Start isEmpty. Operand 1229 states and 2760 transitions. [2018-06-26 17:36:22,942 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:36:22,942 INFO ]: Found error trace [2018-06-26 17:36:22,942 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:36:22,942 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:36:22,944 INFO ]: Analyzing trace with hash 1829060471, now seen corresponding path program 1 times [2018-06-26 17:36:22,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:36:22,944 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:36:22,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:36:22,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:36:22,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:36:22,967 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:36:23,328 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:36:23,328 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:36:23,328 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:36:23,328 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:36:23,328 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:36:23,328 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:36:23,328 INFO ]: Start difference. First operand 1229 states and 2760 transitions. Second operand 6 states. [2018-06-26 17:36:29,832 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:36:29,832 INFO ]: Finished difference Result 2909 states and 20535 transitions. [2018-06-26 17:36:29,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:36:29,832 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:36:29,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:36:30,393 INFO ]: With dead ends: 2909 [2018-06-26 17:36:30,393 INFO ]: Without dead ends: 2907 [2018-06-26 17:36:30,393 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:36:30,395 INFO ]: Start minimizeSevpa. Operand 2907 states. [2018-06-26 17:36:32,217 INFO ]: Finished minimizeSevpa. Reduced states from 2907 to 1935. [2018-06-26 17:36:32,217 INFO ]: Start removeUnreachable. Operand 1935 states. [2018-06-26 17:36:32,644 INFO ]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 5676 transitions. [2018-06-26 17:36:32,644 INFO ]: Start accepts. Automaton has 1935 states and 5676 transitions. Word has length 10 [2018-06-26 17:36:32,644 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:36:32,644 INFO ]: Abstraction has 1935 states and 5676 transitions. [2018-06-26 17:36:32,644 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:36:32,644 INFO ]: Start isEmpty. Operand 1935 states and 5676 transitions. [2018-06-26 17:36:32,684 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:36:32,684 INFO ]: Found error trace [2018-06-26 17:36:32,684 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:36:32,685 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:36:32,686 INFO ]: Analyzing trace with hash 1829061432, now seen corresponding path program 1 times [2018-06-26 17:36:32,686 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:36:32,686 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:36:32,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:36:32,687 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:36:32,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:36:32,709 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:36:33,147 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:36:33,147 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:36:33,148 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:36:33,148 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:36:33,148 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:36:33,148 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:36:33,148 INFO ]: Start difference. First operand 1935 states and 5676 transitions. Second operand 6 states. [2018-06-26 17:36:40,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:36:40,338 INFO ]: Finished difference Result 2902 states and 16360 transitions. [2018-06-26 17:36:40,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:36:40,339 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:36:40,339 INFO ]: Finished accepts. some prefix is accepted. Received shutdown request... [2018-06-26 17:36:40,762 INFO ]: With dead ends: 2902 [2018-06-26 17:36:40,762 INFO ]: Without dead ends: 2902 [2018-06-26 17:36:40,762 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:36:40,764 INFO ]: Start minimizeSevpa. Operand 2902 states. [2018-06-26 17:36:40,764 WARN ]: Verification canceled [2018-06-26 17:36:40,766 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:36:40,767 WARN ]: Timeout [2018-06-26 17:36:40,767 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:36:40 BasicIcfg [2018-06-26 17:36:40,767 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:36:40,769 INFO ]: Toolchain (without parser) took 55521.87 ms. Allocated memory was 305.1 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 235.5 MB in the beginning and 476.6 MB in the end (delta: -241.1 MB). Peak memory consumption was 808.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:36:40,770 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:36:40,770 INFO ]: ChcToBoogie took 114.28 ms. Allocated memory is still 305.1 MB. Free memory was 235.5 MB in the beginning and 229.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:36:40,770 INFO ]: Boogie Preprocessor took 123.06 ms. Allocated memory is still 305.1 MB. Free memory was 229.6 MB in the beginning and 227.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:36:40,771 INFO ]: RCFGBuilder took 1912.30 ms. Allocated memory was 305.1 MB in the beginning and 322.4 MB in the end (delta: 17.3 MB). Free memory was 227.6 MB in the beginning and 254.2 MB in the end (delta: -26.7 MB). Peak memory consumption was 49.3 MB. Max. memory is 3.6 GB. [2018-06-26 17:36:40,771 INFO ]: BlockEncodingV2 took 975.27 ms. Allocated memory is still 322.4 MB. Free memory was 254.2 MB in the beginning and 194.4 MB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 3.6 GB. [2018-06-26 17:36:40,773 INFO ]: TraceAbstraction took 52387.22 ms. Allocated memory was 322.4 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 194.4 MB in the beginning and 476.6 MB in the end (delta: -282.2 MB). Peak memory consumption was 749.6 MB. Max. memory is 3.6 GB. [2018-06-26 17:36:40,776 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 147 locations, 287 edges - StatisticsResult: Encoded RCFG 135 locations, 274 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 114.28 ms. Allocated memory is still 305.1 MB. Free memory was 235.5 MB in the beginning and 229.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 123.06 ms. Allocated memory is still 305.1 MB. Free memory was 229.6 MB in the beginning and 227.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1912.30 ms. Allocated memory was 305.1 MB in the beginning and 322.4 MB in the end (delta: 17.3 MB). Free memory was 227.6 MB in the beginning and 254.2 MB in the end (delta: -26.7 MB). Peak memory consumption was 49.3 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 975.27 ms. Allocated memory is still 322.4 MB. Free memory was 254.2 MB in the beginning and 194.4 MB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 52387.22 ms. Allocated memory was 322.4 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 194.4 MB in the beginning and 476.6 MB in the end (delta: -282.2 MB). Peak memory consumption was 749.6 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 executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. TIMEOUT Result, 52.3s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 43.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7984 SDtfs, 1487 SDslu, 20886 SDs, 0 SdLazy, 21641 SolverSat, 6679 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1935occurred 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: 6.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 4069 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 1319 SizeOfPredicates, 9 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 20/22 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.44.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-36-40-787.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.44.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-36-40-787.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.44.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-36-40-787.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.44.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-36-40-787.csv Completed graceful shutdown