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/llreve-bench/unsolved/arrayOffByOne.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 12:18:51,466 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 12:18:51,468 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 12:18:51,479 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 12:18:51,480 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 12:18:51,480 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 12:18:51,481 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 12:18:51,485 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 12:18:51,487 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 12:18:51,487 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 12:18:51,489 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 12:18:51,490 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 12:18:51,490 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 12:18:51,491 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 12:18:51,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 12:18:51,495 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 12:18:51,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 12:18:51,506 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 12:18:51,510 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 12:18:51,511 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 12:18:51,512 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 12:18:51,513 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 12:18:51,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 12:18:51,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 12:18:51,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 12:18:51,515 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 12:18:51,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 12:18:51,518 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 12:18:51,519 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 12:18:51,519 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 12:18:51,520 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 12:18:51,520 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 12:18:51,520 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 12:18:51,525 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 12:18:51,526 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 12:18:51,526 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 12:18:51,545 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 12:18:51,546 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 12:18:51,547 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 12:18:51,547 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 12:18:51,548 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 12:18:51,548 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 12:18:51,548 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 12:18:51,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 12:18:51,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 12:18:51,549 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 12:18:51,549 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 12:18:51,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 12:18:51,550 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 12:18:51,552 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 12:18:51,552 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 12:18:51,553 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 12:18:51,553 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 12:18:51,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 12:18:51,553 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 12:18:51,554 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 12:18:51,555 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 12:18:51,604 INFO ]: Repository-Root is: /tmp [2018-06-22 12:18:51,619 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 12:18:51,624 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 12:18:51,625 INFO ]: Initializing SmtParser... [2018-06-22 12:18:51,625 INFO ]: SmtParser initialized [2018-06-22 12:18:51,626 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/unsolved/arrayOffByOne.smt2 [2018-06-22 12:18:51,627 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 12:18:51,700 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/unsolved/arrayOffByOne.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@62e780ba [2018-06-22 12:18:51,880 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/unsolved/arrayOffByOne.smt2 [2018-06-22 12:18:51,888 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 12:18:51,895 INFO ]: Walking toolchain with 4 elements. [2018-06-22 12:18:51,896 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 12:18:51,896 INFO ]: Initializing ChcToBoogie... [2018-06-22 12:18:51,896 INFO ]: ChcToBoogie initialized [2018-06-22 12:18:51,900 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:18:51" (1/1) ... [2018-06-22 12:18:51,950 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:51 Unit [2018-06-22 12:18:51,950 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 12:18:51,951 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 12:18:51,951 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 12:18:51,951 INFO ]: Boogie Preprocessor initialized [2018-06-22 12:18:51,972 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:51" (1/1) ... [2018-06-22 12:18:51,972 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:51" (1/1) ... [2018-06-22 12:18:51,984 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:51" (1/1) ... [2018-06-22 12:18:51,984 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:51" (1/1) ... [2018-06-22 12:18:51,988 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:51" (1/1) ... [2018-06-22 12:18:51,989 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:51" (1/1) ... [2018-06-22 12:18:51,990 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:51" (1/1) ... [2018-06-22 12:18:51,992 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 12:18:51,992 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 12:18:51,993 INFO ]: Initializing RCFGBuilder... [2018-06-22 12:18:51,993 INFO ]: RCFGBuilder initialized [2018-06-22 12:18:51,993 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:51" (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 12:18:52,015 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 12:18:52,015 INFO ]: Found specification of procedure False [2018-06-22 12:18:52,015 INFO ]: Found implementation of procedure False [2018-06-22 12:18:52,015 INFO ]: Specification and implementation of procedure INV_MAIN_2 given in one single declaration [2018-06-22 12:18:52,015 INFO ]: Found specification of procedure INV_MAIN_2 [2018-06-22 12:18:52,015 INFO ]: Found implementation of procedure INV_MAIN_2 [2018-06-22 12:18:52,015 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-22 12:18:52,015 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-22 12:18:52,015 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-22 12:18:52,015 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 12:18:52,015 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 12:18:52,015 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 12:18:52,389 INFO ]: Using library mode [2018-06-22 12:18:52,389 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:18:52 BoogieIcfgContainer [2018-06-22 12:18:52,389 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 12:18:52,390 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 12:18:52,390 INFO ]: Initializing TraceAbstraction... [2018-06-22 12:18:52,393 INFO ]: TraceAbstraction initialized [2018-06-22 12:18:52,393 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:18:51" (1/3) ... [2018-06-22 12:18:52,394 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65da070a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:18:52, skipping insertion in model container [2018-06-22 12:18:52,394 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:51" (2/3) ... [2018-06-22 12:18:52,395 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65da070a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:18:52, skipping insertion in model container [2018-06-22 12:18:52,395 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:18:52" (3/3) ... [2018-06-22 12:18:52,396 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 12:18:52,405 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 12:18:52,413 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 12:18:52,455 INFO ]: Using default assertion order modulation [2018-06-22 12:18:52,456 INFO ]: Interprodecural is true [2018-06-22 12:18:52,456 INFO ]: Hoare is false [2018-06-22 12:18:52,456 INFO ]: Compute interpolants for FPandBP [2018-06-22 12:18:52,464 INFO ]: Backedges is TWOTRACK [2018-06-22 12:18:52,464 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 12:18:52,465 INFO ]: Difference is false [2018-06-22 12:18:52,465 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 12:18:52,465 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 12:18:52,488 INFO ]: Start isEmpty. Operand 20 states. [2018-06-22 12:18:52,501 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 12:18:52,502 INFO ]: Found error trace [2018-06-22 12:18:52,503 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:52,503 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:52,507 INFO ]: Analyzing trace with hash 293971383, now seen corresponding path program 1 times [2018-06-22 12:18:52,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:52,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:52,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:52,542 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:52,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:52,585 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:52,729 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:18:52,731 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:52,731 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:18:52,733 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:18:52,743 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:18:52,743 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:18:52,745 INFO ]: Start difference. First operand 20 states. Second operand 4 states. [2018-06-22 12:18:52,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:52,873 INFO ]: Finished difference Result 20 states and 28 transitions. [2018-06-22 12:18:52,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:18:52,875 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 12:18:52,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:52,885 INFO ]: With dead ends: 20 [2018-06-22 12:18:52,885 INFO ]: Without dead ends: 20 [2018-06-22 12:18:52,887 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:18:52,901 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 12:18:52,925 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 12:18:52,926 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 12:18:52,927 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-06-22 12:18:52,930 INFO ]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 9 [2018-06-22 12:18:52,930 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:52,930 INFO ]: Abstraction has 20 states and 28 transitions. [2018-06-22 12:18:52,930 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:18:52,930 INFO ]: Start isEmpty. Operand 20 states and 28 transitions. [2018-06-22 12:18:52,932 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:18:52,932 INFO ]: Found error trace [2018-06-22 12:18:52,932 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:52,932 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:52,932 INFO ]: Analyzing trace with hash 33227105, now seen corresponding path program 1 times [2018-06-22 12:18:52,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:52,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:52,935 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:52,935 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:52,935 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:52,944 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:52,982 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:18:52,982 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:52,982 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:18:52,984 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:18:52,984 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:18:52,984 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:18:52,984 INFO ]: Start difference. First operand 20 states and 28 transitions. Second operand 4 states. [2018-06-22 12:18:53,129 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:53,129 INFO ]: Finished difference Result 22 states and 31 transitions. [2018-06-22 12:18:53,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:18:53,130 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 12:18:53,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:53,131 INFO ]: With dead ends: 22 [2018-06-22 12:18:53,131 INFO ]: Without dead ends: 22 [2018-06-22 12:18:53,131 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:18:53,132 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 12:18:53,138 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-22 12:18:53,138 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 12:18:53,139 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-22 12:18:53,139 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-06-22 12:18:53,139 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:53,140 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-22 12:18:53,140 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:18:53,140 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-22 12:18:53,140 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:18:53,140 INFO ]: Found error trace [2018-06-22 12:18:53,141 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:53,141 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:53,141 INFO ]: Analyzing trace with hash 1640733977, now seen corresponding path program 1 times [2018-06-22 12:18:53,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:53,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:53,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:53,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:53,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:53,155 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:53,269 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:18:53,269 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:53,269 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:18:53,270 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:18:53,270 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:18:53,270 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:18:53,270 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 5 states. [2018-06-22 12:18:53,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:53,337 INFO ]: Finished difference Result 22 states and 28 transitions. [2018-06-22 12:18:53,337 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 12:18:53,337 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 12:18:53,337 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:53,338 INFO ]: With dead ends: 22 [2018-06-22 12:18:53,338 INFO ]: Without dead ends: 21 [2018-06-22 12:18:53,338 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:18:53,338 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 12:18:53,342 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 12:18:53,342 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 12:18:53,343 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-06-22 12:18:53,345 INFO ]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2018-06-22 12:18:53,345 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:53,345 INFO ]: Abstraction has 19 states and 24 transitions. [2018-06-22 12:18:53,345 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:18:53,345 INFO ]: Start isEmpty. Operand 19 states and 24 transitions. [2018-06-22 12:18:53,346 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:18:53,346 INFO ]: Found error trace [2018-06-22 12:18:53,346 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:53,346 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:53,346 INFO ]: Analyzing trace with hash -1429358370, now seen corresponding path program 1 times [2018-06-22 12:18:53,346 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:53,346 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:53,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:53,347 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:53,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:53,367 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:53,530 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:18:53,530 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:53,530 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:18:53,531 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:18:53,531 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:18:53,531 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:18:53,531 INFO ]: Start difference. First operand 19 states and 24 transitions. Second operand 4 states. [2018-06-22 12:18:53,669 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:53,669 INFO ]: Finished difference Result 23 states and 29 transitions. [2018-06-22 12:18:53,670 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:18:53,670 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 12:18:53,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:53,671 INFO ]: With dead ends: 23 [2018-06-22 12:18:53,671 INFO ]: Without dead ends: 23 [2018-06-22 12:18:53,671 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:18:53,671 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 12:18:53,679 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-22 12:18:53,679 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 12:18:53,680 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-22 12:18:53,680 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 17 [2018-06-22 12:18:53,680 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:53,680 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-22 12:18:53,680 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:18:53,681 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-22 12:18:53,683 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:18:53,683 INFO ]: Found error trace [2018-06-22 12:18:53,683 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:53,683 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:53,684 INFO ]: Analyzing trace with hash -1891850685, now seen corresponding path program 1 times [2018-06-22 12:18:53,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:53,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:53,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:53,684 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:53,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:53,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:54,114 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:18:54,114 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:54,114 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 12:18:54,121 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:54,157 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:54,165 INFO ]: Computing forward predicates... [2018-06-22 12:18:54,275 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:18:54,298 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 12:18:54,299 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-06-22 12:18:54,299 INFO ]: Interpolant automaton has 10 states [2018-06-22 12:18:54,299 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 12:18:54,299 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:18:54,299 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 10 states. [2018-06-22 12:18:54,492 WARN ]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 12:18:55,265 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:55,265 INFO ]: Finished difference Result 23 states and 28 transitions. [2018-06-22 12:18:55,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 12:18:55,265 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 12:18:55,265 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:55,266 INFO ]: With dead ends: 23 [2018-06-22 12:18:55,266 INFO ]: Without dead ends: 23 [2018-06-22 12:18:55,266 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-22 12:18:55,266 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 12:18:55,270 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-22 12:18:55,270 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 12:18:55,271 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-06-22 12:18:55,271 INFO ]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2018-06-22 12:18:55,271 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:55,271 INFO ]: Abstraction has 21 states and 26 transitions. [2018-06-22 12:18:55,271 INFO ]: Interpolant automaton has 10 states. [2018-06-22 12:18:55,271 INFO ]: Start isEmpty. Operand 21 states and 26 transitions. [2018-06-22 12:18:55,272 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:18:55,272 INFO ]: Found error trace [2018-06-22 12:18:55,272 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:55,272 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:55,272 INFO ]: Analyzing trace with hash 772980451, now seen corresponding path program 1 times [2018-06-22 12:18:55,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:55,272 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:55,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:55,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:55,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:55,314 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:55,535 WARN ]: Spent 116.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2018-06-22 12:18:55,674 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2018-06-22 12:18:55,916 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 12:18:55,916 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:55,916 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 12:18:55,933 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 12:18:55,973 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:55,977 INFO ]: Computing forward predicates... [2018-06-22 12:18:56,119 INFO ]: detected not equals via solver [2018-06-22 12:18:56,124 INFO ]: detected not equals via solver [2018-06-22 12:18:56,183 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 63 [2018-06-22 12:18:56,188 INFO ]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2018-06-22 12:18:56,234 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-06-22 12:18:56,234 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:41 [2018-06-22 12:18:56,535 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-06-22 12:18:56,536 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 12:18:56,548 WARN ]: Array PQE input equivalent to false [2018-06-22 12:18:56,548 INFO ]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-06-22 12:18:56,569 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-06-22 12:18:56,569 INFO ]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-06-22 12:18:56,574 INFO ]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:18:56,574 INFO ]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:3 [2018-06-22 12:18:56,580 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 12:18:56,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:18:56,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-22 12:18:56,602 INFO ]: Interpolant automaton has 16 states [2018-06-22 12:18:56,602 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 12:18:56,603 INFO ]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-06-22 12:18:56,603 INFO ]: Start difference. First operand 21 states and 26 transitions. Second operand 16 states. [2018-06-22 12:18:56,945 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 26 [2018-06-22 12:18:57,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:57,022 INFO ]: Finished difference Result 29 states and 36 transitions. [2018-06-22 12:18:57,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 12:18:57,024 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 12:18:57,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:57,025 INFO ]: With dead ends: 29 [2018-06-22 12:18:57,025 INFO ]: Without dead ends: 29 [2018-06-22 12:18:57,025 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-06-22 12:18:57,025 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 12:18:57,031 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 12:18:57,031 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 12:18:57,031 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-06-22 12:18:57,031 INFO ]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 21 [2018-06-22 12:18:57,032 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:57,032 INFO ]: Abstraction has 27 states and 34 transitions. [2018-06-22 12:18:57,032 INFO ]: Interpolant automaton has 16 states. [2018-06-22 12:18:57,032 INFO ]: Start isEmpty. Operand 27 states and 34 transitions. [2018-06-22 12:18:57,032 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:18:57,032 INFO ]: Found error trace [2018-06-22 12:18:57,032 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:57,033 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:57,033 INFO ]: Analyzing trace with hash 211018440, now seen corresponding path program 1 times [2018-06-22 12:18:57,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:57,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:57,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:57,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:57,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:57,045 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:57,167 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 12:18:57,167 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:57,167 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:57,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:57,203 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:57,205 INFO ]: Computing forward predicates... [2018-06-22 12:18:57,313 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:18:57,334 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:18:57,334 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2018-06-22 12:18:57,334 INFO ]: Interpolant automaton has 14 states [2018-06-22 12:18:57,334 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 12:18:57,334 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-22 12:18:57,334 INFO ]: Start difference. First operand 27 states and 34 transitions. Second operand 14 states. [2018-06-22 12:18:57,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:57,623 INFO ]: Finished difference Result 33 states and 41 transitions. [2018-06-22 12:18:57,623 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 12:18:57,623 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 12:18:57,624 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:57,624 INFO ]: With dead ends: 33 [2018-06-22 12:18:57,624 INFO ]: Without dead ends: 33 [2018-06-22 12:18:57,625 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-06-22 12:18:57,625 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 12:18:57,630 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-22 12:18:57,630 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 12:18:57,631 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-06-22 12:18:57,631 INFO ]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 21 [2018-06-22 12:18:57,631 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:57,631 INFO ]: Abstraction has 31 states and 39 transitions. [2018-06-22 12:18:57,631 INFO ]: Interpolant automaton has 14 states. [2018-06-22 12:18:57,631 INFO ]: Start isEmpty. Operand 31 states and 39 transitions. [2018-06-22 12:18:57,632 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 12:18:57,632 INFO ]: Found error trace [2018-06-22 12:18:57,632 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:57,632 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:57,633 INFO ]: Analyzing trace with hash 393160389, now seen corresponding path program 2 times [2018-06-22 12:18:57,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:57,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:57,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:57,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:57,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:57,652 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:57,901 INFO ]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:18:57,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:57,901 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:57,906 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:18:57,922 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:18:57,922 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:57,924 INFO ]: Computing forward predicates... [2018-06-22 12:18:58,101 INFO ]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:18:58,120 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:18:58,120 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-06-22 12:18:58,120 INFO ]: Interpolant automaton has 14 states [2018-06-22 12:18:58,120 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 12:18:58,121 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-22 12:18:58,121 INFO ]: Start difference. First operand 31 states and 39 transitions. Second operand 14 states. [2018-06-22 12:18:58,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:58,508 INFO ]: Finished difference Result 33 states and 40 transitions. [2018-06-22 12:18:58,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 12:18:58,509 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 12:18:58,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:58,509 INFO ]: With dead ends: 33 [2018-06-22 12:18:58,509 INFO ]: Without dead ends: 33 [2018-06-22 12:18:58,510 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-06-22 12:18:58,510 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 12:18:58,514 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-22 12:18:58,514 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 12:18:58,515 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-06-22 12:18:58,515 INFO ]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 25 [2018-06-22 12:18:58,515 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:58,515 INFO ]: Abstraction has 31 states and 38 transitions. [2018-06-22 12:18:58,515 INFO ]: Interpolant automaton has 14 states. [2018-06-22 12:18:58,515 INFO ]: Start isEmpty. Operand 31 states and 38 transitions. [2018-06-22 12:18:58,516 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 12:18:58,516 INFO ]: Found error trace [2018-06-22 12:18:58,516 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:58,516 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:58,516 INFO ]: Analyzing trace with hash -1529258200, now seen corresponding path program 3 times [2018-06-22 12:18:58,516 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:58,516 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:58,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:58,517 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:18:58,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:58,528 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:58,589 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:18:58,589 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:58,589 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:58,595 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 12:18:58,620 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 12:18:58,620 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:58,623 INFO ]: Computing forward predicates... [2018-06-22 12:18:58,699 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:18:58,720 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:18:58,720 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-22 12:18:58,720 INFO ]: Interpolant automaton has 13 states [2018-06-22 12:18:58,720 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 12:18:58,720 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 12:18:58,720 INFO ]: Start difference. First operand 31 states and 38 transitions. Second operand 13 states. [2018-06-22 12:18:58,897 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:58,897 INFO ]: Finished difference Result 29 states and 34 transitions. [2018-06-22 12:18:58,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 12:18:58,898 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 12:18:58,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:58,899 INFO ]: With dead ends: 29 [2018-06-22 12:18:58,899 INFO ]: Without dead ends: 25 [2018-06-22 12:18:58,899 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-06-22 12:18:58,899 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 12:18:58,905 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 12:18:58,905 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 12:18:58,906 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-06-22 12:18:58,906 INFO ]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 25 [2018-06-22 12:18:58,906 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:58,906 INFO ]: Abstraction has 25 states and 30 transitions. [2018-06-22 12:18:58,906 INFO ]: Interpolant automaton has 13 states. [2018-06-22 12:18:58,906 INFO ]: Start isEmpty. Operand 25 states and 30 transitions. [2018-06-22 12:18:58,907 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:18:58,907 INFO ]: Found error trace [2018-06-22 12:18:58,907 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:58,907 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:58,907 INFO ]: Analyzing trace with hash 1323200239, now seen corresponding path program 2 times [2018-06-22 12:18:58,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:58,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:58,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:58,908 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:18:58,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:58,943 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:59,045 INFO ]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 12:18:59,045 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:59,045 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 12:18:59,060 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:59,098 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:18:59,098 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:59,101 INFO ]: Computing forward predicates... [2018-06-22 12:18:59,220 INFO ]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 12:18:59,240 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:18:59,240 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-06-22 12:18:59,240 INFO ]: Interpolant automaton has 17 states [2018-06-22 12:18:59,241 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 12:18:59,241 INFO ]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-06-22 12:18:59,241 INFO ]: Start difference. First operand 25 states and 30 transitions. Second operand 17 states. [2018-06-22 12:18:59,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:59,620 INFO ]: Finished difference Result 39 states and 48 transitions. [2018-06-22 12:18:59,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 12:18:59,620 INFO ]: Start accepts. Automaton has 17 states. Word has length 29 [2018-06-22 12:18:59,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:59,621 INFO ]: With dead ends: 39 [2018-06-22 12:18:59,621 INFO ]: Without dead ends: 39 [2018-06-22 12:18:59,621 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-06-22 12:18:59,621 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 12:18:59,627 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-06-22 12:18:59,627 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 12:18:59,628 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-06-22 12:18:59,629 INFO ]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 29 [2018-06-22 12:18:59,629 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:59,629 INFO ]: Abstraction has 35 states and 43 transitions. [2018-06-22 12:18:59,629 INFO ]: Interpolant automaton has 17 states. [2018-06-22 12:18:59,629 INFO ]: Start isEmpty. Operand 35 states and 43 transitions. [2018-06-22 12:18:59,630 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:18:59,630 INFO ]: Found error trace [2018-06-22 12:18:59,630 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:59,630 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:59,630 INFO ]: Analyzing trace with hash 1972805130, now seen corresponding path program 4 times [2018-06-22 12:18:59,631 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:59,631 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:59,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:59,631 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:18:59,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:59,720 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:00,046 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-06-22 12:19:00,399 INFO ]: Checked inductivity of 20 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 12:19:00,399 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:00,399 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:19:00,407 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 12:19:00,430 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 12:19:00,430 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:00,435 INFO ]: Computing forward predicates... [2018-06-22 12:19:00,683 INFO ]: detected not equals via solver [2018-06-22 12:19:00,684 INFO ]: detected not equals via solver [2018-06-22 12:19:00,699 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 68 [2018-06-22 12:19:00,701 INFO ]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2018-06-22 12:19:00,741 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-22 12:19:00,741 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:49 [2018-06-22 12:19:00,823 INFO ]: detected not equals via solver [2018-06-22 12:19:00,869 INFO ]: detected not equals via solver [2018-06-22 12:19:00,895 INFO ]: Index analysis took 111 ms [2018-06-22 12:19:00,896 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2018-06-22 12:19:00,897 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:01,225 INFO ]: detected not equals via solver [2018-06-22 12:19:01,238 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 85 [2018-06-22 12:19:01,239 INFO ]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-06-22 12:19:01,327 INFO ]: detected not equals via solver [2018-06-22 12:19:01,370 INFO ]: detected not equals via solver [2018-06-22 12:19:01,371 INFO ]: detected not equals via solver [2018-06-22 12:19:01,372 INFO ]: detected not equals via solver [2018-06-22 12:19:01,372 INFO ]: detected not equals via solver [2018-06-22 12:19:01,375 INFO ]: detected not equals via solver [2018-06-22 12:19:01,375 INFO ]: detected not equals via solver [2018-06-22 12:19:01,379 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 107 [2018-06-22 12:19:01,380 INFO ]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:01,382 INFO ]: detected not equals via solver [2018-06-22 12:19:01,383 INFO ]: detected not equals via solver [2018-06-22 12:19:01,383 INFO ]: detected not equals via solver [2018-06-22 12:19:01,384 INFO ]: detected not equals via solver [2018-06-22 12:19:01,384 INFO ]: detected equality via solver [2018-06-22 12:19:01,388 INFO ]: detected not equals via solver [2018-06-22 12:19:01,388 INFO ]: detected not equals via solver [2018-06-22 12:19:01,391 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 113 [2018-06-22 12:19:01,392 INFO ]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:01,452 INFO ]: detected not equals via solver [2018-06-22 12:19:01,453 INFO ]: detected not equals via solver [2018-06-22 12:19:01,455 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-06-22 12:19:01,455 INFO ]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:01,515 INFO ]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-06-22 12:19:01,515 INFO ]: Needed 6 recursive calls to eliminate 5 variables, input treesize:101, output treesize:98 [2018-06-22 12:19:01,845 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:01,845 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:01,909 INFO ]: detected not equals via solver [2018-06-22 12:19:01,909 INFO ]: detected not equals via solver [2018-06-22 12:19:01,910 INFO ]: detected not equals via solver [2018-06-22 12:19:01,912 INFO ]: detected not equals via solver [2018-06-22 12:19:01,912 INFO ]: detected not equals via solver [2018-06-22 12:19:01,913 INFO ]: detected not equals via solver [2018-06-22 12:19:01,917 INFO ]: detected not equals via solver [2018-06-22 12:19:01,922 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 113 [2018-06-22 12:19:01,923 INFO ]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-06-22 12:19:02,014 INFO ]: detected not equals via solver [2018-06-22 12:19:02,033 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-06-22 12:19:02,042 INFO ]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:02,044 INFO ]: detected not equals via solver [2018-06-22 12:19:02,045 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2018-06-22 12:19:02,046 INFO ]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-06-22 12:19:02,079 INFO ]: detected not equals via solver [2018-06-22 12:19:02,080 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-06-22 12:19:02,080 INFO ]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:02,123 INFO ]: detected not equals via solver [2018-06-22 12:19:02,124 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-06-22 12:19:02,125 INFO ]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:02,150 INFO ]: Start of recursive call 1: 4 dim-0 vars, 6 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-06-22 12:19:02,150 INFO ]: Needed 7 recursive calls to eliminate 10 variables, input treesize:185, output treesize:39 [2018-06-22 12:19:02,256 INFO ]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 12:19:02,275 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:02,275 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2018-06-22 12:19:02,275 INFO ]: Interpolant automaton has 26 states [2018-06-22 12:19:02,276 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 12:19:02,276 INFO ]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-06-22 12:19:02,276 INFO ]: Start difference. First operand 35 states and 43 transitions. Second operand 26 states. [2018-06-22 12:19:02,794 WARN ]: Spent 116.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2018-06-22 12:19:03,269 WARN ]: Spent 134.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2018-06-22 12:19:03,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:03,540 INFO ]: Finished difference Result 38 states and 46 transitions. [2018-06-22 12:19:03,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 12:19:03,540 INFO ]: Start accepts. Automaton has 26 states. Word has length 29 [2018-06-22 12:19:03,541 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:03,541 INFO ]: With dead ends: 38 [2018-06-22 12:19:03,541 INFO ]: Without dead ends: 0 [2018-06-22 12:19:03,541 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 12:19:03,541 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 12:19:03,541 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 12:19:03,541 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 12:19:03,541 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 12:19:03,541 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-06-22 12:19:03,541 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:03,541 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 12:19:03,541 INFO ]: Interpolant automaton has 26 states. [2018-06-22 12:19:03,541 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 12:19:03,541 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 12:19:03,545 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:19:03 BoogieIcfgContainer [2018-06-22 12:19:03,545 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 12:19:03,546 INFO ]: Toolchain (without parser) took 11657.31 ms. Allocated memory was 305.1 MB in the beginning and 410.5 MB in the end (delta: 105.4 MB). Free memory was 261.5 MB in the beginning and 324.1 MB in the end (delta: -62.6 MB). Peak memory consumption was 42.8 MB. Max. memory is 3.6 GB. [2018-06-22 12:19:03,546 INFO ]: SmtParser took 0.07 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-22 12:19:03,547 INFO ]: ChcToBoogie took 54.76 ms. Allocated memory is still 305.1 MB. Free memory was 260.5 MB in the beginning and 258.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 12:19:03,547 INFO ]: Boogie Preprocessor took 41.12 ms. Allocated memory is still 305.1 MB. Free memory was 258.5 MB in the beginning and 257.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 12:19:03,547 INFO ]: RCFGBuilder took 396.79 ms. Allocated memory is still 305.1 MB. Free memory was 257.5 MB in the beginning and 248.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 12:19:03,548 INFO ]: TraceAbstraction took 11155.03 ms. Allocated memory was 305.1 MB in the beginning and 410.5 MB in the end (delta: 105.4 MB). Free memory was 248.5 MB in the beginning and 324.1 MB in the end (delta: -75.6 MB). Peak memory consumption was 29.8 MB. Max. memory is 3.6 GB. [2018-06-22 12:19:03,553 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 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 54.76 ms. Allocated memory is still 305.1 MB. Free memory was 260.5 MB in the beginning and 258.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.12 ms. Allocated memory is still 305.1 MB. Free memory was 258.5 MB in the beginning and 257.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 396.79 ms. Allocated memory is still 305.1 MB. Free memory was 257.5 MB in the beginning and 248.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 11155.03 ms. Allocated memory was 305.1 MB in the beginning and 410.5 MB in the end (delta: 105.4 MB). Free memory was 248.5 MB in the beginning and 324.1 MB in the end (delta: -75.6 MB). Peak memory consumption was 29.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 11.0s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 234 SDtfs, 78 SDslu, 1349 SDs, 0 SdLazy, 1048 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 147 SyntacticMatches, 4 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred 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: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 368 ConstructedInterpolants, 12 QuantifiedInterpolants, 83536 SizeOfPredicates, 64 NumberOfNonLiveVariables, 852 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 95/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/arrayOffByOne.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_12-19-03-561.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/arrayOffByOne.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_12-19-03-561.csv Received shutdown request...