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/shiftByOne.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 12:19:06,319 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 12:19:06,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 12:19:06,336 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 12:19:06,336 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 12:19:06,337 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 12:19:06,338 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 12:19:06,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 12:19:06,346 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 12:19:06,347 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 12:19:06,347 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 12:19:06,349 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 12:19:06,350 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 12:19:06,351 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 12:19:06,352 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 12:19:06,353 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 12:19:06,357 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 12:19:06,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 12:19:06,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 12:19:06,372 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 12:19:06,373 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 12:19:06,375 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 12:19:06,375 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 12:19:06,375 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 12:19:06,376 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 12:19:06,377 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 12:19:06,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 12:19:06,383 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 12:19:06,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 12:19:06,385 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 12:19:06,385 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 12:19:06,386 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 12:19:06,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 12:19:06,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 12:19:06,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 12:19:06,392 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:19:06,411 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 12:19:06,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 12:19:06,411 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 12:19:06,419 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 12:19:06,420 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 12:19:06,420 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 12:19:06,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 12:19:06,421 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 12:19:06,421 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 12:19:06,421 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 12:19:06,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 12:19:06,421 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 12:19:06,422 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 12:19:06,422 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 12:19:06,422 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 12:19:06,422 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 12:19:06,422 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 12:19:06,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 12:19:06,423 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 12:19:06,424 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 12:19:06,424 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 12:19:06,476 INFO ]: Repository-Root is: /tmp [2018-06-22 12:19:06,491 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 12:19:06,494 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 12:19:06,495 INFO ]: Initializing SmtParser... [2018-06-22 12:19:06,495 INFO ]: SmtParser initialized [2018-06-22 12:19:06,496 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/unsolved/shiftByOne.smt2 [2018-06-22 12:19:06,497 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:19:06,569 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/unsolved/shiftByOne.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@2fab15a [2018-06-22 12:19:06,751 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/unsolved/shiftByOne.smt2 [2018-06-22 12:19:06,756 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 12:19:06,762 INFO ]: Walking toolchain with 4 elements. [2018-06-22 12:19:06,763 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 12:19:06,763 INFO ]: Initializing ChcToBoogie... [2018-06-22 12:19:06,763 INFO ]: ChcToBoogie initialized [2018-06-22 12:19:06,767 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:19:06" (1/1) ... [2018-06-22 12:19:06,814 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:19:06 Unit [2018-06-22 12:19:06,814 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 12:19:06,815 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 12:19:06,815 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 12:19:06,815 INFO ]: Boogie Preprocessor initialized [2018-06-22 12:19:06,838 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:19:06" (1/1) ... [2018-06-22 12:19:06,838 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:19:06" (1/1) ... [2018-06-22 12:19:06,849 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:19:06" (1/1) ... [2018-06-22 12:19:06,849 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:19:06" (1/1) ... [2018-06-22 12:19:06,852 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:19:06" (1/1) ... [2018-06-22 12:19:06,854 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:19:06" (1/1) ... [2018-06-22 12:19:06,855 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:19:06" (1/1) ... [2018-06-22 12:19:06,857 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 12:19:06,858 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 12:19:06,858 INFO ]: Initializing RCFGBuilder... [2018-06-22 12:19:06,858 INFO ]: RCFGBuilder initialized [2018-06-22 12:19:06,859 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:19:06" (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:19:06,875 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 12:19:06,875 INFO ]: Found specification of procedure False [2018-06-22 12:19:06,875 INFO ]: Found implementation of procedure False [2018-06-22 12:19:06,875 INFO ]: Specification and implementation of procedure INV_MAIN_2 given in one single declaration [2018-06-22 12:19:06,875 INFO ]: Found specification of procedure INV_MAIN_2 [2018-06-22 12:19:06,875 INFO ]: Found implementation of procedure INV_MAIN_2 [2018-06-22 12:19:06,875 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-22 12:19:06,875 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-22 12:19:06,875 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-22 12:19:06,875 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 12:19:06,875 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 12:19:06,875 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:19:07,199 INFO ]: Using library mode [2018-06-22 12:19:07,199 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:19:07 BoogieIcfgContainer [2018-06-22 12:19:07,199 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 12:19:07,209 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 12:19:07,209 INFO ]: Initializing TraceAbstraction... [2018-06-22 12:19:07,216 INFO ]: TraceAbstraction initialized [2018-06-22 12:19:07,216 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:19:06" (1/3) ... [2018-06-22 12:19:07,217 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f2e3f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:19:07, skipping insertion in model container [2018-06-22 12:19:07,218 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:19:06" (2/3) ... [2018-06-22 12:19:07,218 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f2e3f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:19:07, skipping insertion in model container [2018-06-22 12:19:07,218 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:19:07" (3/3) ... [2018-06-22 12:19:07,220 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 12:19:07,229 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 12:19:07,239 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 12:19:07,278 INFO ]: Using default assertion order modulation [2018-06-22 12:19:07,279 INFO ]: Interprodecural is true [2018-06-22 12:19:07,279 INFO ]: Hoare is false [2018-06-22 12:19:07,279 INFO ]: Compute interpolants for FPandBP [2018-06-22 12:19:07,279 INFO ]: Backedges is TWOTRACK [2018-06-22 12:19:07,279 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 12:19:07,279 INFO ]: Difference is false [2018-06-22 12:19:07,279 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 12:19:07,279 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 12:19:07,291 INFO ]: Start isEmpty. Operand 20 states. [2018-06-22 12:19:07,300 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 12:19:07,300 INFO ]: Found error trace [2018-06-22 12:19:07,301 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:07,301 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:07,304 INFO ]: Analyzing trace with hash 379858836, now seen corresponding path program 1 times [2018-06-22 12:19:07,306 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:07,306 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:07,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:07,338 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:19:07,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:07,376 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:07,477 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:19:07,478 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:19:07,479 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:19:07,480 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:19:07,492 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:19:07,493 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:19:07,495 INFO ]: Start difference. First operand 20 states. Second operand 4 states. [2018-06-22 12:19:07,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:07,620 INFO ]: Finished difference Result 22 states and 30 transitions. [2018-06-22 12:19:07,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:19:07,621 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 12:19:07,622 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:07,630 INFO ]: With dead ends: 22 [2018-06-22 12:19:07,631 INFO ]: Without dead ends: 22 [2018-06-22 12:19:07,632 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:19:07,645 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 12:19:07,666 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-22 12:19:07,667 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 12:19:07,668 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-06-22 12:19:07,669 INFO ]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 9 [2018-06-22 12:19:07,669 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:07,669 INFO ]: Abstraction has 20 states and 28 transitions. [2018-06-22 12:19:07,669 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:19:07,669 INFO ]: Start isEmpty. Operand 20 states and 28 transitions. [2018-06-22 12:19:07,671 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:19:07,671 INFO ]: Found error trace [2018-06-22 12:19:07,671 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:07,671 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:07,671 INFO ]: Analyzing trace with hash 818914657, now seen corresponding path program 1 times [2018-06-22 12:19:07,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:07,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:07,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:07,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:19:07,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:07,680 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:07,856 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:19:07,856 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:19:07,857 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:19:07,858 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:19:07,858 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:19:07,858 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:19:07,858 INFO ]: Start difference. First operand 20 states and 28 transitions. Second operand 4 states. [2018-06-22 12:19:08,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:08,010 INFO ]: Finished difference Result 24 states and 33 transitions. [2018-06-22 12:19:08,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:19:08,010 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 12:19:08,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:08,011 INFO ]: With dead ends: 24 [2018-06-22 12:19:08,011 INFO ]: Without dead ends: 24 [2018-06-22 12:19:08,012 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:19:08,012 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 12:19:08,018 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-22 12:19:08,018 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 12:19:08,019 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-06-22 12:19:08,019 INFO ]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-06-22 12:19:08,019 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:08,019 INFO ]: Abstraction has 22 states and 31 transitions. [2018-06-22 12:19:08,019 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:19:08,020 INFO ]: Start isEmpty. Operand 22 states and 31 transitions. [2018-06-22 12:19:08,021 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:19:08,021 INFO ]: Found error trace [2018-06-22 12:19:08,021 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:08,021 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:08,021 INFO ]: Analyzing trace with hash -2129514884, now seen corresponding path program 1 times [2018-06-22 12:19:08,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:08,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:08,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:08,022 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:19:08,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:08,029 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:08,096 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:19:08,096 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:19:08,096 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:19:08,096 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:19:08,097 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:19:08,097 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:19:08,097 INFO ]: Start difference. First operand 22 states and 31 transitions. Second operand 4 states. [2018-06-22 12:19:08,230 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:08,230 INFO ]: Finished difference Result 22 states and 30 transitions. [2018-06-22 12:19:08,231 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:19:08,231 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 12:19:08,232 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:08,232 INFO ]: With dead ends: 22 [2018-06-22 12:19:08,232 INFO ]: Without dead ends: 22 [2018-06-22 12:19:08,233 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:19:08,233 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 12:19:08,237 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 12:19:08,237 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 12:19:08,238 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-06-22 12:19:08,238 INFO ]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 13 [2018-06-22 12:19:08,239 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:08,239 INFO ]: Abstraction has 22 states and 30 transitions. [2018-06-22 12:19:08,239 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:19:08,239 INFO ]: Start isEmpty. Operand 22 states and 30 transitions. [2018-06-22 12:19:08,239 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:19:08,239 INFO ]: Found error trace [2018-06-22 12:19:08,240 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:08,240 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:08,240 INFO ]: Analyzing trace with hash -1327742600, now seen corresponding path program 1 times [2018-06-22 12:19:08,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:08,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:08,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:08,242 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:19:08,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:08,266 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:08,418 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:19:08,418 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:19:08,418 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:19:08,418 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:19:08,418 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:19:08,418 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:19:08,419 INFO ]: Start difference. First operand 22 states and 30 transitions. Second operand 5 states. [2018-06-22 12:19:08,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:08,482 INFO ]: Finished difference Result 22 states and 29 transitions. [2018-06-22 12:19:08,483 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 12:19:08,483 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 12:19:08,483 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:08,484 INFO ]: With dead ends: 22 [2018-06-22 12:19:08,484 INFO ]: Without dead ends: 21 [2018-06-22 12:19:08,484 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:19:08,484 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 12:19:08,488 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 12:19:08,488 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 12:19:08,488 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-22 12:19:08,488 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 13 [2018-06-22 12:19:08,489 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:08,489 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-22 12:19:08,489 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:19:08,489 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-22 12:19:08,489 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:19:08,489 INFO ]: Found error trace [2018-06-22 12:19:08,490 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:08,490 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:08,490 INFO ]: Analyzing trace with hash -230840736, now seen corresponding path program 1 times [2018-06-22 12:19:08,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:08,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:08,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:08,491 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:19:08,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:08,502 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:08,699 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:19:08,699 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:08,699 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:19:08,705 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:19:08,733 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:08,742 INFO ]: Computing forward predicates... [2018-06-22 12:19:08,817 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:19:08,853 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 12:19:08,853 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-06-22 12:19:08,853 INFO ]: Interpolant automaton has 10 states [2018-06-22 12:19:08,853 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 12:19:08,853 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:19:08,853 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 10 states. [2018-06-22 12:19:09,141 WARN ]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 12:19:09,619 WARN ]: Spent 109.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-06-22 12:19:09,711 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:09,711 INFO ]: Finished difference Result 27 states and 33 transitions. [2018-06-22 12:19:09,711 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 12:19:09,711 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 12:19:09,711 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:09,712 INFO ]: With dead ends: 27 [2018-06-22 12:19:09,712 INFO ]: Without dead ends: 27 [2018-06-22 12:19:09,713 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-22 12:19:09,713 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 12:19:09,716 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-22 12:19:09,716 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 12:19:09,717 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-06-22 12:19:09,717 INFO ]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2018-06-22 12:19:09,717 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:09,717 INFO ]: Abstraction has 21 states and 26 transitions. [2018-06-22 12:19:09,717 INFO ]: Interpolant automaton has 10 states. [2018-06-22 12:19:09,717 INFO ]: Start isEmpty. Operand 21 states and 26 transitions. [2018-06-22 12:19:09,718 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:19:09,718 INFO ]: Found error trace [2018-06-22 12:19:09,718 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:19:09,718 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:09,718 INFO ]: Analyzing trace with hash 707890023, now seen corresponding path program 1 times [2018-06-22 12:19:09,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:09,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:09,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:09,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:19:09,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:09,731 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:09,789 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:19:09,789 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:09,789 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:19:09,801 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:19:09,817 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:09,820 INFO ]: Computing forward predicates... [2018-06-22 12:19:09,910 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:19:09,931 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:09,931 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 12:19:09,931 INFO ]: Interpolant automaton has 10 states [2018-06-22 12:19:09,931 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 12:19:09,931 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:19:09,932 INFO ]: Start difference. First operand 21 states and 26 transitions. Second operand 10 states. [2018-06-22 12:19:10,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:10,135 INFO ]: Finished difference Result 25 states and 30 transitions. [2018-06-22 12:19:10,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 12:19:10,136 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-22 12:19:10,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:10,137 INFO ]: With dead ends: 25 [2018-06-22 12:19:10,137 INFO ]: Without dead ends: 23 [2018-06-22 12:19:10,137 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-22 12:19:10,137 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 12:19:10,140 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 12:19:10,141 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 12:19:10,141 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-06-22 12:19:10,141 INFO ]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 21 [2018-06-22 12:19:10,141 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:10,141 INFO ]: Abstraction has 23 states and 28 transitions. [2018-06-22 12:19:10,141 INFO ]: Interpolant automaton has 10 states. [2018-06-22 12:19:10,141 INFO ]: Start isEmpty. Operand 23 states and 28 transitions. [2018-06-22 12:19:10,142 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 12:19:10,142 INFO ]: Found error trace [2018-06-22 12:19:10,142 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:19:10,142 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:10,143 INFO ]: Analyzing trace with hash 2122664395, now seen corresponding path program 2 times [2018-06-22 12:19:10,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:10,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:10,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:10,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:19:10,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:10,190 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:10,688 INFO ]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:19:10,688 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:10,688 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:19:10,703 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:19:10,743 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:19:10,743 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:10,747 INFO ]: Computing forward predicates... [2018-06-22 12:19:10,933 WARN ]: unable to prove that (exists ((INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (and (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (let ((.cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int))) (let ((.cse0 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int (- 1)) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int .cse1)))) (store .cse0 .cse1 (select .cse0 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))))) (< INV_MAIN_1_hbv_INV_MAIN_1_1_Int c_INV_MAIN_1_hhv_INV_MAIN_1_1_Int) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))) is different from true [2018-06-22 12:19:11,042 INFO ]: detected not equals via solver [2018-06-22 12:19:11,047 INFO ]: detected not equals via solver [2018-06-22 12:19:11,047 INFO ]: detected not equals via solver [2018-06-22 12:19:11,049 INFO ]: detected not equals via solver [2018-06-22 12:19:11,067 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 81 [2018-06-22 12:19:11,245 WARN ]: Spent 175.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-06-22 12:19:11,251 INFO ]: detected not equals via solver [2018-06-22 12:19:11,252 INFO ]: detected not equals via solver [2018-06-22 12:19:11,252 INFO ]: detected not equals via solver [2018-06-22 12:19:11,254 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-06-22 12:19:11,255 INFO ]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:11,272 INFO ]: detected not equals via solver [2018-06-22 12:19:11,274 INFO ]: detected not equals via solver [2018-06-22 12:19:11,274 INFO ]: detected not equals via solver [2018-06-22 12:19:11,291 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 61 [2018-06-22 12:19:11,300 INFO ]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-06-22 12:19:11,331 INFO ]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-22 12:19:11,351 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-22 12:19:11,352 INFO ]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:25 [2018-06-22 12:19:11,458 INFO ]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2018-06-22 12:19:11,477 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:11,477 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 12:19:11,478 INFO ]: Interpolant automaton has 22 states [2018-06-22 12:19:11,478 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 12:19:11,478 INFO ]: CoverageRelationStatistics Valid=52, Invalid=369, Unknown=3, NotChecked=38, Total=462 [2018-06-22 12:19:11,478 INFO ]: Start difference. First operand 23 states and 28 transitions. Second operand 22 states. [2018-06-22 12:19:11,934 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-06-22 12:19:12,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:12,239 INFO ]: Finished difference Result 31 states and 38 transitions. [2018-06-22 12:19:12,267 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 12:19:12,267 INFO ]: Start accepts. Automaton has 22 states. Word has length 25 [2018-06-22 12:19:12,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:12,268 INFO ]: With dead ends: 31 [2018-06-22 12:19:12,268 INFO ]: Without dead ends: 31 [2018-06-22 12:19:12,268 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=110, Invalid=643, Unknown=7, NotChecked=52, Total=812 [2018-06-22 12:19:12,269 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 12:19:12,272 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-22 12:19:12,273 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 12:19:12,273 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-06-22 12:19:12,273 INFO ]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 25 [2018-06-22 12:19:12,273 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:12,273 INFO ]: Abstraction has 25 states and 31 transitions. [2018-06-22 12:19:12,273 INFO ]: Interpolant automaton has 22 states. [2018-06-22 12:19:12,274 INFO ]: Start isEmpty. Operand 25 states and 31 transitions. [2018-06-22 12:19:12,275 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 12:19:12,275 INFO ]: Found error trace [2018-06-22 12:19:12,275 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:19:12,275 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:12,275 INFO ]: Analyzing trace with hash -17748122, now seen corresponding path program 1 times [2018-06-22 12:19:12,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:12,275 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:12,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:12,276 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:19:12,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:12,288 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:12,386 INFO ]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 12:19:12,386 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:12,386 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:19:12,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:19:12,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:12,409 INFO ]: Computing forward predicates... [2018-06-22 12:19:12,594 INFO ]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 12:19:12,613 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:12,614 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2018-06-22 12:19:12,614 INFO ]: Interpolant automaton has 15 states [2018-06-22 12:19:12,614 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 12:19:12,614 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-22 12:19:12,614 INFO ]: Start difference. First operand 25 states and 31 transitions. Second operand 15 states. [2018-06-22 12:19:12,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:12,965 INFO ]: Finished difference Result 35 states and 42 transitions. [2018-06-22 12:19:12,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 12:19:12,966 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 12:19:12,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:12,967 INFO ]: With dead ends: 35 [2018-06-22 12:19:12,967 INFO ]: Without dead ends: 35 [2018-06-22 12:19:12,968 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-06-22 12:19:12,968 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 12:19:12,973 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 12:19:12,973 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 12:19:12,975 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-06-22 12:19:12,975 INFO ]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 25 [2018-06-22 12:19:12,975 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:12,975 INFO ]: Abstraction has 33 states and 40 transitions. [2018-06-22 12:19:12,975 INFO ]: Interpolant automaton has 15 states. [2018-06-22 12:19:12,975 INFO ]: Start isEmpty. Operand 33 states and 40 transitions. [2018-06-22 12:19:12,976 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:19:12,976 INFO ]: Found error trace [2018-06-22 12:19:12,976 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:19:12,976 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:12,977 INFO ]: Analyzing trace with hash 1867978733, now seen corresponding path program 3 times [2018-06-22 12:19:12,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:12,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:12,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:12,977 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:19:12,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:13,010 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:13,114 INFO ]: Checked inductivity of 20 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 12:19:13,114 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:13,114 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:19:13,120 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 12:19:13,140 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 12:19:13,140 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:13,142 INFO ]: Computing forward predicates... [2018-06-22 12:19:13,243 INFO ]: Checked inductivity of 20 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 12:19:13,270 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:13,270 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-22 12:19:13,271 INFO ]: Interpolant automaton has 14 states [2018-06-22 12:19:13,271 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 12:19:13,271 INFO ]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-06-22 12:19:13,271 INFO ]: Start difference. First operand 33 states and 40 transitions. Second operand 14 states. [2018-06-22 12:19:13,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:13,507 INFO ]: Finished difference Result 31 states and 36 transitions. [2018-06-22 12:19:13,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 12:19:13,508 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-22 12:19:13,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:13,509 INFO ]: With dead ends: 31 [2018-06-22 12:19:13,509 INFO ]: Without dead ends: 27 [2018-06-22 12:19:13,510 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-06-22 12:19:13,510 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 12:19:13,513 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 12:19:13,513 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 12:19:13,514 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-06-22 12:19:13,514 INFO ]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 29 [2018-06-22 12:19:13,514 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:13,514 INFO ]: Abstraction has 27 states and 32 transitions. [2018-06-22 12:19:13,514 INFO ]: Interpolant automaton has 14 states. [2018-06-22 12:19:13,514 INFO ]: Start isEmpty. Operand 27 states and 32 transitions. [2018-06-22 12:19:13,515 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 12:19:13,515 INFO ]: Found error trace [2018-06-22 12:19:13,515 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:13,516 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:13,520 INFO ]: Analyzing trace with hash -47700399, now seen corresponding path program 4 times [2018-06-22 12:19:13,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:13,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:13,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:13,520 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:19:13,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:13,588 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:14,190 INFO ]: Checked inductivity of 31 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 12:19:14,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:14,190 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 12:19:14,204 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:19:14,231 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 12:19:14,231 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:14,236 INFO ]: Computing forward predicates... [2018-06-22 12:19:14,454 WARN ]: unable to prove that (exists ((INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse0 (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1))) (and (<= .cse0 c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int) (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (let ((.cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int))) (let ((.cse1 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int (- 1)) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int .cse2)))) (store .cse1 .cse2 (select .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))))) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int .cse0)))) is different from true [2018-06-22 12:19:14,463 WARN ]: unable to prove that (exists ((v_subst_1 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse0 (+ v_subst_1 1))) (and (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int .cse0) (< INV_MAIN_1_hbv_INV_MAIN_1_1_Int c_INV_MAIN_1_hhv_INV_MAIN_1_1_Int) (= (let ((.cse1 (let ((.cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_1))) (let ((.cse2 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_1 (- 1)) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int .cse3)))) (store .cse2 .cse3 (select .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_1 1))))))) (store .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))) c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)) (<= .cse0 INV_MAIN_1_hbv_INV_MAIN_1_1_Int)))) is different from true [2018-06-22 12:19:14,696 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-22 12:19:14,945 WARN ]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-22 12:19:14,949 INFO ]: detected not equals via solver [2018-06-22 12:19:14,949 INFO ]: detected not equals via solver [2018-06-22 12:19:14,951 INFO ]: detected not equals via solver [2018-06-22 12:19:14,952 INFO ]: detected not equals via solver [2018-06-22 12:19:14,954 INFO ]: detected not equals via solver [2018-06-22 12:19:15,003 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 125 treesize of output 166 [2018-06-22 12:19:15,203 WARN ]: Spent 195.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84 [2018-06-22 12:19:15,220 INFO ]: detected not equals via solver [2018-06-22 12:19:15,220 INFO ]: detected not equals via solver [2018-06-22 12:19:15,221 INFO ]: detected not equals via solver [2018-06-22 12:19:15,222 INFO ]: detected not equals via solver [2018-06-22 12:19:15,222 INFO ]: detected not equals via solver [2018-06-22 12:19:15,223 INFO ]: detected not equals via solver [2018-06-22 12:19:15,231 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 112 [2018-06-22 12:19:15,607 WARN ]: Spent 372.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-06-22 12:19:15,635 INFO ]: detected not equals via solver [2018-06-22 12:19:15,635 INFO ]: detected not equals via solver [2018-06-22 12:19:15,636 INFO ]: detected not equals via solver [2018-06-22 12:19:15,636 INFO ]: detected not equals via solver [2018-06-22 12:19:15,637 INFO ]: detected not equals via solver [2018-06-22 12:19:15,637 INFO ]: detected not equals via solver [2018-06-22 12:19:15,641 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-06-22 12:19:15,642 INFO ]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:15,646 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:15,646 INFO ]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:15,673 INFO ]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:15,765 INFO ]: detected not equals via solver [2018-06-22 12:19:15,766 INFO ]: detected not equals via solver [2018-06-22 12:19:15,766 INFO ]: detected not equals via solver [2018-06-22 12:19:15,767 INFO ]: detected not equals via solver [2018-06-22 12:19:15,768 INFO ]: detected not equals via solver [2018-06-22 12:19:15,769 INFO ]: detected not equals via solver [2018-06-22 12:19:15,770 INFO ]: detected not equals via solver [2018-06-22 12:19:15,770 INFO ]: detected not equals via solver [2018-06-22 12:19:15,773 INFO ]: detected not equals via solver [2018-06-22 12:19:15,774 INFO ]: detected not equals via solver [2018-06-22 12:19:15,840 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 203 [2018-06-22 12:19:16,328 WARN ]: Spent 471.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 139 [2018-06-22 12:19:16,332 INFO ]: detected not equals via solver [2018-06-22 12:19:16,332 INFO ]: detected not equals via solver [2018-06-22 12:19:16,333 INFO ]: detected not equals via solver [2018-06-22 12:19:16,333 INFO ]: detected not equals via solver [2018-06-22 12:19:16,334 INFO ]: detected equality via solver [2018-06-22 12:19:16,334 INFO ]: detected not equals via solver [2018-06-22 12:19:16,335 INFO ]: detected not equals via solver [2018-06-22 12:19:16,335 INFO ]: detected equality via solver [2018-06-22 12:19:16,335 INFO ]: detected equality via solver [2018-06-22 12:19:16,336 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 102 [2018-06-22 12:19:16,338 INFO ]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-06-22 12:19:16,475 INFO ]: detected not equals via solver [2018-06-22 12:19:16,476 INFO ]: detected not equals via solver [2018-06-22 12:19:16,477 INFO ]: detected not equals via solver [2018-06-22 12:19:16,478 INFO ]: detected not equals via solver [2018-06-22 12:19:16,479 INFO ]: detected not equals via solver [2018-06-22 12:19:16,480 INFO ]: detected not equals via solver [2018-06-22 12:19:16,482 INFO ]: detected not equals via solver [2018-06-22 12:19:16,484 INFO ]: detected not equals via solver [2018-06-22 12:19:16,485 INFO ]: detected not equals via solver [2018-06-22 12:19:16,506 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 126 [2018-06-22 12:19:16,518 INFO ]: Start of recursive call 8: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-06-22 12:19:16,756 INFO ]: detected not equals via solver [2018-06-22 12:19:16,756 INFO ]: detected not equals via solver [2018-06-22 12:19:16,757 INFO ]: detected not equals via solver [2018-06-22 12:19:16,757 INFO ]: detected not equals via solver [2018-06-22 12:19:16,757 INFO ]: detected equality via solver [2018-06-22 12:19:16,758 INFO ]: detected not equals via solver [2018-06-22 12:19:16,758 INFO ]: detected not equals via solver [2018-06-22 12:19:16,759 INFO ]: detected equality via solver [2018-06-22 12:19:16,759 INFO ]: detected equality via solver [2018-06-22 12:19:16,766 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 85 [2018-06-22 12:19:16,767 INFO ]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:16,946 INFO ]: detected not equals via solver [2018-06-22 12:19:16,946 INFO ]: detected not equals via solver [2018-06-22 12:19:16,947 INFO ]: detected not equals via solver [2018-06-22 12:19:16,948 INFO ]: detected not equals via solver [2018-06-22 12:19:16,949 INFO ]: detected not equals via solver [2018-06-22 12:19:16,950 INFO ]: detected not equals via solver [2018-06-22 12:19:16,951 INFO ]: detected not equals via solver [2018-06-22 12:19:16,953 INFO ]: detected not equals via solver [2018-06-22 12:19:16,954 INFO ]: detected not equals via solver [2018-06-22 12:19:16,954 INFO ]: detected not equals via solver [2018-06-22 12:19:16,955 INFO ]: detected not equals via solver [2018-06-22 12:19:16,979 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 157 [2018-06-22 12:19:16,995 INFO ]: Start of recursive call 10: 13 dim-0 vars, End of recursive call: 13 dim-0 vars, and 16 xjuncts. [2018-06-22 12:19:17,381 INFO ]: detected not equals via solver [2018-06-22 12:19:17,392 INFO ]: detected not equals via solver [2018-06-22 12:19:17,401 INFO ]: detected not equals via solver [2018-06-22 12:19:17,401 INFO ]: detected not equals via solver [2018-06-22 12:19:17,402 INFO ]: detected not equals via solver [2018-06-22 12:19:17,402 INFO ]: detected not equals via solver [2018-06-22 12:19:17,403 INFO ]: detected not equals via solver [2018-06-22 12:19:17,403 INFO ]: detected not equals via solver [2018-06-22 12:19:17,404 INFO ]: detected not equals via solver [2018-06-22 12:19:17,404 INFO ]: detected not equals via solver [2018-06-22 12:19:17,411 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 98 [2018-06-22 12:19:17,412 INFO ]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:17,520 INFO ]: detected not equals via solver [2018-06-22 12:19:17,520 INFO ]: detected not equals via solver [2018-06-22 12:19:17,521 INFO ]: detected not equals via solver [2018-06-22 12:19:17,522 INFO ]: detected not equals via solver [2018-06-22 12:19:17,523 INFO ]: detected not equals via solver [2018-06-22 12:19:17,524 INFO ]: detected not equals via solver [2018-06-22 12:19:17,525 INFO ]: detected not equals via solver [2018-06-22 12:19:17,527 INFO ]: detected not equals via solver [2018-06-22 12:19:17,528 INFO ]: detected not equals via solver [2018-06-22 12:19:17,556 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 148 [2018-06-22 12:19:17,602 INFO ]: Start of recursive call 12: 22 dim-0 vars, End of recursive call: 22 dim-0 vars, and 32 xjuncts. [2018-06-22 12:19:18,098 INFO ]: detected not equals via solver [2018-06-22 12:19:18,099 INFO ]: detected not equals via solver [2018-06-22 12:19:18,100 INFO ]: detected not equals via solver [2018-06-22 12:19:18,101 INFO ]: detected not equals via solver [2018-06-22 12:19:18,101 INFO ]: detected not equals via solver [2018-06-22 12:19:18,102 INFO ]: detected not equals via solver [2018-06-22 12:19:18,105 INFO ]: detected not equals via solver [2018-06-22 12:19:18,121 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 106 [2018-06-22 12:19:18,127 INFO ]: Start of recursive call 13: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-06-22 12:19:18,316 INFO ]: detected not equals via solver [2018-06-22 12:19:18,317 INFO ]: detected not equals via solver [2018-06-22 12:19:18,320 INFO ]: detected not equals via solver [2018-06-22 12:19:18,321 INFO ]: detected not equals via solver [2018-06-22 12:19:18,322 INFO ]: detected not equals via solver [2018-06-22 12:19:18,322 INFO ]: detected not equals via solver [2018-06-22 12:19:18,325 INFO ]: detected not equals via solver [2018-06-22 12:19:18,343 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 106 [2018-06-22 12:19:18,348 INFO ]: Start of recursive call 14: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-06-22 12:19:18,747 INFO ]: Start of recursive call 6: 8 dim-1 vars, End of recursive call: 20 dim-0 vars, and 22 xjuncts. [2018-06-22 12:19:18,907 INFO ]: detected not equals via solver [2018-06-22 12:19:18,907 INFO ]: detected not equals via solver [2018-06-22 12:19:18,908 INFO ]: detected not equals via solver [2018-06-22 12:19:18,908 INFO ]: detected not equals via solver [2018-06-22 12:19:18,909 INFO ]: detected not equals via solver [2018-06-22 12:19:18,909 INFO ]: detected not equals via solver [2018-06-22 12:19:18,916 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 112 [2018-06-22 12:19:18,948 INFO ]: detected not equals via solver [2018-06-22 12:19:18,948 INFO ]: detected not equals via solver [2018-06-22 12:19:18,949 INFO ]: detected not equals via solver [2018-06-22 12:19:18,949 INFO ]: detected not equals via solver [2018-06-22 12:19:18,950 INFO ]: detected not equals via solver [2018-06-22 12:19:18,950 INFO ]: detected not equals via solver [2018-06-22 12:19:18,954 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 54 [2018-06-22 12:19:18,955 INFO ]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:18,965 INFO ]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:19,113 INFO ]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-22 12:19:19,124 INFO ]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-22 12:19:19,124 INFO ]: Needed 16 recursive calls to eliminate 4 variables, input treesize:191, output treesize:25 [2018-06-22 12:19:19,201 INFO ]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2018-06-22 12:19:19,220 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:19,220 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-06-22 12:19:19,220 INFO ]: Interpolant automaton has 29 states [2018-06-22 12:19:19,220 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 12:19:19,220 INFO ]: CoverageRelationStatistics Valid=81, Invalid=626, Unknown=3, NotChecked=102, Total=812 [2018-06-22 12:19:19,221 INFO ]: Start difference. First operand 27 states and 32 transitions. Second operand 29 states. [2018-06-22 12:19:20,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:20,333 INFO ]: Finished difference Result 39 states and 47 transitions. [2018-06-22 12:19:20,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 12:19:20,333 INFO ]: Start accepts. Automaton has 29 states. Word has length 33 [2018-06-22 12:19:20,334 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:20,335 INFO ]: With dead ends: 39 [2018-06-22 12:19:20,335 INFO ]: Without dead ends: 39 [2018-06-22 12:19:20,336 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=194, Invalid=1287, Unknown=9, NotChecked=150, Total=1640 [2018-06-22 12:19:20,336 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 12:19:20,341 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 29. [2018-06-22 12:19:20,341 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 12:19:20,342 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-06-22 12:19:20,342 INFO ]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 33 [2018-06-22 12:19:20,342 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:20,342 INFO ]: Abstraction has 29 states and 35 transitions. [2018-06-22 12:19:20,342 INFO ]: Interpolant automaton has 29 states. [2018-06-22 12:19:20,342 INFO ]: Start isEmpty. Operand 29 states and 35 transitions. [2018-06-22 12:19:20,343 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 12:19:20,343 INFO ]: Found error trace [2018-06-22 12:19:20,343 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:20,343 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:20,343 INFO ]: Analyzing trace with hash -806625556, now seen corresponding path program 2 times [2018-06-22 12:19:20,343 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:20,343 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:20,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:20,344 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:19:20,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:20,356 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:20,505 INFO ]: Checked inductivity of 31 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 12:19:20,506 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:20,506 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:20,515 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:19:20,536 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:19:20,536 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:20,539 INFO ]: Computing forward predicates... [2018-06-22 12:19:20,693 INFO ]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 12:19:20,712 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:20,713 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2018-06-22 12:19:20,713 INFO ]: Interpolant automaton has 18 states [2018-06-22 12:19:20,713 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 12:19:20,713 INFO ]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-06-22 12:19:20,713 INFO ]: Start difference. First operand 29 states and 35 transitions. Second operand 18 states. [2018-06-22 12:19:20,999 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:20,999 INFO ]: Finished difference Result 41 states and 48 transitions. [2018-06-22 12:19:21,000 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 12:19:21,000 INFO ]: Start accepts. Automaton has 18 states. Word has length 33 [2018-06-22 12:19:21,000 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:21,001 INFO ]: With dead ends: 41 [2018-06-22 12:19:21,001 INFO ]: Without dead ends: 41 [2018-06-22 12:19:21,001 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2018-06-22 12:19:21,001 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 12:19:21,006 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-06-22 12:19:21,006 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 12:19:21,007 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-06-22 12:19:21,007 INFO ]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 33 [2018-06-22 12:19:21,007 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:21,007 INFO ]: Abstraction has 39 states and 46 transitions. [2018-06-22 12:19:21,007 INFO ]: Interpolant automaton has 18 states. [2018-06-22 12:19:21,007 INFO ]: Start isEmpty. Operand 39 states and 46 transitions. [2018-06-22 12:19:21,008 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 12:19:21,008 INFO ]: Found error trace [2018-06-22 12:19:21,008 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:21,008 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:21,008 INFO ]: Analyzing trace with hash 1528244979, now seen corresponding path program 5 times [2018-06-22 12:19:21,008 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:21,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:21,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:21,009 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:19:21,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:21,018 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:21,222 INFO ]: Checked inductivity of 42 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 12:19:21,223 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:21,223 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:19:21,229 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 12:19:21,254 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 12:19:21,254 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:21,257 INFO ]: Computing forward predicates... [2018-06-22 12:19:21,367 INFO ]: Checked inductivity of 42 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 12:19:21,386 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:21,386 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-06-22 12:19:21,386 INFO ]: Interpolant automaton has 17 states [2018-06-22 12:19:21,387 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 12:19:21,387 INFO ]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-06-22 12:19:21,387 INFO ]: Start difference. First operand 39 states and 46 transitions. Second operand 17 states. [2018-06-22 12:19:21,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:21,554 INFO ]: Finished difference Result 37 states and 42 transitions. [2018-06-22 12:19:21,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 12:19:21,554 INFO ]: Start accepts. Automaton has 17 states. Word has length 37 [2018-06-22 12:19:21,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:21,555 INFO ]: With dead ends: 37 [2018-06-22 12:19:21,555 INFO ]: Without dead ends: 31 [2018-06-22 12:19:21,555 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-06-22 12:19:21,555 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 12:19:21,558 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-22 12:19:21,558 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 12:19:21,559 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-06-22 12:19:21,559 INFO ]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 37 [2018-06-22 12:19:21,559 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:21,559 INFO ]: Abstraction has 31 states and 36 transitions. [2018-06-22 12:19:21,559 INFO ]: Interpolant automaton has 17 states. [2018-06-22 12:19:21,559 INFO ]: Start isEmpty. Operand 31 states and 36 transitions. [2018-06-22 12:19:21,560 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 12:19:21,560 INFO ]: Found error trace [2018-06-22 12:19:21,560 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:21,560 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:21,560 INFO ]: Analyzing trace with hash 1323603186, now seen corresponding path program 3 times [2018-06-22 12:19:21,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:21,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:21,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:21,561 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:19:21,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:21,575 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:22,082 INFO ]: Checked inductivity of 57 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 12:19:22,082 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:22,082 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:19:22,087 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 12:19:22,109 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 12:19:22,109 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:22,112 INFO ]: Computing forward predicates... [2018-06-22 12:19:22,200 INFO ]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 12:19:22,231 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:22,231 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2018-06-22 12:19:22,232 INFO ]: Interpolant automaton has 21 states [2018-06-22 12:19:22,233 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 12:19:22,234 INFO ]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-06-22 12:19:22,234 INFO ]: Start difference. First operand 31 states and 36 transitions. Second operand 21 states. [2018-06-22 12:19:23,019 WARN ]: Spent 205.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-06-22 12:19:23,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:23,162 INFO ]: Finished difference Result 47 states and 56 transitions. [2018-06-22 12:19:23,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 12:19:23,162 INFO ]: Start accepts. Automaton has 21 states. Word has length 41 [2018-06-22 12:19:23,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:23,163 INFO ]: With dead ends: 47 [2018-06-22 12:19:23,163 INFO ]: Without dead ends: 47 [2018-06-22 12:19:23,164 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 12:19:23,164 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 12:19:23,171 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 12:19:23,171 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 12:19:23,175 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-06-22 12:19:23,176 INFO ]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 41 [2018-06-22 12:19:23,176 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:23,176 INFO ]: Abstraction has 43 states and 51 transitions. [2018-06-22 12:19:23,176 INFO ]: Interpolant automaton has 21 states. [2018-06-22 12:19:23,176 INFO ]: Start isEmpty. Operand 43 states and 51 transitions. [2018-06-22 12:19:23,177 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 12:19:23,177 INFO ]: Found error trace [2018-06-22 12:19:23,177 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:23,177 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:23,177 INFO ]: Analyzing trace with hash 155978071, now seen corresponding path program 6 times [2018-06-22 12:19:23,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:23,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:23,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:23,178 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:19:23,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:23,244 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:23,589 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 12:19:24,031 WARN ]: Spent 387.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2018-06-22 12:19:24,603 INFO ]: Checked inductivity of 57 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 12:19:24,603 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:24,603 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:19:24,609 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 12:19:24,635 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 12:19:24,635 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:24,640 INFO ]: Computing forward predicates... [2018-06-22 12:19:24,816 WARN ]: unable to prove that (exists ((INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (and (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (store c_INV_MAIN_1_hbv_INV_MAIN_1_2_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select c_INV_MAIN_1_hbv_INV_MAIN_1_2_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))) is different from true [2018-06-22 12:19:25,003 WARN ]: unable to prove that (exists ((v_subst_3 Int) (v_subst_2 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse0 (+ v_subst_3 1)) (.cse3 (+ v_subst_2 1))) (and (<= .cse0 INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (let ((.cse1 (let ((.cse2 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_2) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_2 1))))) (store .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_3) (select .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_3 1)))))) (store .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1))))) (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int .cse0) (<= 0 v_subst_2) (<= v_subst_2 0) (<= v_subst_3 .cse3) (<= .cse3 v_subst_3)))) is different from true [2018-06-22 12:19:25,024 WARN ]: unable to prove that (exists ((v_prenex_62 Int) (v_subst_3 Int) (v_subst_2 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse0 (+ v_subst_3 1)) (.cse1 (+ v_subst_2 1))) (and (<= .cse0 INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int .cse0) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int (+ v_prenex_62 1)) (<= 0 v_subst_2) (<= v_subst_2 0) (<= v_subst_3 .cse1) (<= .cse1 v_subst_3) (= (let ((.cse2 (let ((.cse3 (let ((.cse4 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_2) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_2 1))))) (store .cse4 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_3) (select .cse4 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_3 1)))))) (store .cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))))) (store .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_prenex_62) (select .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_prenex_62 1)))) c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int)))) is different from true [2018-06-22 12:19:25,434 INFO ]: detected not equals via solver [2018-06-22 12:19:25,434 INFO ]: detected not equals via solver [2018-06-22 12:19:25,434 INFO ]: detected equality via solver [2018-06-22 12:19:25,435 INFO ]: detected not equals via solver [2018-06-22 12:19:25,436 INFO ]: detected not equals via solver [2018-06-22 12:19:25,436 INFO ]: detected not equals via solver [2018-06-22 12:19:25,437 INFO ]: detected not equals via solver [2018-06-22 12:19:25,437 INFO ]: detected not equals via solver [2018-06-22 12:19:25,438 INFO ]: detected equality via solver [2018-06-22 12:19:25,438 INFO ]: detected not equals via solver [2018-06-22 12:19:25,448 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 365 treesize of output 346 [2018-06-22 12:19:25,505 INFO ]: detected not equals via solver [2018-06-22 12:19:25,505 INFO ]: detected not equals via solver [2018-06-22 12:19:25,506 INFO ]: detected not equals via solver [2018-06-22 12:19:25,506 INFO ]: detected not equals via solver [2018-06-22 12:19:25,507 INFO ]: detected equality via solver [2018-06-22 12:19:25,507 INFO ]: detected not equals via solver [2018-06-22 12:19:25,508 INFO ]: detected not equals via solver [2018-06-22 12:19:25,508 INFO ]: detected equality via solver [2018-06-22 12:19:25,508 INFO ]: detected not equals via solver [2018-06-22 12:19:25,519 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 229 [2018-06-22 12:19:25,586 INFO ]: detected not equals via solver [2018-06-22 12:19:25,586 INFO ]: detected not equals via solver [2018-06-22 12:19:25,587 INFO ]: detected not equals via solver [2018-06-22 12:19:25,587 INFO ]: detected not equals via solver [2018-06-22 12:19:25,588 INFO ]: detected not equals via solver [2018-06-22 12:19:25,588 INFO ]: detected not equals via solver [2018-06-22 12:19:25,589 INFO ]: detected not equals via solver [2018-06-22 12:19:25,590 INFO ]: detected not equals via solver [2018-06-22 12:19:25,590 INFO ]: detected equality via solver [2018-06-22 12:19:25,590 INFO ]: detected not equals via solver [2018-06-22 12:19:25,591 INFO ]: detected not equals via solver [2018-06-22 12:19:25,592 INFO ]: detected not equals via solver [2018-06-22 12:19:25,603 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 202 [2018-06-22 12:19:25,827 WARN ]: Spent 222.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2018-06-22 12:19:25,830 INFO ]: detected not equals via solver [2018-06-22 12:19:25,831 INFO ]: detected not equals via solver [2018-06-22 12:19:25,831 INFO ]: detected not equals via solver [2018-06-22 12:19:25,832 INFO ]: detected equality via solver [2018-06-22 12:19:25,832 INFO ]: detected not equals via solver [2018-06-22 12:19:25,833 INFO ]: detected not equals via solver [2018-06-22 12:19:25,833 INFO ]: detected not equals via solver [2018-06-22 12:19:25,834 INFO ]: detected not equals via solver [2018-06-22 12:19:25,834 INFO ]: detected not equals via solver [2018-06-22 12:19:25,834 INFO ]: detected equality via solver [2018-06-22 12:19:25,834 INFO ]: detected equality via solver [2018-06-22 12:19:25,835 INFO ]: detected not equals via solver [2018-06-22 12:19:25,848 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 129 [2018-06-22 12:19:25,848 INFO ]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:25,850 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:25,850 INFO ]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:25,853 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:25,854 INFO ]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:25,856 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:25,856 INFO ]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:25,880 INFO ]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:25,882 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:25,882 INFO ]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:25,887 INFO ]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:25,889 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:25,889 INFO ]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:25,892 INFO ]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:25,901 INFO ]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:25,902 INFO ]: Needed 10 recursive calls to eliminate 6 variables, input treesize:517, output treesize:3 [2018-06-22 12:19:25,939 INFO ]: Checked inductivity of 57 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 17 not checked. [2018-06-22 12:19:25,958 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:25,958 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2018-06-22 12:19:25,958 INFO ]: Interpolant automaton has 34 states [2018-06-22 12:19:25,959 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 12:19:25,959 INFO ]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=12, NotChecked=180, Total=1122 [2018-06-22 12:19:25,959 INFO ]: Start difference. First operand 43 states and 51 transitions. Second operand 34 states. [2018-06-22 12:19:27,763 WARN ]: Spent 121.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 56 [2018-06-22 12:19:28,315 WARN ]: Spent 111.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 63 [2018-06-22 12:19:28,950 WARN ]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2018-06-22 12:19:30,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:30,108 INFO ]: Finished difference Result 101 states and 127 transitions. [2018-06-22 12:19:30,109 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 12:19:30,109 INFO ]: Start accepts. Automaton has 34 states. Word has length 41 [2018-06-22 12:19:30,109 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:30,110 INFO ]: With dead ends: 101 [2018-06-22 12:19:30,110 INFO ]: Without dead ends: 69 [2018-06-22 12:19:30,111 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=400, Invalid=3113, Unknown=39, NotChecked=354, Total=3906 [2018-06-22 12:19:30,111 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 12:19:30,119 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 57. [2018-06-22 12:19:30,119 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 12:19:30,120 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2018-06-22 12:19:30,120 INFO ]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 41 [2018-06-22 12:19:30,120 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:30,120 INFO ]: Abstraction has 57 states and 70 transitions. [2018-06-22 12:19:30,120 INFO ]: Interpolant automaton has 34 states. [2018-06-22 12:19:30,120 INFO ]: Start isEmpty. Operand 57 states and 70 transitions. [2018-06-22 12:19:30,121 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 12:19:30,121 INFO ]: Found error trace [2018-06-22 12:19:30,121 INFO ]: trace histogram [6, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:30,121 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:30,122 INFO ]: Analyzing trace with hash -248880965, now seen corresponding path program 7 times [2018-06-22 12:19:30,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:30,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:30,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:30,122 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:19:30,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:30,134 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:30,321 INFO ]: Checked inductivity of 76 backedges. 20 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 12:19:30,321 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:30,321 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:19:30,326 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:19:30,365 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:30,368 INFO ]: Computing forward predicates... [2018-06-22 12:19:30,461 INFO ]: Checked inductivity of 76 backedges. 20 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 12:19:30,480 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:30,480 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2018-06-22 12:19:30,480 INFO ]: Interpolant automaton has 21 states [2018-06-22 12:19:30,480 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 12:19:30,481 INFO ]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-06-22 12:19:30,481 INFO ]: Start difference. First operand 57 states and 70 transitions. Second operand 21 states. [2018-06-22 12:19:30,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:30,715 INFO ]: Finished difference Result 65 states and 79 transitions. [2018-06-22 12:19:30,717 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 12:19:30,717 INFO ]: Start accepts. Automaton has 21 states. Word has length 45 [2018-06-22 12:19:30,717 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:30,717 INFO ]: With dead ends: 65 [2018-06-22 12:19:30,717 INFO ]: Without dead ends: 63 [2018-06-22 12:19:30,718 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2018-06-22 12:19:30,718 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 12:19:30,723 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 12:19:30,723 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 12:19:30,724 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-06-22 12:19:30,724 INFO ]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 45 [2018-06-22 12:19:30,724 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:30,724 INFO ]: Abstraction has 57 states and 69 transitions. [2018-06-22 12:19:30,724 INFO ]: Interpolant automaton has 21 states. [2018-06-22 12:19:30,724 INFO ]: Start isEmpty. Operand 57 states and 69 transitions. [2018-06-22 12:19:30,725 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 12:19:30,725 INFO ]: Found error trace [2018-06-22 12:19:30,726 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:30,726 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:30,726 INFO ]: Analyzing trace with hash 300983417, now seen corresponding path program 8 times [2018-06-22 12:19:30,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:30,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:30,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:30,726 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:19:30,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:30,737 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:31,052 INFO ]: Checked inductivity of 72 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 12:19:31,052 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:31,052 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:19:31,057 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:19:31,084 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:19:31,084 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:31,086 INFO ]: Computing forward predicates... [2018-06-22 12:19:31,239 INFO ]: Checked inductivity of 72 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 12:19:31,262 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:31,262 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2018-06-22 12:19:31,262 INFO ]: Interpolant automaton has 20 states [2018-06-22 12:19:31,262 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 12:19:31,262 INFO ]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-06-22 12:19:31,262 INFO ]: Start difference. First operand 57 states and 69 transitions. Second operand 20 states. [2018-06-22 12:19:31,435 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:31,435 INFO ]: Finished difference Result 59 states and 69 transitions. [2018-06-22 12:19:31,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 12:19:31,436 INFO ]: Start accepts. Automaton has 20 states. Word has length 45 [2018-06-22 12:19:31,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:31,436 INFO ]: With dead ends: 59 [2018-06-22 12:19:31,436 INFO ]: Without dead ends: 51 [2018-06-22 12:19:31,436 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2018-06-22 12:19:31,437 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 12:19:31,441 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 45. [2018-06-22 12:19:31,441 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 12:19:31,442 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-06-22 12:19:31,442 INFO ]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 45 [2018-06-22 12:19:31,442 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:31,442 INFO ]: Abstraction has 45 states and 51 transitions. [2018-06-22 12:19:31,442 INFO ]: Interpolant automaton has 20 states. [2018-06-22 12:19:31,442 INFO ]: Start isEmpty. Operand 45 states and 51 transitions. [2018-06-22 12:19:31,443 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 12:19:31,443 INFO ]: Found error trace [2018-06-22 12:19:31,443 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:31,443 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:31,443 INFO ]: Analyzing trace with hash 1531957981, now seen corresponding path program 9 times [2018-06-22 12:19:31,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:31,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:31,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:31,444 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:19:31,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:31,511 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:32,260 WARN ]: Spent 312.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-06-22 12:19:32,921 WARN ]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2018-06-22 12:19:34,240 WARN ]: Spent 389.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-06-22 12:19:34,330 INFO ]: Checked inductivity of 91 backedges. 2 proven. 60 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 12:19:34,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:34,330 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:19:34,338 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 12:19:34,382 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 12:19:34,382 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:34,386 INFO ]: Computing forward predicates... [2018-06-22 12:19:34,638 WARN ]: unable to prove that (exists ((v_subst_4 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse1 (+ v_subst_4 1))) (and (<= 0 v_subst_4) (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (let ((.cse0 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4 1))))) (store .cse0 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse0 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1))))) (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int .cse1) (<= v_subst_4 0) (<= .cse1 INV_MAIN_1_hbv_INV_MAIN_1_1_Int)))) is different from true [2018-06-22 12:19:34,666 WARN ]: unable to prove that (exists ((v_subst_4 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse0 (+ v_subst_4 1))) (and (<= 0 v_subst_4) (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int .cse0) (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (let ((.cse1 (let ((.cse2 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4 1))))) (store .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))))) (store .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int (- 1)) (select .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int))))) (<= v_subst_4 0) (<= .cse0 INV_MAIN_1_hbv_INV_MAIN_1_1_Int)))) is different from true [2018-06-22 12:19:34,699 WARN ]: unable to prove that (exists ((v_subst_5 Int) (v_subst_4 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse1 (+ v_subst_4 1)) (.cse0 (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1))) (and (<= .cse0 c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int) (<= 0 v_subst_4) (<= .cse1 v_subst_5) (<= v_subst_5 .cse1) (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (let ((.cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4 1))))) (store .cse5 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_5) (select .cse5 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_5 1)))))) (store .cse4 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int (- 1)) (select .cse4 .cse3))))) (store .cse2 .cse3 (select .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))))) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int .cse0) (<= v_subst_4 0)))) is different from true [2018-06-22 12:19:34,737 WARN ]: unable to prove that (exists ((v_subst_6 Int) (v_subst_5 Int) (v_subst_4 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse1 (+ v_subst_4 1)) (.cse0 (+ v_subst_6 1)) (.cse2 (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1))) (and (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int .cse0) (<= 0 v_subst_4) (<= .cse1 v_subst_5) (<= v_subst_5 .cse1) (<= .cse2 c_INV_MAIN_1_hhv_INV_MAIN_1_1_Int) (<= .cse0 INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int .cse2) (<= v_subst_4 0) (= (let ((.cse3 (let ((.cse5 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_6))) (let ((.cse4 (let ((.cse6 (let ((.cse7 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4 1))))) (store .cse7 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_5) (select .cse7 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_5 1)))))) (store .cse6 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_6 (- 1)) (select .cse6 .cse5))))) (store .cse4 .cse5 (select .cse4 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_6 1))))))) (store .cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))) c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int)))) is different from true [2018-06-22 12:19:35,387 WARN ]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-06-22 12:19:36,036 WARN ]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-06-22 12:19:37,130 WARN ]: Spent 763.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2018-06-22 12:19:37,178 INFO ]: detected not equals via solver [2018-06-22 12:19:37,198 INFO ]: detected not equals via solver [2018-06-22 12:19:37,228 INFO ]: detected not equals via solver [2018-06-22 12:19:37,248 INFO ]: detected not equals via solver [2018-06-22 12:19:37,273 INFO ]: detected not equals via solver [2018-06-22 12:19:37,297 INFO ]: detected not equals via solver [2018-06-22 12:19:37,310 INFO ]: detected equality via solver [2018-06-22 12:19:37,339 INFO ]: detected not equals via solver [2018-06-22 12:19:37,359 INFO ]: detected not equals via solver [2018-06-22 12:19:37,384 INFO ]: detected not equals via solver [2018-06-22 12:19:37,405 INFO ]: detected not equals via solver [2018-06-22 12:19:37,429 INFO ]: detected not equals via solver [2018-06-22 12:19:37,442 INFO ]: detected equality via solver [2018-06-22 12:19:37,466 INFO ]: detected not equals via solver [2018-06-22 12:19:37,490 INFO ]: detected not equals via solver [2018-06-22 12:19:37,875 INFO ]: Index analysis took 744 ms [2018-06-22 12:19:37,877 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 965 treesize of output 788 [2018-06-22 12:19:37,956 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:37,956 INFO ]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:37,976 INFO ]: detected not equals via solver [2018-06-22 12:19:37,977 INFO ]: detected not equals via solver [2018-06-22 12:19:37,977 INFO ]: detected not equals via solver [2018-06-22 12:19:37,978 INFO ]: detected not equals via solver [2018-06-22 12:19:37,979 INFO ]: detected not equals via solver [2018-06-22 12:19:37,979 INFO ]: detected not equals via solver [2018-06-22 12:19:37,980 INFO ]: detected not equals via solver [2018-06-22 12:19:37,981 INFO ]: detected not equals via solver [2018-06-22 12:19:37,982 INFO ]: detected not equals via solver [2018-06-22 12:19:37,983 INFO ]: detected not equals via solver [2018-06-22 12:19:37,983 INFO ]: detected not equals via solver [2018-06-22 12:19:37,984 INFO ]: detected not equals via solver [2018-06-22 12:19:37,984 INFO ]: detected not equals via solver [2018-06-22 12:19:37,985 INFO ]: detected equality via solver [2018-06-22 12:19:37,985 INFO ]: detected not equals via solver [2018-06-22 12:19:37,986 INFO ]: detected not equals via solver [2018-06-22 12:19:38,008 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 503 treesize of output 508 [2018-06-22 12:19:38,078 INFO ]: detected not equals via solver [2018-06-22 12:19:38,078 INFO ]: detected not equals via solver [2018-06-22 12:19:38,079 INFO ]: detected not equals via solver [2018-06-22 12:19:38,080 INFO ]: detected not equals via solver [2018-06-22 12:19:38,080 INFO ]: detected not equals via solver [2018-06-22 12:19:38,081 INFO ]: detected not equals via solver [2018-06-22 12:19:38,082 INFO ]: detected not equals via solver [2018-06-22 12:19:38,082 INFO ]: detected not equals via solver [2018-06-22 12:19:38,083 INFO ]: detected not equals via solver [2018-06-22 12:19:38,083 INFO ]: detected not equals via solver [2018-06-22 12:19:38,084 INFO ]: detected not equals via solver [2018-06-22 12:19:38,085 INFO ]: detected not equals via solver [2018-06-22 12:19:38,085 INFO ]: detected not equals via solver [2018-06-22 12:19:38,086 INFO ]: detected not equals via solver [2018-06-22 12:19:38,087 INFO ]: detected not equals via solver [2018-06-22 12:19:38,088 INFO ]: detected not equals via solver [2018-06-22 12:19:38,090 INFO ]: detected not equals via solver [2018-06-22 12:19:38,090 INFO ]: detected not equals via solver [2018-06-22 12:19:38,092 INFO ]: detected not equals via solver [2018-06-22 12:19:38,093 INFO ]: detected not equals via solver [2018-06-22 12:19:38,093 INFO ]: detected not equals via solver [2018-06-22 12:19:38,096 INFO ]: detected not equals via solver [2018-06-22 12:19:38,384 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 258 treesize of output 414 [2018-06-22 12:19:39,164 WARN ]: Spent 772.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 174 [2018-06-22 12:19:39,167 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:39,190 INFO ]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:39,193 INFO ]: detected not equals via solver [2018-06-22 12:19:39,194 INFO ]: detected not equals via solver [2018-06-22 12:19:39,194 INFO ]: detected not equals via solver [2018-06-22 12:19:39,195 INFO ]: detected not equals via solver [2018-06-22 12:19:39,195 INFO ]: detected not equals via solver [2018-06-22 12:19:39,196 INFO ]: detected not equals via solver [2018-06-22 12:19:39,196 INFO ]: detected not equals via solver [2018-06-22 12:19:39,197 INFO ]: detected not equals via solver [2018-06-22 12:19:39,198 INFO ]: detected not equals via solver [2018-06-22 12:19:39,198 INFO ]: detected not equals via solver [2018-06-22 12:19:39,199 INFO ]: detected not equals via solver [2018-06-22 12:19:39,199 INFO ]: detected not equals via solver [2018-06-22 12:19:39,200 INFO ]: detected not equals via solver [2018-06-22 12:19:39,201 INFO ]: detected not equals via solver [2018-06-22 12:19:39,201 INFO ]: detected not equals via solver [2018-06-22 12:19:39,216 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 285 [2018-06-22 12:19:39,388 WARN ]: Spent 168.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 82 [2018-06-22 12:19:39,392 INFO ]: detected not equals via solver [2018-06-22 12:19:39,393 INFO ]: detected not equals via solver [2018-06-22 12:19:39,393 INFO ]: detected not equals via solver [2018-06-22 12:19:39,393 INFO ]: detected equality via solver [2018-06-22 12:19:39,394 INFO ]: detected not equals via solver [2018-06-22 12:19:39,395 INFO ]: detected not equals via solver [2018-06-22 12:19:39,395 INFO ]: detected not equals via solver [2018-06-22 12:19:39,396 INFO ]: detected not equals via solver [2018-06-22 12:19:39,396 INFO ]: detected not equals via solver [2018-06-22 12:19:39,397 INFO ]: detected not equals via solver [2018-06-22 12:19:39,397 INFO ]: detected not equals via solver [2018-06-22 12:19:39,398 INFO ]: detected not equals via solver [2018-06-22 12:19:39,400 INFO ]: detected not equals via solver [2018-06-22 12:19:39,401 INFO ]: detected not equals via solver [2018-06-22 12:19:39,401 INFO ]: detected not equals via solver [2018-06-22 12:19:39,402 INFO ]: detected not equals via solver [2018-06-22 12:19:39,402 INFO ]: detected not equals via solver [2018-06-22 12:19:39,403 INFO ]: detected not equals via solver [2018-06-22 12:19:39,403 INFO ]: detected not equals via solver [2018-06-22 12:19:39,404 INFO ]: detected not equals via solver [2018-06-22 12:19:39,404 INFO ]: detected equality via solver [2018-06-22 12:19:39,421 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 188 [2018-06-22 12:19:39,422 INFO ]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:39,439 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:39,439 INFO ]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:39,442 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:39,442 INFO ]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:39,488 INFO ]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:39,607 INFO ]: detected not equals via solver [2018-06-22 12:19:39,607 INFO ]: detected not equals via solver [2018-06-22 12:19:39,608 INFO ]: detected not equals via solver [2018-06-22 12:19:39,608 INFO ]: detected not equals via solver [2018-06-22 12:19:39,609 INFO ]: detected not equals via solver [2018-06-22 12:19:39,610 INFO ]: detected not equals via solver [2018-06-22 12:19:39,610 INFO ]: detected not equals via solver [2018-06-22 12:19:39,611 INFO ]: detected not equals via solver [2018-06-22 12:19:39,611 INFO ]: detected not equals via solver [2018-06-22 12:19:39,612 INFO ]: detected not equals via solver [2018-06-22 12:19:39,612 INFO ]: detected not equals via solver [2018-06-22 12:19:39,613 INFO ]: detected not equals via solver [2018-06-22 12:19:39,613 INFO ]: detected not equals via solver [2018-06-22 12:19:39,614 INFO ]: detected not equals via solver [2018-06-22 12:19:39,614 INFO ]: detected not equals via solver [2018-06-22 12:19:39,628 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 237 [2018-06-22 12:19:39,786 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 78 [2018-06-22 12:19:39,789 INFO ]: detected not equals via solver [2018-06-22 12:19:39,789 INFO ]: detected not equals via solver [2018-06-22 12:19:39,790 INFO ]: detected not equals via solver [2018-06-22 12:19:39,790 INFO ]: detected equality via solver [2018-06-22 12:19:39,791 INFO ]: detected not equals via solver [2018-06-22 12:19:39,791 INFO ]: detected not equals via solver [2018-06-22 12:19:39,792 INFO ]: detected not equals via solver [2018-06-22 12:19:39,792 INFO ]: detected not equals via solver [2018-06-22 12:19:39,793 INFO ]: detected not equals via solver [2018-06-22 12:19:39,793 INFO ]: detected not equals via solver [2018-06-22 12:19:39,794 INFO ]: detected not equals via solver [2018-06-22 12:19:39,794 INFO ]: detected not equals via solver [2018-06-22 12:19:39,794 INFO ]: detected not equals via solver [2018-06-22 12:19:39,795 INFO ]: detected not equals via solver [2018-06-22 12:19:39,795 INFO ]: detected not equals via solver [2018-06-22 12:19:39,801 INFO ]: detected not equals via solver [2018-06-22 12:19:39,801 INFO ]: detected not equals via solver [2018-06-22 12:19:39,802 INFO ]: detected not equals via solver [2018-06-22 12:19:39,802 INFO ]: detected not equals via solver [2018-06-22 12:19:39,803 INFO ]: detected not equals via solver [2018-06-22 12:19:39,803 INFO ]: detected equality via solver [2018-06-22 12:19:39,819 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 192 [2018-06-22 12:19:39,820 INFO ]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:39,822 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:39,822 INFO ]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:39,825 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:39,825 INFO ]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:39,827 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:39,827 INFO ]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:39,867 INFO ]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:39,896 INFO ]: detected not equals via solver [2018-06-22 12:19:39,896 INFO ]: detected not equals via solver [2018-06-22 12:19:39,897 INFO ]: detected not equals via solver [2018-06-22 12:19:39,897 INFO ]: detected not equals via solver [2018-06-22 12:19:39,898 INFO ]: detected not equals via solver [2018-06-22 12:19:39,898 INFO ]: detected not equals via solver [2018-06-22 12:19:39,899 INFO ]: detected not equals via solver [2018-06-22 12:19:39,899 INFO ]: detected not equals via solver [2018-06-22 12:19:39,900 INFO ]: detected not equals via solver [2018-06-22 12:19:39,900 INFO ]: detected not equals via solver [2018-06-22 12:19:39,901 INFO ]: detected not equals via solver [2018-06-22 12:19:39,902 INFO ]: detected not equals via solver [2018-06-22 12:19:39,902 INFO ]: detected not equals via solver [2018-06-22 12:19:39,903 INFO ]: detected not equals via solver [2018-06-22 12:19:39,903 INFO ]: detected not equals via solver [2018-06-22 12:19:39,904 INFO ]: detected not equals via solver [2018-06-22 12:19:39,904 INFO ]: detected not equals via solver [2018-06-22 12:19:39,905 INFO ]: detected not equals via solver [2018-06-22 12:19:39,905 INFO ]: detected not equals via solver [2018-06-22 12:19:39,906 INFO ]: detected not equals via solver [2018-06-22 12:19:39,906 INFO ]: detected equality via solver [2018-06-22 12:19:39,906 INFO ]: detected not equals via solver [2018-06-22 12:19:39,907 INFO ]: detected not equals via solver [2018-06-22 12:19:39,907 INFO ]: detected equality via solver [2018-06-22 12:19:39,931 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 315 [2018-06-22 12:19:40,050 WARN ]: Spent 116.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 60 [2018-06-22 12:19:40,054 INFO ]: detected not equals via solver [2018-06-22 12:19:40,054 INFO ]: detected not equals via solver [2018-06-22 12:19:40,055 INFO ]: detected not equals via solver [2018-06-22 12:19:40,055 INFO ]: detected not equals via solver [2018-06-22 12:19:40,056 INFO ]: detected not equals via solver [2018-06-22 12:19:40,056 INFO ]: detected not equals via solver [2018-06-22 12:19:40,057 INFO ]: detected not equals via solver [2018-06-22 12:19:40,057 INFO ]: detected equality via solver [2018-06-22 12:19:40,057 INFO ]: detected not equals via solver [2018-06-22 12:19:40,058 INFO ]: detected not equals via solver [2018-06-22 12:19:40,058 INFO ]: detected not equals via solver [2018-06-22 12:19:40,059 INFO ]: detected not equals via solver [2018-06-22 12:19:40,059 INFO ]: detected equality via solver [2018-06-22 12:19:40,060 INFO ]: detected not equals via solver [2018-06-22 12:19:40,060 INFO ]: detected not equals via solver [2018-06-22 12:19:40,061 INFO ]: detected not equals via solver [2018-06-22 12:19:40,061 INFO ]: detected equality via solver [2018-06-22 12:19:40,061 INFO ]: detected not equals via solver [2018-06-22 12:19:40,062 INFO ]: detected not equals via solver [2018-06-22 12:19:40,062 INFO ]: detected equality via solver [2018-06-22 12:19:40,085 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 10 disjoint index pairs (out of 36 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 180 [2018-06-22 12:19:40,086 INFO ]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:40,124 INFO ]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:40,150 INFO ]: detected not equals via solver [2018-06-22 12:19:40,151 INFO ]: detected not equals via solver [2018-06-22 12:19:40,152 INFO ]: detected not equals via solver [2018-06-22 12:19:40,153 INFO ]: detected not equals via solver [2018-06-22 12:19:40,155 INFO ]: detected not equals via solver [2018-06-22 12:19:40,156 INFO ]: detected not equals via solver [2018-06-22 12:19:40,156 INFO ]: detected not equals via solver [2018-06-22 12:19:40,157 INFO ]: detected not equals via solver [2018-06-22 12:19:40,158 INFO ]: detected not equals via solver [2018-06-22 12:19:40,158 INFO ]: detected not equals via solver [2018-06-22 12:19:40,159 INFO ]: detected not equals via solver [2018-06-22 12:19:40,160 INFO ]: detected not equals via solver [2018-06-22 12:19:40,160 INFO ]: detected not equals via solver [2018-06-22 12:19:40,161 INFO ]: detected not equals via solver [2018-06-22 12:19:40,162 INFO ]: detected not equals via solver [2018-06-22 12:19:40,162 INFO ]: detected not equals via solver [2018-06-22 12:19:40,163 INFO ]: detected not equals via solver [2018-06-22 12:19:40,163 INFO ]: detected not equals via solver [2018-06-22 12:19:40,164 INFO ]: detected not equals via solver [2018-06-22 12:19:40,165 INFO ]: detected not equals via solver [2018-06-22 12:19:40,165 INFO ]: detected not equals via solver [2018-06-22 12:19:40,166 INFO ]: detected not equals via solver [2018-06-22 12:19:40,168 INFO ]: detected not equals via solver [2018-06-22 12:19:40,169 INFO ]: detected not equals via solver [2018-06-22 12:19:40,170 INFO ]: detected not equals via solver [2018-06-22 12:19:40,171 INFO ]: detected not equals via solver [2018-06-22 12:19:40,172 INFO ]: detected not equals via solver [2018-06-22 12:19:40,172 INFO ]: detected not equals via solver [2018-06-22 12:19:40,173 INFO ]: detected not equals via solver [2018-06-22 12:19:40,173 INFO ]: detected not equals via solver [2018-06-22 12:19:40,240 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 30 disjoint index pairs (out of 36 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 150 treesize of output 431 [2018-06-22 12:19:43,257 WARN ]: Spent 2.99 s on a formula simplification. DAG size of input: 965 DAG size of output: 315 [2018-06-22 12:19:43,264 INFO ]: detected not equals via solver [2018-06-22 12:19:43,265 INFO ]: detected not equals via solver [2018-06-22 12:19:43,265 INFO ]: detected equality via solver [2018-06-22 12:19:43,265 INFO ]: detected not equals via solver [2018-06-22 12:19:43,266 INFO ]: detected not equals via solver [2018-06-22 12:19:43,266 INFO ]: detected not equals via solver [2018-06-22 12:19:43,267 INFO ]: detected not equals via solver [2018-06-22 12:19:43,267 INFO ]: detected not equals via solver [2018-06-22 12:19:43,268 INFO ]: detected not equals via solver [2018-06-22 12:19:43,268 INFO ]: detected not equals via solver [2018-06-22 12:19:43,269 INFO ]: detected not equals via solver [2018-06-22 12:19:43,269 INFO ]: detected equality via solver [2018-06-22 12:19:43,270 INFO ]: detected not equals via solver [2018-06-22 12:19:43,271 INFO ]: detected not equals via solver [2018-06-22 12:19:43,271 INFO ]: detected not equals via solver [2018-06-22 12:19:43,272 INFO ]: detected not equals via solver [2018-06-22 12:19:43,272 INFO ]: detected not equals via solver [2018-06-22 12:19:43,272 INFO ]: detected equality via solver [2018-06-22 12:19:43,273 INFO ]: detected not equals via solver [2018-06-22 12:19:43,273 INFO ]: detected not equals via solver [2018-06-22 12:19:43,274 INFO ]: detected not equals via solver [2018-06-22 12:19:43,274 INFO ]: detected not equals via solver [2018-06-22 12:19:43,275 INFO ]: detected not equals via solver [2018-06-22 12:19:43,275 INFO ]: detected not equals via solver [2018-06-22 12:19:43,276 INFO ]: detected not equals via solver [2018-06-22 12:19:43,276 INFO ]: detected equality via solver [2018-06-22 12:19:43,340 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 326 [2018-06-22 12:19:43,341 INFO ]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:43,346 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:43,346 INFO ]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:43,349 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:43,349 INFO ]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:43,890 INFO ]: detected not equals via solver [2018-06-22 12:19:43,890 INFO ]: detected not equals via solver [2018-06-22 12:19:43,891 INFO ]: detected not equals via solver [2018-06-22 12:19:43,891 INFO ]: detected not equals via solver [2018-06-22 12:19:43,891 INFO ]: detected equality via solver [2018-06-22 12:19:43,892 INFO ]: detected not equals via solver [2018-06-22 12:19:43,893 INFO ]: detected not equals via solver [2018-06-22 12:19:43,893 INFO ]: detected not equals via solver [2018-06-22 12:19:43,893 INFO ]: detected not equals via solver [2018-06-22 12:19:43,894 INFO ]: detected not equals via solver [2018-06-22 12:19:43,894 INFO ]: detected not equals via solver [2018-06-22 12:19:43,895 INFO ]: detected not equals via solver [2018-06-22 12:19:43,895 INFO ]: detected not equals via solver [2018-06-22 12:19:43,896 INFO ]: detected equality via solver [2018-06-22 12:19:43,896 INFO ]: detected not equals via solver [2018-06-22 12:19:43,897 INFO ]: detected not equals via solver [2018-06-22 12:19:43,897 INFO ]: detected not equals via solver [2018-06-22 12:19:43,898 INFO ]: detected not equals via solver [2018-06-22 12:19:43,898 INFO ]: detected not equals via solver [2018-06-22 12:19:43,899 INFO ]: detected not equals via solver [2018-06-22 12:19:43,899 INFO ]: detected equality via solver [2018-06-22 12:19:43,899 INFO ]: detected not equals via solver [2018-06-22 12:19:43,900 INFO ]: detected not equals via solver [2018-06-22 12:19:43,900 INFO ]: detected equality via solver [2018-06-22 12:19:43,900 INFO ]: detected not equals via solver [2018-06-22 12:19:43,901 INFO ]: detected not equals via solver [2018-06-22 12:19:43,901 INFO ]: detected equality via solver [2018-06-22 12:19:43,901 INFO ]: detected equality via solver [2018-06-22 12:19:43,931 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 10 disjoint index pairs (out of 55 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 265 [2018-06-22 12:19:43,932 INFO ]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:44,063 INFO ]: detected not equals via solver [2018-06-22 12:19:44,084 INFO ]: detected not equals via solver [2018-06-22 12:19:44,086 INFO ]: detected not equals via solver [2018-06-22 12:19:44,086 INFO ]: detected not equals via solver [2018-06-22 12:19:44,087 INFO ]: detected not equals via solver [2018-06-22 12:19:44,089 INFO ]: detected not equals via solver [2018-06-22 12:19:44,097 INFO ]: detected not equals via solver [2018-06-22 12:19:44,098 INFO ]: detected not equals via solver [2018-06-22 12:19:44,099 INFO ]: detected not equals via solver [2018-06-22 12:19:44,099 INFO ]: detected equality via solver [2018-06-22 12:19:44,099 INFO ]: detected not equals via solver [2018-06-22 12:19:44,100 INFO ]: detected not equals via solver [2018-06-22 12:19:44,101 INFO ]: detected not equals via solver [2018-06-22 12:19:44,101 INFO ]: detected not equals via solver [2018-06-22 12:19:44,102 INFO ]: detected not equals via solver [2018-06-22 12:19:44,103 INFO ]: detected not equals via solver [2018-06-22 12:19:44,103 INFO ]: detected not equals via solver [2018-06-22 12:19:44,103 INFO ]: detected equality via solver [2018-06-22 12:19:44,104 INFO ]: detected not equals via solver [2018-06-22 12:19:44,105 INFO ]: detected not equals via solver [2018-06-22 12:19:44,105 INFO ]: detected not equals via solver [2018-06-22 12:19:44,106 INFO ]: detected not equals via solver [2018-06-22 12:19:44,107 INFO ]: detected not equals via solver [2018-06-22 12:19:44,107 INFO ]: detected not equals via solver [2018-06-22 12:19:44,108 INFO ]: detected not equals via solver [2018-06-22 12:19:44,109 INFO ]: detected not equals via solver [2018-06-22 12:19:44,110 INFO ]: detected not equals via solver [2018-06-22 12:19:44,112 INFO ]: detected not equals via solver [2018-06-22 12:19:44,112 INFO ]: detected not equals via solver [2018-06-22 12:19:44,113 INFO ]: detected not equals via solver [2018-06-22 12:19:44,114 INFO ]: detected not equals via solver [2018-06-22 12:19:44,114 INFO ]: detected equality via solver [2018-06-22 12:19:44,156 INFO ]: Index analysis took 124 ms [2018-06-22 12:19:44,174 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 22 disjoint index pairs (out of 55 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 357 [2018-06-22 12:19:44,196 INFO ]: Start of recursive call 23: End of recursive call: and 32 xjuncts. [2018-06-22 12:19:44,789 INFO ]: Start of recursive call 18: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-22 12:19:44,796 INFO ]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-22 12:19:44,807 INFO ]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-22 12:19:44,813 INFO ]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-22 12:19:44,831 INFO ]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-22 12:19:44,831 INFO ]: Needed 23 recursive calls to eliminate 6 variables, input treesize:1327, output treesize:25 [2018-06-22 12:19:44,935 INFO ]: Checked inductivity of 91 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 29 trivial. 28 not checked. [2018-06-22 12:19:44,956 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:44,956 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 35 [2018-06-22 12:19:44,956 INFO ]: Interpolant automaton has 35 states [2018-06-22 12:19:44,957 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 12:19:44,957 INFO ]: CoverageRelationStatistics Valid=95, Invalid=843, Unknown=8, NotChecked=244, Total=1190 [2018-06-22 12:19:44,957 INFO ]: Start difference. First operand 45 states and 51 transitions. Second operand 35 states. [2018-06-22 12:19:45,123 WARN ]: Spent 117.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-06-22 12:19:45,370 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2018-06-22 12:19:46,049 WARN ]: Spent 148.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 59 [2018-06-22 12:19:46,365 WARN ]: Spent 182.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 64 [2018-06-22 12:19:48,064 WARN ]: Spent 151.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2018-06-22 12:19:48,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:48,528 INFO ]: Finished difference Result 73 states and 85 transitions. [2018-06-22 12:19:48,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 12:19:48,529 INFO ]: Start accepts. Automaton has 35 states. Word has length 49 [2018-06-22 12:19:48,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:48,530 INFO ]: With dead ends: 73 [2018-06-22 12:19:48,530 INFO ]: Without dead ends: 71 [2018-06-22 12:19:48,531 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=274, Invalid=1981, Unknown=17, NotChecked=380, Total=2652 [2018-06-22 12:19:48,531 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 12:19:48,537 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 59. [2018-06-22 12:19:48,537 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 12:19:48,538 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-06-22 12:19:48,538 INFO ]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 49 [2018-06-22 12:19:48,538 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:48,538 INFO ]: Abstraction has 59 states and 67 transitions. [2018-06-22 12:19:48,538 INFO ]: Interpolant automaton has 35 states. [2018-06-22 12:19:48,538 INFO ]: Start isEmpty. Operand 59 states and 67 transitions. [2018-06-22 12:19:48,539 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 12:19:48,539 INFO ]: Found error trace [2018-06-22 12:19:48,539 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:48,539 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:48,539 INFO ]: Analyzing trace with hash 1731867000, now seen corresponding path program 4 times [2018-06-22 12:19:48,539 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:48,539 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:48,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:48,540 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:19:48,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:48,552 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:48,966 INFO ]: Checked inductivity of 91 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 12:19:48,966 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:48,966 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:19:48,972 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 12:19:48,998 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 12:19:48,998 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:49,000 INFO ]: Computing forward predicates... [2018-06-22 12:19:49,102 INFO ]: Checked inductivity of 91 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-22 12:19:49,121 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:49,121 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9] total 24 [2018-06-22 12:19:49,121 INFO ]: Interpolant automaton has 24 states [2018-06-22 12:19:49,121 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 12:19:49,122 INFO ]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-06-22 12:19:49,122 INFO ]: Start difference. First operand 59 states and 67 transitions. Second operand 24 states. [2018-06-22 12:19:49,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:49,600 INFO ]: Finished difference Result 85 states and 100 transitions. [2018-06-22 12:19:49,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 12:19:49,600 INFO ]: Start accepts. Automaton has 24 states. Word has length 49 [2018-06-22 12:19:49,601 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:49,601 INFO ]: With dead ends: 85 [2018-06-22 12:19:49,601 INFO ]: Without dead ends: 79 [2018-06-22 12:19:49,602 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=1444, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 12:19:49,602 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 12:19:49,610 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-06-22 12:19:49,610 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 12:19:49,611 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-06-22 12:19:49,611 INFO ]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 49 [2018-06-22 12:19:49,611 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:49,611 INFO ]: Abstraction has 63 states and 72 transitions. [2018-06-22 12:19:49,611 INFO ]: Interpolant automaton has 24 states. [2018-06-22 12:19:49,611 INFO ]: Start isEmpty. Operand 63 states and 72 transitions. [2018-06-22 12:19:49,612 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 12:19:49,612 INFO ]: Found error trace [2018-06-22 12:19:49,612 INFO ]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:49,612 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:49,612 INFO ]: Analyzing trace with hash -2045576639, now seen corresponding path program 10 times [2018-06-22 12:19:49,612 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:49,612 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:49,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:49,613 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:19:49,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:49,637 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:49,851 INFO ]: Checked inductivity of 114 backedges. 30 proven. 37 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-22 12:19:49,851 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:49,851 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:19:49,860 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 12:19:49,891 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 12:19:49,891 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:49,894 INFO ]: Computing forward predicates... [2018-06-22 12:19:49,984 INFO ]: Checked inductivity of 114 backedges. 30 proven. 37 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-22 12:19:50,003 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:50,004 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2018-06-22 12:19:50,004 INFO ]: Interpolant automaton has 24 states [2018-06-22 12:19:50,004 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 12:19:50,004 INFO ]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2018-06-22 12:19:50,004 INFO ]: Start difference. First operand 63 states and 72 transitions. Second operand 24 states. [2018-06-22 12:19:50,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:50,287 INFO ]: Finished difference Result 75 states and 87 transitions. [2018-06-22 12:19:50,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 12:19:50,288 INFO ]: Start accepts. Automaton has 24 states. Word has length 53 [2018-06-22 12:19:50,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:50,288 INFO ]: With dead ends: 75 [2018-06-22 12:19:50,288 INFO ]: Without dead ends: 73 [2018-06-22 12:19:50,289 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=1099, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 12:19:50,289 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 12:19:50,293 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 63. [2018-06-22 12:19:50,293 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 12:19:50,294 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-06-22 12:19:50,294 INFO ]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 53 [2018-06-22 12:19:50,294 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:50,294 INFO ]: Abstraction has 63 states and 71 transitions. [2018-06-22 12:19:50,294 INFO ]: Interpolant automaton has 24 states. [2018-06-22 12:19:50,294 INFO ]: Start isEmpty. Operand 63 states and 71 transitions. [2018-06-22 12:19:50,295 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 12:19:50,295 INFO ]: Found error trace [2018-06-22 12:19:50,295 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:50,295 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:50,295 INFO ]: Analyzing trace with hash -267754369, now seen corresponding path program 11 times [2018-06-22 12:19:50,295 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:50,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:50,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:50,296 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:19:50,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:50,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:50,803 INFO ]: Checked inductivity of 110 backedges. 30 proven. 34 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 12:19:50,803 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:50,803 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:19:50,809 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 12:19:50,843 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 12:19:50,843 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:50,845 INFO ]: Computing forward predicates... [2018-06-22 12:19:50,939 INFO ]: Checked inductivity of 110 backedges. 30 proven. 34 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 12:19:50,959 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:50,959 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 23 [2018-06-22 12:19:50,959 INFO ]: Interpolant automaton has 23 states [2018-06-22 12:19:50,959 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 12:19:50,959 INFO ]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-06-22 12:19:50,959 INFO ]: Start difference. First operand 63 states and 71 transitions. Second operand 23 states. [2018-06-22 12:19:51,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:19:51,153 INFO ]: Finished difference Result 69 states and 77 transitions. [2018-06-22 12:19:51,154 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 12:19:51,154 INFO ]: Start accepts. Automaton has 23 states. Word has length 53 [2018-06-22 12:19:51,154 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:19:51,154 INFO ]: With dead ends: 69 [2018-06-22 12:19:51,154 INFO ]: Without dead ends: 55 [2018-06-22 12:19:51,155 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=922, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 12:19:51,155 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 12:19:51,160 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-06-22 12:19:51,160 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 12:19:51,160 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-06-22 12:19:51,161 INFO ]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 53 [2018-06-22 12:19:51,161 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:19:51,161 INFO ]: Abstraction has 49 states and 55 transitions. [2018-06-22 12:19:51,161 INFO ]: Interpolant automaton has 23 states. [2018-06-22 12:19:51,161 INFO ]: Start isEmpty. Operand 49 states and 55 transitions. [2018-06-22 12:19:51,161 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 12:19:51,161 INFO ]: Found error trace [2018-06-22 12:19:51,161 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:19:51,161 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:19:51,162 INFO ]: Analyzing trace with hash 456811235, now seen corresponding path program 12 times [2018-06-22 12:19:51,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:19:51,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:19:51,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:51,164 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:19:51,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:19:51,237 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:52,856 WARN ]: Spent 561.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-06-22 12:19:53,035 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-06-22 12:19:53,801 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-06-22 12:19:54,223 WARN ]: Spent 280.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-06-22 12:19:54,680 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2018-06-22 12:19:54,834 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2018-06-22 12:19:55,176 INFO ]: Checked inductivity of 133 backedges. 6 proven. 85 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 12:19:55,176 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:19:55,176 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:19:55,181 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 12:19:55,220 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 12:19:55,220 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:19:55,227 INFO ]: Computing forward predicates... [2018-06-22 12:19:56,152 WARN ]: unable to prove that (exists ((v_subst_9 Int) (v_subst_8 Int) (v_subst_7 Int) (v_subst_11 Int) (v_subst_10 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse3 (+ v_subst_10 1)) (.cse2 (+ v_subst_7 1)) (.cse1 (+ v_subst_9 1)) (.cse9 (+ v_subst_11 1)) (.cse0 (+ v_subst_8 1))) (and (<= v_subst_9 .cse0) (<= v_subst_10 .cse1) (<= .cse2 v_subst_8) (<= .cse3 v_subst_11) (<= v_subst_11 .cse3) (<= v_subst_8 .cse2) (<= .cse1 v_subst_10) (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_7) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_7 1))))) (store .cse8 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_8) (select .cse8 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_8 1)))))) (store .cse7 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_9) (select .cse7 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_9 1)))))) (store .cse6 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_10) (select .cse6 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_10 1)))))) (store .cse5 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_11) (select .cse5 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_11 1)))))) (store .cse4 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse4 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1))))) (<= 0 v_subst_7) (<= v_subst_7 0) (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int .cse9) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)) (<= .cse9 INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (<= .cse0 v_subst_9)))) is different from true [2018-06-22 12:19:57,357 WARN ]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2018-06-22 12:19:57,361 INFO ]: detected not equals via solver [2018-06-22 12:19:57,362 INFO ]: detected not equals via solver [2018-06-22 12:19:57,362 INFO ]: detected equality via solver [2018-06-22 12:19:57,363 INFO ]: detected not equals via solver [2018-06-22 12:19:57,364 INFO ]: detected not equals via solver [2018-06-22 12:19:57,364 INFO ]: detected not equals via solver [2018-06-22 12:19:57,365 INFO ]: detected not equals via solver [2018-06-22 12:19:57,366 INFO ]: detected not equals via solver [2018-06-22 12:19:57,367 INFO ]: detected not equals via solver [2018-06-22 12:19:57,367 INFO ]: detected equality via solver [2018-06-22 12:19:57,368 INFO ]: detected not equals via solver [2018-06-22 12:19:57,368 INFO ]: detected not equals via solver [2018-06-22 12:19:57,369 INFO ]: detected not equals via solver [2018-06-22 12:19:57,370 INFO ]: detected not equals via solver [2018-06-22 12:19:57,371 INFO ]: detected not equals via solver [2018-06-22 12:19:57,371 INFO ]: detected not equals via solver [2018-06-22 12:19:57,372 INFO ]: detected not equals via solver [2018-06-22 12:19:57,373 INFO ]: detected not equals via solver [2018-06-22 12:19:57,430 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2405 treesize of output 1774 [2018-06-22 12:19:57,710 WARN ]: Spent 278.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2018-06-22 12:19:57,713 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:57,713 INFO ]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:57,717 INFO ]: detected not equals via solver [2018-06-22 12:19:57,717 INFO ]: detected not equals via solver [2018-06-22 12:19:57,718 INFO ]: detected equality via solver [2018-06-22 12:19:57,718 INFO ]: detected not equals via solver [2018-06-22 12:19:57,719 INFO ]: detected not equals via solver [2018-06-22 12:19:57,720 INFO ]: detected not equals via solver [2018-06-22 12:19:57,721 INFO ]: detected not equals via solver [2018-06-22 12:19:57,721 INFO ]: detected not equals via solver [2018-06-22 12:19:57,722 INFO ]: detected not equals via solver [2018-06-22 12:19:57,722 INFO ]: detected not equals via solver [2018-06-22 12:19:57,723 INFO ]: detected not equals via solver [2018-06-22 12:19:57,723 INFO ]: detected equality via solver [2018-06-22 12:19:57,724 INFO ]: detected not equals via solver [2018-06-22 12:19:57,724 INFO ]: detected not equals via solver [2018-06-22 12:19:57,725 INFO ]: detected not equals via solver [2018-06-22 12:19:57,726 INFO ]: detected not equals via solver [2018-06-22 12:19:57,726 INFO ]: detected not equals via solver [2018-06-22 12:19:57,727 INFO ]: detected not equals via solver [2018-06-22 12:19:57,755 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1225 treesize of output 989 [2018-06-22 12:19:57,864 WARN ]: Spent 107.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2018-06-22 12:19:57,867 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:57,867 INFO ]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:57,871 INFO ]: detected not equals via solver [2018-06-22 12:19:57,872 INFO ]: detected not equals via solver [2018-06-22 12:19:57,873 INFO ]: detected not equals via solver [2018-06-22 12:19:57,873 INFO ]: detected not equals via solver [2018-06-22 12:19:57,874 INFO ]: detected not equals via solver [2018-06-22 12:19:57,887 INFO ]: detected not equals via solver [2018-06-22 12:19:57,888 INFO ]: detected not equals via solver [2018-06-22 12:19:57,889 INFO ]: detected not equals via solver [2018-06-22 12:19:57,889 INFO ]: detected not equals via solver [2018-06-22 12:19:57,890 INFO ]: detected not equals via solver [2018-06-22 12:19:57,891 INFO ]: detected not equals via solver [2018-06-22 12:19:57,891 INFO ]: detected not equals via solver [2018-06-22 12:19:57,892 INFO ]: detected not equals via solver [2018-06-22 12:19:57,893 INFO ]: detected not equals via solver [2018-06-22 12:19:57,893 INFO ]: detected not equals via solver [2018-06-22 12:19:57,894 INFO ]: detected not equals via solver [2018-06-22 12:19:57,894 INFO ]: detected not equals via solver [2018-06-22 12:19:57,895 INFO ]: detected equality via solver [2018-06-22 12:19:57,895 INFO ]: detected not equals via solver [2018-06-22 12:19:57,896 INFO ]: detected equality via solver [2018-06-22 12:19:57,896 INFO ]: detected not equals via solver [2018-06-22 12:19:57,897 INFO ]: detected not equals via solver [2018-06-22 12:19:57,928 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 626 treesize of output 629 [2018-06-22 12:19:58,068 WARN ]: Spent 138.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2018-06-22 12:19:58,070 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:58,070 INFO ]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,074 INFO ]: detected not equals via solver [2018-06-22 12:19:58,075 INFO ]: detected not equals via solver [2018-06-22 12:19:58,076 INFO ]: detected not equals via solver [2018-06-22 12:19:58,076 INFO ]: detected not equals via solver [2018-06-22 12:19:58,077 INFO ]: detected not equals via solver [2018-06-22 12:19:58,077 INFO ]: detected not equals via solver [2018-06-22 12:19:58,077 INFO ]: detected equality via solver [2018-06-22 12:19:58,078 INFO ]: detected not equals via solver [2018-06-22 12:19:58,079 INFO ]: detected not equals via solver [2018-06-22 12:19:58,079 INFO ]: detected not equals via solver [2018-06-22 12:19:58,080 INFO ]: detected equality via solver [2018-06-22 12:19:58,080 INFO ]: detected not equals via solver [2018-06-22 12:19:58,081 INFO ]: detected not equals via solver [2018-06-22 12:19:58,081 INFO ]: detected not equals via solver [2018-06-22 12:19:58,082 INFO ]: detected not equals via solver [2018-06-22 12:19:58,082 INFO ]: detected not equals via solver [2018-06-22 12:19:58,083 INFO ]: detected not equals via solver [2018-06-22 12:19:58,083 INFO ]: detected not equals via solver [2018-06-22 12:19:58,106 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 401 [2018-06-22 12:19:58,240 WARN ]: Spent 132.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2018-06-22 12:19:58,243 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:58,243 INFO ]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,246 INFO ]: detected not equals via solver [2018-06-22 12:19:58,247 INFO ]: detected not equals via solver [2018-06-22 12:19:58,248 INFO ]: detected not equals via solver [2018-06-22 12:19:58,248 INFO ]: detected not equals via solver [2018-06-22 12:19:58,249 INFO ]: detected not equals via solver [2018-06-22 12:19:58,249 INFO ]: detected not equals via solver [2018-06-22 12:19:58,250 INFO ]: detected not equals via solver [2018-06-22 12:19:58,250 INFO ]: detected not equals via solver [2018-06-22 12:19:58,251 INFO ]: detected not equals via solver [2018-06-22 12:19:58,252 INFO ]: detected not equals via solver [2018-06-22 12:19:58,252 INFO ]: detected not equals via solver [2018-06-22 12:19:58,253 INFO ]: detected not equals via solver [2018-06-22 12:19:58,253 INFO ]: detected not equals via solver [2018-06-22 12:19:58,254 INFO ]: detected not equals via solver [2018-06-22 12:19:58,254 INFO ]: detected not equals via solver [2018-06-22 12:19:58,255 INFO ]: detected not equals via solver [2018-06-22 12:19:58,255 INFO ]: detected not equals via solver [2018-06-22 12:19:58,256 INFO ]: detected not equals via solver [2018-06-22 12:19:58,256 INFO ]: detected not equals via solver [2018-06-22 12:19:58,257 INFO ]: detected not equals via solver [2018-06-22 12:19:58,258 INFO ]: detected not equals via solver [2018-06-22 12:19:58,258 INFO ]: detected not equals via solver [2018-06-22 12:19:58,259 INFO ]: detected not equals via solver [2018-06-22 12:19:58,259 INFO ]: detected not equals via solver [2018-06-22 12:19:58,260 INFO ]: detected not equals via solver [2018-06-22 12:19:58,260 INFO ]: detected not equals via solver [2018-06-22 12:19:58,261 INFO ]: detected not equals via solver [2018-06-22 12:19:58,261 INFO ]: detected equality via solver [2018-06-22 12:19:58,283 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 395 [2018-06-22 12:19:58,640 WARN ]: Spent 353.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 121 [2018-06-22 12:19:58,644 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:58,644 INFO ]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,647 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:58,647 INFO ]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,658 INFO ]: detected not equals via solver [2018-06-22 12:19:58,659 INFO ]: detected not equals via solver [2018-06-22 12:19:58,659 INFO ]: detected not equals via solver [2018-06-22 12:19:58,659 INFO ]: detected equality via solver [2018-06-22 12:19:58,660 INFO ]: detected not equals via solver [2018-06-22 12:19:58,660 INFO ]: detected not equals via solver [2018-06-22 12:19:58,661 INFO ]: detected not equals via solver [2018-06-22 12:19:58,661 INFO ]: detected not equals via solver [2018-06-22 12:19:58,662 INFO ]: detected not equals via solver [2018-06-22 12:19:58,662 INFO ]: detected not equals via solver [2018-06-22 12:19:58,663 INFO ]: detected not equals via solver [2018-06-22 12:19:58,663 INFO ]: detected not equals via solver [2018-06-22 12:19:58,664 INFO ]: detected not equals via solver [2018-06-22 12:19:58,664 INFO ]: detected not equals via solver [2018-06-22 12:19:58,665 INFO ]: detected not equals via solver [2018-06-22 12:19:58,665 INFO ]: detected not equals via solver [2018-06-22 12:19:58,666 INFO ]: detected not equals via solver [2018-06-22 12:19:58,666 INFO ]: detected not equals via solver [2018-06-22 12:19:58,667 INFO ]: detected not equals via solver [2018-06-22 12:19:58,667 INFO ]: detected not equals via solver [2018-06-22 12:19:58,668 INFO ]: detected equality via solver [2018-06-22 12:19:58,668 INFO ]: detected not equals via solver [2018-06-22 12:19:58,669 INFO ]: detected not equals via solver [2018-06-22 12:19:58,669 INFO ]: detected not equals via solver [2018-06-22 12:19:58,670 INFO ]: detected not equals via solver [2018-06-22 12:19:58,670 INFO ]: detected not equals via solver [2018-06-22 12:19:58,671 INFO ]: detected not equals via solver [2018-06-22 12:19:58,671 INFO ]: detected not equals via solver [2018-06-22 12:19:58,672 INFO ]: detected not equals via solver [2018-06-22 12:19:58,672 INFO ]: detected equality via solver [2018-06-22 12:19:58,672 INFO ]: detected not equals via solver [2018-06-22 12:19:58,673 INFO ]: detected not equals via solver [2018-06-22 12:19:58,673 INFO ]: detected equality via solver [2018-06-22 12:19:58,673 INFO ]: detected equality via solver [2018-06-22 12:19:58,710 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 329 [2018-06-22 12:19:58,711 INFO ]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,714 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:58,714 INFO ]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,717 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:58,717 INFO ]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,732 WARN ]: Array PQE input equivalent to false [2018-06-22 12:19:58,732 INFO ]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,824 INFO ]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,838 INFO ]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,848 INFO ]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,855 INFO ]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,858 INFO ]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,875 INFO ]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 12:19:58,875 INFO ]: Needed 16 recursive calls to eliminate 8 variables, input treesize:3264, output treesize:3 [2018-06-22 12:19:58,941 INFO ]: Checked inductivity of 133 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 49 trivial. 12 not checked. [2018-06-22 12:19:58,961 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:19:58,961 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 42 [2018-06-22 12:19:58,961 INFO ]: Interpolant automaton has 42 states [2018-06-22 12:19:58,962 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 12:19:58,962 INFO ]: CoverageRelationStatistics Valid=143, Invalid=1484, Unknown=17, NotChecked=78, Total=1722 [2018-06-22 12:19:58,962 INFO ]: Start difference. First operand 49 states and 55 transitions. Second operand 42 states. [2018-06-22 12:20:02,774 WARN ]: Spent 119.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 66 [2018-06-22 12:20:04,558 WARN ]: Spent 260.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 91 [2018-06-22 12:20:05,092 WARN ]: Spent 220.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 96 [2018-06-22 12:20:05,752 WARN ]: Spent 358.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 113 [2018-06-22 12:20:06,625 WARN ]: Spent 544.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 133 Received shutdown request... [2018-06-22 12:20:06,826 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 12:20:06,826 WARN ]: Verification canceled [2018-06-22 12:20:06,829 WARN ]: Timeout [2018-06-22 12:20:06,830 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:20:06 BoogieIcfgContainer [2018-06-22 12:20:06,830 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 12:20:06,830 INFO ]: Toolchain (without parser) took 60073.93 ms. Allocated memory was 309.3 MB in the beginning and 782.2 MB in the end (delta: 472.9 MB). Free memory was 265.7 MB in the beginning and 434.0 MB in the end (delta: -168.3 MB). Peak memory consumption was 304.6 MB. Max. memory is 3.6 GB. [2018-06-22 12:20:06,831 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 12:20:06,831 INFO ]: ChcToBoogie took 52.10 ms. Allocated memory is still 309.3 MB. Free memory was 264.7 MB in the beginning and 262.7 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:20:06,832 INFO ]: Boogie Preprocessor took 42.05 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 261.7 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:20:06,832 INFO ]: RCFGBuilder took 341.58 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 252.7 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:20:06,832 INFO ]: TraceAbstraction took 59621.01 ms. Allocated memory was 309.3 MB in the beginning and 782.2 MB in the end (delta: 472.9 MB). Free memory was 252.7 MB in the beginning and 434.0 MB in the end (delta: -181.3 MB). Peak memory consumption was 291.6 MB. Max. memory is 3.6 GB. [2018-06-22 12:20:06,834 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 52.10 ms. Allocated memory is still 309.3 MB. Free memory was 264.7 MB in the beginning and 262.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.05 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 261.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 341.58 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 252.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59621.01 ms. Allocated memory was 309.3 MB in the beginning and 782.2 MB in the end (delta: 472.9 MB). Free memory was 252.7 MB in the beginning and 434.0 MB in the end (delta: -181.3 MB). Peak memory consumption was 291.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (49states) and interpolant automaton (currently 29 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 59.5s OverallTime, 21 OverallIterations, 7 TraceHistogramMax, 22.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 475 SDtfs, 316 SDslu, 4154 SDs, 0 SdLazy, 4378 SolverSat, 495 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1166 GetRequests, 582 SyntacticMatches, 31 SemanticMatches, 552 ConstructedPredicates, 11 IntricatePredicates, 3 DeprecatedPredicates, 3832 ImplicationChecksByTransitivity, 30.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=18, 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.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 102 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 35.2s InterpolantComputationTime, 1354 NumberOfCodeBlocks, 1350 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1316 ConstructedInterpolants, 67 QuantifiedInterpolants, 1604948 SizeOfPredicates, 230 NumberOfNonLiveVariables, 3438 ConjunctsInSsa, 863 ConjunctsInUnsatCore, 38 InterpolantComputations, 5 PerfectInterpolantSequences, 1116/1923 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/shiftByOne.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_12-20-06-845.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/shiftByOne.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_12-20-06-845.csv Completed graceful shutdown