java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.47.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:45:32,562 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:45:32,564 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:45:32,577 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:45:32,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:45:32,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:45:32,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:45:32,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:45:32,585 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:45:32,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:45:32,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:45:32,588 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:45:32,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:45:32,590 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:45:32,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:45:32,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:45:32,595 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:45:32,605 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:45:32,606 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:45:32,607 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:45:32,608 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:45:32,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:45:32,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:45:32,614 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:45:32,615 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:45:32,616 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:45:32,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:45:32,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:45:32,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:45:32,622 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:45:32,623 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:45:32,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:45:32,624 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:45:32,627 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:45:32,627 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:45:32,628 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 10:45:32,650 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:45:32,651 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:45:32,651 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:45:32,651 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:45:32,652 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:45:32,652 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:45:32,652 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:45:32,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:45:32,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:45:32,653 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:45:32,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:45:32,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:45:32,653 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:45:32,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:45:32,656 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:45:32,656 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:45:32,656 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:45:32,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:45:32,657 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:45:32,658 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:45:32,658 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:45:32,704 INFO ]: Repository-Root is: /tmp [2018-06-22 10:45:32,720 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:45:32,725 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:45:32,727 INFO ]: Initializing SmtParser... [2018-06-22 10:45:32,727 INFO ]: SmtParser initialized [2018-06-22 10:45:32,728 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.47.smt2 [2018-06-22 10:45:32,729 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-22 10:45:32,805 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.47.smt2 unknown [2018-06-22 10:45:33,377 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.47.smt2 [2018-06-22 10:45:33,381 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:45:33,387 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:45:33,387 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:45:33,387 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:45:33,387 INFO ]: ChcToBoogie initialized [2018-06-22 10:45:33,391 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:45:33" (1/1) ... [2018-06-22 10:45:33,478 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:45:33 Unit [2018-06-22 10:45:33,487 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:45:33,488 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:45:33,488 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:45:33,488 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:45:33,511 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:45:33" (1/1) ... [2018-06-22 10:45:33,511 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:45:33" (1/1) ... [2018-06-22 10:45:33,531 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:45:33" (1/1) ... [2018-06-22 10:45:33,532 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:45:33" (1/1) ... [2018-06-22 10:45:33,545 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:45:33" (1/1) ... [2018-06-22 10:45:33,551 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:45:33" (1/1) ... [2018-06-22 10:45:33,555 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:45:33" (1/1) ... [2018-06-22 10:45:33,559 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:45:33,559 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:45:33,559 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:45:33,559 INFO ]: RCFGBuilder initialized [2018-06-22 10:45:33,560 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:45:33" (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-22 10:45:33,573 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:45:33,573 INFO ]: Found specification of procedure False [2018-06-22 10:45:33,573 INFO ]: Found implementation of procedure False [2018-06-22 10:45:33,573 INFO ]: Specification and implementation of procedure step_lturn__bar given in one single declaration [2018-06-22 10:45:33,573 INFO ]: Found specification of procedure step_lturn__bar [2018-06-22 10:45:33,573 INFO ]: Found implementation of procedure step_lturn__bar [2018-06-22 10:45:33,573 INFO ]: Specification and implementation of procedure combined_lturn given in one single declaration [2018-06-22 10:45:33,573 INFO ]: Found specification of procedure combined_lturn [2018-06-22 10:45:33,573 INFO ]: Found implementation of procedure combined_lturn [2018-06-22 10:45:33,573 INFO ]: Specification and implementation of procedure lturn given in one single declaration [2018-06-22 10:45:33,573 INFO ]: Found specification of procedure lturn [2018-06-22 10:45:33,573 INFO ]: Found implementation of procedure lturn [2018-06-22 10:45:33,573 INFO ]: Specification and implementation of procedure step_lturn given in one single declaration [2018-06-22 10:45:33,573 INFO ]: Found specification of procedure step_lturn [2018-06-22 10:45:33,573 INFO ]: Found implementation of procedure step_lturn [2018-06-22 10:45:33,573 INFO ]: Specification and implementation of procedure combined_lturn__bar given in one single declaration [2018-06-22 10:45:33,573 INFO ]: Found specification of procedure combined_lturn__bar [2018-06-22 10:45:33,573 INFO ]: Found implementation of procedure combined_lturn__bar [2018-06-22 10:45:33,573 INFO ]: Specification and implementation of procedure lturn__bar given in one single declaration [2018-06-22 10:45:33,574 INFO ]: Found specification of procedure lturn__bar [2018-06-22 10:45:33,574 INFO ]: Found implementation of procedure lturn__bar [2018-06-22 10:45:33,574 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:45:33,574 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:45:33,574 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-22 10:45:35,132 INFO ]: Using library mode [2018-06-22 10:45:35,133 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:45:35 BoogieIcfgContainer [2018-06-22 10:45:35,133 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:45:35,134 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:45:35,134 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:45:35,137 INFO ]: TraceAbstraction initialized [2018-06-22 10:45:35,138 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:45:33" (1/3) ... [2018-06-22 10:45:35,139 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e06029e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:45:35, skipping insertion in model container [2018-06-22 10:45:35,139 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:45:33" (2/3) ... [2018-06-22 10:45:35,139 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e06029e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:45:35, skipping insertion in model container [2018-06-22 10:45:35,139 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:45:35" (3/3) ... [2018-06-22 10:45:35,141 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:45:35,150 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:45:35,164 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:45:35,213 INFO ]: Using default assertion order modulation [2018-06-22 10:45:35,213 INFO ]: Interprodecural is true [2018-06-22 10:45:35,213 INFO ]: Hoare is false [2018-06-22 10:45:35,213 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:45:35,213 INFO ]: Backedges is TWOTRACK [2018-06-22 10:45:35,213 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:45:35,214 INFO ]: Difference is false [2018-06-22 10:45:35,214 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:45:35,214 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:45:35,240 INFO ]: Start isEmpty. Operand 162 states. [2018-06-22 10:45:35,291 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:45:35,292 INFO ]: Found error trace [2018-06-22 10:45:35,293 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:45:35,293 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:45:35,305 INFO ]: Analyzing trace with hash -345907529, now seen corresponding path program 1 times [2018-06-22 10:45:35,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:45:35,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:45:35,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:35,359 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:45:35,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:35,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:45:35,876 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:45:35,879 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:45:35,879 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 10:45:35,881 INFO ]: Interpolant automaton has 5 states [2018-06-22 10:45:35,896 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 10:45:35,896 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:45:35,899 INFO ]: Start difference. First operand 162 states. Second operand 5 states. [2018-06-22 10:45:38,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:45:38,428 INFO ]: Finished difference Result 232 states and 649 transitions. [2018-06-22 10:45:38,430 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 10:45:38,431 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 10:45:38,431 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:45:38,459 INFO ]: With dead ends: 232 [2018-06-22 10:45:38,460 INFO ]: Without dead ends: 222 [2018-06-22 10:45:38,461 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:45:38,479 INFO ]: Start minimizeSevpa. Operand 222 states. [2018-06-22 10:45:38,675 INFO ]: Finished minimizeSevpa. Reduced states from 222 to 199. [2018-06-22 10:45:38,676 INFO ]: Start removeUnreachable. Operand 199 states. [2018-06-22 10:45:38,684 INFO ]: Finished removeUnreachable. Reduced from 199 states to 199 states and 570 transitions. [2018-06-22 10:45:38,685 INFO ]: Start accepts. Automaton has 199 states and 570 transitions. Word has length 17 [2018-06-22 10:45:38,687 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:45:38,687 INFO ]: Abstraction has 199 states and 570 transitions. [2018-06-22 10:45:38,687 INFO ]: Interpolant automaton has 5 states. [2018-06-22 10:45:38,687 INFO ]: Start isEmpty. Operand 199 states and 570 transitions. [2018-06-22 10:45:38,694 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:45:38,694 INFO ]: Found error trace [2018-06-22 10:45:38,694 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:45:38,694 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:45:38,694 INFO ]: Analyzing trace with hash -776927636, now seen corresponding path program 1 times [2018-06-22 10:45:38,694 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:45:38,694 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:45:38,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:38,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:45:38,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:38,730 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:45:38,849 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:45:38,850 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:45:38,850 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:45:38,851 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:45:38,852 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:45:38,852 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:45:38,852 INFO ]: Start difference. First operand 199 states and 570 transitions. Second operand 6 states. [2018-06-22 10:45:40,334 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:45:40,334 INFO ]: Finished difference Result 272 states and 1024 transitions. [2018-06-22 10:45:40,334 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:45:40,334 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:45:40,334 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:45:40,345 INFO ]: With dead ends: 272 [2018-06-22 10:45:40,345 INFO ]: Without dead ends: 272 [2018-06-22 10:45:40,346 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:45:40,346 INFO ]: Start minimizeSevpa. Operand 272 states. [2018-06-22 10:45:40,439 INFO ]: Finished minimizeSevpa. Reduced states from 272 to 266. [2018-06-22 10:45:40,439 INFO ]: Start removeUnreachable. Operand 266 states. [2018-06-22 10:45:40,447 INFO ]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1006 transitions. [2018-06-22 10:45:40,447 INFO ]: Start accepts. Automaton has 266 states and 1006 transitions. Word has length 17 [2018-06-22 10:45:40,447 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:45:40,447 INFO ]: Abstraction has 266 states and 1006 transitions. [2018-06-22 10:45:40,447 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:45:40,447 INFO ]: Start isEmpty. Operand 266 states and 1006 transitions. [2018-06-22 10:45:40,451 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:45:40,451 INFO ]: Found error trace [2018-06-22 10:45:40,451 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:45:40,451 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:45:40,451 INFO ]: Analyzing trace with hash 1899346408, now seen corresponding path program 1 times [2018-06-22 10:45:40,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:45:40,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:45:40,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:40,452 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:45:40,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:40,474 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:45:40,843 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:45:40,843 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:45:40,843 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:45:40,844 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:45:40,844 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:45:40,844 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:45:40,844 INFO ]: Start difference. First operand 266 states and 1006 transitions. Second operand 6 states. [2018-06-22 10:45:42,443 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:45:42,443 INFO ]: Finished difference Result 317 states and 1376 transitions. [2018-06-22 10:45:42,444 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:45:42,444 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:45:42,444 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:45:42,455 INFO ]: With dead ends: 317 [2018-06-22 10:45:42,455 INFO ]: Without dead ends: 317 [2018-06-22 10:45:42,455 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:45:42,456 INFO ]: Start minimizeSevpa. Operand 317 states. [2018-06-22 10:45:42,566 INFO ]: Finished minimizeSevpa. Reduced states from 317 to 266. [2018-06-22 10:45:42,566 INFO ]: Start removeUnreachable. Operand 266 states. [2018-06-22 10:45:42,572 INFO ]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1006 transitions. [2018-06-22 10:45:42,572 INFO ]: Start accepts. Automaton has 266 states and 1006 transitions. Word has length 17 [2018-06-22 10:45:42,572 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:45:42,573 INFO ]: Abstraction has 266 states and 1006 transitions. [2018-06-22 10:45:42,573 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:45:42,573 INFO ]: Start isEmpty. Operand 266 states and 1006 transitions. [2018-06-22 10:45:42,576 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:45:42,576 INFO ]: Found error trace [2018-06-22 10:45:42,576 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:45:42,576 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:45:42,576 INFO ]: Analyzing trace with hash -1208751840, now seen corresponding path program 1 times [2018-06-22 10:45:42,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:45:42,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:45:42,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:42,577 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:45:42,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:42,593 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:45:42,707 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:45:42,707 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:45:42,707 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:45:42,708 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:45:42,708 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:45:42,708 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:45:42,708 INFO ]: Start difference. First operand 266 states and 1006 transitions. Second operand 6 states. [2018-06-22 10:45:44,115 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:45:44,115 INFO ]: Finished difference Result 370 states and 1836 transitions. [2018-06-22 10:45:44,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:45:44,116 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:45:44,116 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:45:44,132 INFO ]: With dead ends: 370 [2018-06-22 10:45:44,132 INFO ]: Without dead ends: 370 [2018-06-22 10:45:44,132 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:45:44,133 INFO ]: Start minimizeSevpa. Operand 370 states. [2018-06-22 10:45:44,315 INFO ]: Finished minimizeSevpa. Reduced states from 370 to 367. [2018-06-22 10:45:44,315 INFO ]: Start removeUnreachable. Operand 367 states. [2018-06-22 10:45:44,325 INFO ]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1828 transitions. [2018-06-22 10:45:44,325 INFO ]: Start accepts. Automaton has 367 states and 1828 transitions. Word has length 17 [2018-06-22 10:45:44,325 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:45:44,325 INFO ]: Abstraction has 367 states and 1828 transitions. [2018-06-22 10:45:44,325 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:45:44,325 INFO ]: Start isEmpty. Operand 367 states and 1828 transitions. [2018-06-22 10:45:44,329 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:45:44,329 INFO ]: Found error trace [2018-06-22 10:45:44,329 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:45:44,329 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:45:44,329 INFO ]: Analyzing trace with hash -1149278885, now seen corresponding path program 1 times [2018-06-22 10:45:44,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:45:44,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:45:44,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:44,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:45:44,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:44,359 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:45:44,749 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:45:44,749 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:45:44,749 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:45:44,749 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:45:44,749 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:45:44,749 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:45:44,749 INFO ]: Start difference. First operand 367 states and 1828 transitions. Second operand 6 states. [2018-06-22 10:45:45,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:45:45,879 INFO ]: Finished difference Result 460 states and 2727 transitions. [2018-06-22 10:45:45,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:45:45,880 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:45:45,880 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:45:45,897 INFO ]: With dead ends: 460 [2018-06-22 10:45:45,897 INFO ]: Without dead ends: 460 [2018-06-22 10:45:45,897 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:45:45,898 INFO ]: Start minimizeSevpa. Operand 460 states. [2018-06-22 10:45:46,252 INFO ]: Finished minimizeSevpa. Reduced states from 460 to 457. [2018-06-22 10:45:46,252 INFO ]: Start removeUnreachable. Operand 457 states. [2018-06-22 10:45:46,263 INFO ]: Finished removeUnreachable. Reduced from 457 states to 457 states and 2717 transitions. [2018-06-22 10:45:46,263 INFO ]: Start accepts. Automaton has 457 states and 2717 transitions. Word has length 17 [2018-06-22 10:45:46,263 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:45:46,263 INFO ]: Abstraction has 457 states and 2717 transitions. [2018-06-22 10:45:46,263 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:45:46,264 INFO ]: Start isEmpty. Operand 457 states and 2717 transitions. [2018-06-22 10:45:46,270 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:45:46,270 INFO ]: Found error trace [2018-06-22 10:45:46,270 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:45:46,270 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:45:46,271 INFO ]: Analyzing trace with hash 889266118, now seen corresponding path program 1 times [2018-06-22 10:45:46,271 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:45:46,271 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:45:46,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:46,272 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:45:46,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:46,303 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:45:46,702 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 10:45:46,702 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:45:46,702 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-22 10:45:46,718 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:45:46,780 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:45:46,789 INFO ]: Computing forward predicates... [2018-06-22 10:45:46,928 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:45:46,961 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:45:46,962 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-06-22 10:45:46,962 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:45:46,962 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:45:46,962 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:45:46,962 INFO ]: Start difference. First operand 457 states and 2717 transitions. Second operand 11 states. [2018-06-22 10:45:52,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:45:52,615 INFO ]: Finished difference Result 745 states and 7413 transitions. [2018-06-22 10:45:52,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:45:52,615 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 10:45:52,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:45:52,668 INFO ]: With dead ends: 745 [2018-06-22 10:45:52,668 INFO ]: Without dead ends: 745 [2018-06-22 10:45:52,668 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:45:52,669 INFO ]: Start minimizeSevpa. Operand 745 states. [2018-06-22 10:45:53,509 INFO ]: Finished minimizeSevpa. Reduced states from 745 to 722. [2018-06-22 10:45:53,509 INFO ]: Start removeUnreachable. Operand 722 states. [2018-06-22 10:45:53,542 INFO ]: Finished removeUnreachable. Reduced from 722 states to 722 states and 6665 transitions. [2018-06-22 10:45:53,543 INFO ]: Start accepts. Automaton has 722 states and 6665 transitions. Word has length 21 [2018-06-22 10:45:53,543 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:45:53,543 INFO ]: Abstraction has 722 states and 6665 transitions. [2018-06-22 10:45:53,543 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:45:53,543 INFO ]: Start isEmpty. Operand 722 states and 6665 transitions. [2018-06-22 10:45:53,553 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:45:53,553 INFO ]: Found error trace [2018-06-22 10:45:53,553 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:45:53,553 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:45:53,553 INFO ]: Analyzing trace with hash -1661296856, now seen corresponding path program 1 times [2018-06-22 10:45:53,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:45:53,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:45:53,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:53,555 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:45:53,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:53,581 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:45:53,987 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:45:53,987 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:45:53,987 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:45:53,987 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:45:53,987 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:45:53,987 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:45:53,987 INFO ]: Start difference. First operand 722 states and 6665 transitions. Second operand 6 states. [2018-06-22 10:45:56,316 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:45:56,316 INFO ]: Finished difference Result 1068 states and 10804 transitions. [2018-06-22 10:45:56,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:45:56,382 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:45:56,382 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:45:56,498 INFO ]: With dead ends: 1068 [2018-06-22 10:45:56,498 INFO ]: Without dead ends: 1068 [2018-06-22 10:45:56,499 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:45:56,499 INFO ]: Start minimizeSevpa. Operand 1068 states. [2018-06-22 10:45:57,587 INFO ]: Finished minimizeSevpa. Reduced states from 1068 to 1023. [2018-06-22 10:45:57,588 INFO ]: Start removeUnreachable. Operand 1023 states. [2018-06-22 10:45:57,635 INFO ]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 10422 transitions. [2018-06-22 10:45:57,635 INFO ]: Start accepts. Automaton has 1023 states and 10422 transitions. Word has length 17 [2018-06-22 10:45:57,636 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:45:57,636 INFO ]: Abstraction has 1023 states and 10422 transitions. [2018-06-22 10:45:57,636 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:45:57,636 INFO ]: Start isEmpty. Operand 1023 states and 10422 transitions. [2018-06-22 10:45:57,654 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:45:57,654 INFO ]: Found error trace [2018-06-22 10:45:57,654 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:45:57,655 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:45:57,655 INFO ]: Analyzing trace with hash -1144965980, now seen corresponding path program 1 times [2018-06-22 10:45:57,655 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:45:57,655 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:45:57,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:57,655 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:45:57,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:45:57,675 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:45:58,047 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:45:58,047 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:45:58,047 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:45:58,047 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:45:58,047 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:45:58,047 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:45:58,047 INFO ]: Start difference. First operand 1023 states and 10422 transitions. Second operand 6 states. [2018-06-22 10:46:00,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:46:00,266 INFO ]: Finished difference Result 1216 states and 12421 transitions. [2018-06-22 10:46:00,267 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:46:00,267 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:46:00,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:46:00,325 INFO ]: With dead ends: 1216 [2018-06-22 10:46:00,325 INFO ]: Without dead ends: 1216 [2018-06-22 10:46:00,326 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:46:00,326 INFO ]: Start minimizeSevpa. Operand 1216 states. [2018-06-22 10:46:01,151 INFO ]: Finished minimizeSevpa. Reduced states from 1216 to 1174. [2018-06-22 10:46:01,151 INFO ]: Start removeUnreachable. Operand 1174 states. [2018-06-22 10:46:01,205 INFO ]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 12039 transitions. [2018-06-22 10:46:01,205 INFO ]: Start accepts. Automaton has 1174 states and 12039 transitions. Word has length 17 [2018-06-22 10:46:01,205 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:46:01,205 INFO ]: Abstraction has 1174 states and 12039 transitions. [2018-06-22 10:46:01,205 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:46:01,205 INFO ]: Start isEmpty. Operand 1174 states and 12039 transitions. [2018-06-22 10:46:01,223 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:46:01,223 INFO ]: Found error trace [2018-06-22 10:46:01,223 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:46:01,223 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:46:01,223 INFO ]: Analyzing trace with hash 216336348, now seen corresponding path program 1 times [2018-06-22 10:46:01,223 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:46:01,223 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:46:01,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:46:01,224 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:46:01,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:46:01,243 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:46:01,634 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:46:01,634 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:46:01,634 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:46:01,634 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:46:01,634 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:46:01,634 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:46:01,634 INFO ]: Start difference. First operand 1174 states and 12039 transitions. Second operand 6 states. [2018-06-22 10:46:03,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:46:03,864 INFO ]: Finished difference Result 1627 states and 16658 transitions. [2018-06-22 10:46:03,864 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:46:03,864 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:46:03,864 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:46:03,945 INFO ]: With dead ends: 1627 [2018-06-22 10:46:03,945 INFO ]: Without dead ends: 1627 [2018-06-22 10:46:03,945 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:46:03,946 INFO ]: Start minimizeSevpa. Operand 1627 states. [2018-06-22 10:46:04,937 INFO ]: Finished minimizeSevpa. Reduced states from 1627 to 1554. [2018-06-22 10:46:04,938 INFO ]: Start removeUnreachable. Operand 1554 states. [2018-06-22 10:46:05,018 INFO ]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 15849 transitions. [2018-06-22 10:46:05,018 INFO ]: Start accepts. Automaton has 1554 states and 15849 transitions. Word has length 17 [2018-06-22 10:46:05,018 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:46:05,018 INFO ]: Abstraction has 1554 states and 15849 transitions. [2018-06-22 10:46:05,018 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:46:05,018 INFO ]: Start isEmpty. Operand 1554 states and 15849 transitions. [2018-06-22 10:46:05,032 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:46:05,033 INFO ]: Found error trace [2018-06-22 10:46:05,033 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:46:05,033 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:46:05,033 INFO ]: Analyzing trace with hash 697429655, now seen corresponding path program 1 times [2018-06-22 10:46:05,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:46:05,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:46:05,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:46:05,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:46:05,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:46:05,059 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:46:05,426 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:46:05,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:46:05,426 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:46:05,427 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:46:05,427 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:46:05,427 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:46:05,427 INFO ]: Start difference. First operand 1554 states and 15849 transitions. Second operand 6 states. [2018-06-22 10:46:06,963 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:46:06,963 INFO ]: Finished difference Result 1842 states and 19053 transitions. [2018-06-22 10:46:06,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:46:06,964 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:46:06,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:46:07,084 INFO ]: With dead ends: 1842 [2018-06-22 10:46:07,084 INFO ]: Without dead ends: 1842 [2018-06-22 10:46:07,084 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:46:07,086 INFO ]: Start minimizeSevpa. Operand 1842 states. [2018-06-22 10:46:08,232 INFO ]: Finished minimizeSevpa. Reduced states from 1842 to 1786. [2018-06-22 10:46:08,232 INFO ]: Start removeUnreachable. Operand 1786 states. [2018-06-22 10:46:08,321 INFO ]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 18377 transitions. [2018-06-22 10:46:08,321 INFO ]: Start accepts. Automaton has 1786 states and 18377 transitions. Word has length 17 [2018-06-22 10:46:08,321 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:46:08,321 INFO ]: Abstraction has 1786 states and 18377 transitions. [2018-06-22 10:46:08,321 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:46:08,321 INFO ]: Start isEmpty. Operand 1786 states and 18377 transitions. [2018-06-22 10:46:08,338 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:46:08,338 INFO ]: Found error trace [2018-06-22 10:46:08,338 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:46:08,338 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:46:08,338 INFO ]: Analyzing trace with hash -812724215, now seen corresponding path program 1 times [2018-06-22 10:46:08,338 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:46:08,338 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:46:08,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:46:08,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:46:08,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:46:08,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:46:08,575 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 10:46:08,575 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:46:08,575 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 10:46:08,593 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:46:08,645 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:46:08,649 INFO ]: Computing forward predicates... [2018-06-22 10:46:08,880 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:46:08,899 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:46:08,899 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-22 10:46:08,900 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:46:08,900 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:46:08,900 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:46:08,900 INFO ]: Start difference. First operand 1786 states and 18377 transitions. Second operand 13 states. [2018-06-22 10:46:27,690 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:46:27,690 INFO ]: Finished difference Result 7831 states and 332803 transitions. [2018-06-22 10:46:27,784 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 10:46:27,784 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 10:46:27,784 INFO ]: Finished accepts. some prefix is accepted. Received shutdown request... [2018-06-22 10:46:31,171 INFO ]: With dead ends: 7831 [2018-06-22 10:46:31,171 INFO ]: Without dead ends: 7831 [2018-06-22 10:46:31,172 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 10:46:31,175 INFO ]: Start minimizeSevpa. Operand 7831 states. [2018-06-22 10:46:31,175 WARN ]: Verification canceled [2018-06-22 10:46:31,179 WARN ]: Timeout [2018-06-22 10:46:31,179 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:46:31 BoogieIcfgContainer [2018-06-22 10:46:31,179 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:46:31,180 INFO ]: Toolchain (without parser) took 57798.13 ms. Allocated memory was 307.8 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 237.4 MB in the beginning and 970.4 MB in the end (delta: -733.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 3.6 GB. [2018-06-22 10:46:31,181 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 307.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:46:31,182 INFO ]: ChcToBoogie took 100.07 ms. Allocated memory is still 307.8 MB. Free memory was 236.4 MB in the beginning and 233.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:46:31,182 INFO ]: Boogie Preprocessor took 71.29 ms. Allocated memory is still 307.8 MB. Free memory was 233.4 MB in the beginning and 230.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. [2018-06-22 10:46:31,182 INFO ]: RCFGBuilder took 1573.78 ms. Allocated memory was 307.8 MB in the beginning and 323.5 MB in the end (delta: 15.7 MB). Free memory was 230.3 MB in the beginning and 275.8 MB in the end (delta: -45.4 MB). Peak memory consumption was 49.2 MB. Max. memory is 3.6 GB. [2018-06-22 10:46:31,183 INFO ]: TraceAbstraction took 56044.78 ms. Allocated memory was 323.5 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 274.3 MB in the beginning and 970.4 MB in the end (delta: -696.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 3.6 GB. [2018-06-22 10:46:31,192 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 307.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 100.07 ms. Allocated memory is still 307.8 MB. Free memory was 236.4 MB in the beginning and 233.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 71.29 ms. Allocated memory is still 307.8 MB. Free memory was 233.4 MB in the beginning and 230.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1573.78 ms. Allocated memory was 307.8 MB in the beginning and 323.5 MB in the end (delta: 15.7 MB). Free memory was 230.3 MB in the beginning and 275.8 MB in the end (delta: -45.4 MB). Peak memory consumption was 49.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56044.78 ms. Allocated memory was 323.5 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 274.3 MB in the beginning and 970.4 MB in the end (delta: -696.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 162 locations, 1 error locations. TIMEOUT Result, 55.9s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 44.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4181 SDtfs, 198 SDslu, 18835 SDs, 0 SdLazy, 30490 SolverSat, 2225 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1786occurred in iteration=10, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 325 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 11072 SizeOfPredicates, 7 NumberOfNonLiveVariables, 681 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 19/39 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_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-46-31-207.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.47.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-46-31-207.csv Completed graceful shutdown