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/smt2/arrays/libc__memccpy_1.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:43:09,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:43:09,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:43:09,755 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:43:09,756 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:43:09,761 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:43:09,763 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:43:09,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:43:09,770 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:43:09,772 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:43:09,776 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:43:09,776 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:43:09,777 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:43:09,783 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:43:09,784 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:43:09,786 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:43:09,788 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:43:09,791 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:43:09,793 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:43:09,795 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:43:09,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:43:09,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:43:09,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:43:09,801 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:43:09,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:43:09,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:43:09,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:43:09,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:43:09,807 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:43:09,807 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:43:09,808 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:43:09,809 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:43:09,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:43:09,856 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:43:09,856 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:43:09,857 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 11:43:09,876 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:43:09,876 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:43:09,876 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:43:09,877 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:43:09,878 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:43:09,878 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:43:09,878 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:43:09,878 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:43:09,879 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:43:09,879 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:43:09,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:43:09,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:43:09,879 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:43:09,880 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:43:09,880 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:43:09,880 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:43:09,880 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:43:09,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:43:09,881 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:43:09,882 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:43:09,882 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:43:09,934 INFO ]: Repository-Root is: /tmp [2018-06-22 11:43:09,951 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:43:09,956 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:43:09,957 INFO ]: Initializing SmtParser... [2018-06-22 11:43:09,958 INFO ]: SmtParser initialized [2018-06-22 11:43:09,958 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__memccpy_1.array.smt2 [2018-06-22 11:43:09,960 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 11:43:10,049 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__memccpy_1.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@3a2ceef5 [2018-06-22 11:43:10,339 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__memccpy_1.array.smt2 [2018-06-22 11:43:10,345 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:43:10,350 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:43:10,351 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:43:10,351 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:43:10,351 INFO ]: ChcToBoogie initialized [2018-06-22 11:43:10,354 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:43:10" (1/1) ... [2018-06-22 11:43:10,412 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:10 Unit [2018-06-22 11:43:10,413 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:43:10,413 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:43:10,413 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:43:10,413 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:43:10,436 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:10" (1/1) ... [2018-06-22 11:43:10,436 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:10" (1/1) ... [2018-06-22 11:43:10,448 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:10" (1/1) ... [2018-06-22 11:43:10,448 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:10" (1/1) ... [2018-06-22 11:43:10,465 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:10" (1/1) ... [2018-06-22 11:43:10,467 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:10" (1/1) ... [2018-06-22 11:43:10,468 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:10" (1/1) ... [2018-06-22 11:43:10,470 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:43:10,477 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:43:10,477 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:43:10,477 INFO ]: RCFGBuilder initialized [2018-06-22 11:43:10,478 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:10" (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 11:43:10,496 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:43:10,496 INFO ]: Found specification of procedure False [2018-06-22 11:43:10,496 INFO ]: Found implementation of procedure False [2018-06-22 11:43:10,496 INFO ]: Specification and implementation of procedure INV_MAIN_0 given in one single declaration [2018-06-22 11:43:10,496 INFO ]: Found specification of procedure INV_MAIN_0 [2018-06-22 11:43:10,496 INFO ]: Found implementation of procedure INV_MAIN_0 [2018-06-22 11:43:10,496 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:43:10,496 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:43:10,496 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 11:43:10,965 INFO ]: Using library mode [2018-06-22 11:43:10,965 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:43:10 BoogieIcfgContainer [2018-06-22 11:43:10,966 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:43:10,967 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:43:10,967 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:43:10,971 INFO ]: TraceAbstraction initialized [2018-06-22 11:43:10,971 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:43:10" (1/3) ... [2018-06-22 11:43:10,972 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244ae245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:43:10, skipping insertion in model container [2018-06-22 11:43:10,972 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:10" (2/3) ... [2018-06-22 11:43:10,972 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244ae245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:43:10, skipping insertion in model container [2018-06-22 11:43:10,972 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:43:10" (3/3) ... [2018-06-22 11:43:10,974 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:43:10,983 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:43:10,991 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:43:11,035 INFO ]: Using default assertion order modulation [2018-06-22 11:43:11,122 INFO ]: Interprodecural is true [2018-06-22 11:43:11,123 INFO ]: Hoare is false [2018-06-22 11:43:11,123 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:43:11,123 INFO ]: Backedges is TWOTRACK [2018-06-22 11:43:11,123 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:43:11,123 INFO ]: Difference is false [2018-06-22 11:43:11,123 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:43:11,123 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:43:11,136 INFO ]: Start isEmpty. Operand 18 states. [2018-06-22 11:43:11,150 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:43:11,150 INFO ]: Found error trace [2018-06-22 11:43:11,151 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:43:11,151 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:11,156 INFO ]: Analyzing trace with hash 103178342, now seen corresponding path program 1 times [2018-06-22 11:43:11,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:11,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:11,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:11,193 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:11,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:11,206 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:11,225 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:11,227 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:11,227 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:43:11,229 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:43:11,241 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:43:11,242 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:43:11,245 INFO ]: Start difference. First operand 18 states. Second operand 2 states. [2018-06-22 11:43:11,264 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:11,265 INFO ]: Finished difference Result 16 states and 27 transitions. [2018-06-22 11:43:11,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:43:11,267 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:43:11,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:11,276 INFO ]: With dead ends: 16 [2018-06-22 11:43:11,276 INFO ]: Without dead ends: 16 [2018-06-22 11:43:11,278 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:43:11,295 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 11:43:11,329 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 11:43:11,330 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 11:43:11,331 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-06-22 11:43:11,332 INFO ]: Start accepts. Automaton has 16 states and 27 transitions. Word has length 5 [2018-06-22 11:43:11,335 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:11,335 INFO ]: Abstraction has 16 states and 27 transitions. [2018-06-22 11:43:11,335 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:43:11,335 INFO ]: Start isEmpty. Operand 16 states and 27 transitions. [2018-06-22 11:43:11,337 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:43:11,337 INFO ]: Found error trace [2018-06-22 11:43:11,337 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:11,337 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:11,337 INFO ]: Analyzing trace with hash 1522743641, now seen corresponding path program 1 times [2018-06-22 11:43:11,337 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:11,337 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:11,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:11,338 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:11,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:11,371 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:11,459 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:11,459 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:11,459 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:11,460 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:11,460 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:11,460 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:11,461 INFO ]: Start difference. First operand 16 states and 27 transitions. Second operand 4 states. [2018-06-22 11:43:11,701 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:11,701 INFO ]: Finished difference Result 20 states and 36 transitions. [2018-06-22 11:43:11,702 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:11,702 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:43:11,702 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:11,703 INFO ]: With dead ends: 20 [2018-06-22 11:43:11,703 INFO ]: Without dead ends: 20 [2018-06-22 11:43:11,703 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 11:43:11,703 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:43:11,712 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:43:11,712 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:43:11,713 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2018-06-22 11:43:11,713 INFO ]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 9 [2018-06-22 11:43:11,714 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:11,714 INFO ]: Abstraction has 18 states and 34 transitions. [2018-06-22 11:43:11,714 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:11,714 INFO ]: Start isEmpty. Operand 18 states and 34 transitions. [2018-06-22 11:43:11,715 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:43:11,715 INFO ]: Found error trace [2018-06-22 11:43:11,715 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:11,715 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:11,716 INFO ]: Analyzing trace with hash -96080521, now seen corresponding path program 1 times [2018-06-22 11:43:11,716 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:11,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:11,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:11,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:11,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:11,745 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:12,237 WARN ]: Spent 312.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 22 [2018-06-22 11:43:12,259 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:12,259 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:12,260 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:12,260 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:12,260 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:12,260 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:12,260 INFO ]: Start difference. First operand 18 states and 34 transitions. Second operand 4 states. [2018-06-22 11:43:12,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:12,576 INFO ]: Finished difference Result 20 states and 35 transitions. [2018-06-22 11:43:12,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:12,576 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:43:12,577 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:12,577 INFO ]: With dead ends: 20 [2018-06-22 11:43:12,578 INFO ]: Without dead ends: 20 [2018-06-22 11:43:12,578 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:12,578 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:43:12,583 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:43:12,583 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:43:12,584 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-06-22 11:43:12,584 INFO ]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 9 [2018-06-22 11:43:12,584 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:12,584 INFO ]: Abstraction has 18 states and 33 transitions. [2018-06-22 11:43:12,584 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:12,584 INFO ]: Start isEmpty. Operand 18 states and 33 transitions. [2018-06-22 11:43:12,585 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:43:12,585 INFO ]: Found error trace [2018-06-22 11:43:12,585 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:12,585 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:12,586 INFO ]: Analyzing trace with hash -873039628, now seen corresponding path program 1 times [2018-06-22 11:43:12,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:12,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:12,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:12,586 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:12,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:12,598 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:12,939 WARN ]: Spent 288.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-22 11:43:13,046 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:13,049 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:13,049 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:13,049 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:13,049 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:13,050 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:13,050 INFO ]: Start difference. First operand 18 states and 33 transitions. Second operand 4 states. [2018-06-22 11:43:13,220 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:13,220 INFO ]: Finished difference Result 20 states and 34 transitions. [2018-06-22 11:43:13,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:13,221 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:43:13,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:13,222 INFO ]: With dead ends: 20 [2018-06-22 11:43:13,222 INFO ]: Without dead ends: 20 [2018-06-22 11:43:13,222 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:13,222 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:43:13,227 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:43:13,227 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:43:13,228 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2018-06-22 11:43:13,228 INFO ]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 9 [2018-06-22 11:43:13,228 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:13,228 INFO ]: Abstraction has 18 states and 32 transitions. [2018-06-22 11:43:13,228 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:13,228 INFO ]: Start isEmpty. Operand 18 states and 32 transitions. [2018-06-22 11:43:13,229 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:43:13,229 INFO ]: Found error trace [2018-06-22 11:43:13,229 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:13,229 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:13,229 INFO ]: Analyzing trace with hash 1242252866, now seen corresponding path program 1 times [2018-06-22 11:43:13,229 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:13,229 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:13,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:13,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:13,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:13,239 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:13,442 WARN ]: Spent 163.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-06-22 11:43:13,526 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:13,526 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:13,527 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:13,527 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:13,527 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:13,527 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:13,527 INFO ]: Start difference. First operand 18 states and 32 transitions. Second operand 4 states. [2018-06-22 11:43:13,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:13,663 INFO ]: Finished difference Result 20 states and 33 transitions. [2018-06-22 11:43:13,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:13,664 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:43:13,664 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:13,665 INFO ]: With dead ends: 20 [2018-06-22 11:43:13,665 INFO ]: Without dead ends: 20 [2018-06-22 11:43:13,665 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:13,665 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:43:13,669 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:43:13,669 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:43:13,670 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2018-06-22 11:43:13,670 INFO ]: Start accepts. Automaton has 18 states and 31 transitions. Word has length 9 [2018-06-22 11:43:13,670 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:13,670 INFO ]: Abstraction has 18 states and 31 transitions. [2018-06-22 11:43:13,670 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:13,670 INFO ]: Start isEmpty. Operand 18 states and 31 transitions. [2018-06-22 11:43:13,671 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:13,671 INFO ]: Found error trace [2018-06-22 11:43:13,671 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:13,671 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:13,672 INFO ]: Analyzing trace with hash 1651847941, now seen corresponding path program 1 times [2018-06-22 11:43:13,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:13,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:13,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:13,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:13,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:13,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:13,792 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:13,792 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:13,792 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 11:43:13,801 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:13,834 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:13,844 INFO ]: Computing forward predicates... [2018-06-22 11:43:14,012 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-06-22 11:43:14,013 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:14,025 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:43:14,025 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-06-22 11:43:14,274 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-22 11:43:14,432 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:14,465 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:14,465 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:43:14,465 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:43:14,466 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:43:14,466 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:14,466 INFO ]: Start difference. First operand 18 states and 31 transitions. Second operand 9 states. [2018-06-22 11:43:14,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:14,985 INFO ]: Finished difference Result 26 states and 53 transitions. [2018-06-22 11:43:14,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:43:14,985 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:43:14,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:14,986 INFO ]: With dead ends: 26 [2018-06-22 11:43:14,986 INFO ]: Without dead ends: 26 [2018-06-22 11:43:14,986 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:43:14,986 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:43:14,992 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-06-22 11:43:14,992 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:43:14,993 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-06-22 11:43:14,993 INFO ]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 13 [2018-06-22 11:43:14,993 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:14,993 INFO ]: Abstraction has 20 states and 37 transitions. [2018-06-22 11:43:14,993 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:43:14,993 INFO ]: Start isEmpty. Operand 20 states and 37 transitions. [2018-06-22 11:43:14,994 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:14,994 INFO ]: Found error trace [2018-06-22 11:43:14,994 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:14,994 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:14,994 INFO ]: Analyzing trace with hash 155754471, now seen corresponding path program 1 times [2018-06-22 11:43:14,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:14,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:14,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:14,996 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:14,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:15,013 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:15,083 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:15,083 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:15,084 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:43:15,084 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:43:15,084 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:43:15,084 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:15,084 INFO ]: Start difference. First operand 20 states and 37 transitions. Second operand 6 states. [2018-06-22 11:43:15,350 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:15,350 INFO ]: Finished difference Result 24 states and 46 transitions. [2018-06-22 11:43:15,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:15,353 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:43:15,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:15,354 INFO ]: With dead ends: 24 [2018-06-22 11:43:15,354 INFO ]: Without dead ends: 24 [2018-06-22 11:43:15,354 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:15,354 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:43:15,359 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-06-22 11:43:15,359 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:43:15,359 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 36 transitions. [2018-06-22 11:43:15,360 INFO ]: Start accepts. Automaton has 20 states and 36 transitions. Word has length 13 [2018-06-22 11:43:15,360 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:15,360 INFO ]: Abstraction has 20 states and 36 transitions. [2018-06-22 11:43:15,360 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:43:15,360 INFO ]: Start isEmpty. Operand 20 states and 36 transitions. [2018-06-22 11:43:15,361 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:15,361 INFO ]: Found error trace [2018-06-22 11:43:15,361 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:15,361 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:15,361 INFO ]: Analyzing trace with hash 1502292226, now seen corresponding path program 1 times [2018-06-22 11:43:15,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:15,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:15,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:15,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:15,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:15,371 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:15,477 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:15,477 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:15,477 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 11:43:15,483 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:15,518 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:15,520 INFO ]: Computing forward predicates... [2018-06-22 11:43:15,590 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:15,620 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:15,620 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:43:15,621 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:43:15,621 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:43:15,621 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:15,622 INFO ]: Start difference. First operand 20 states and 36 transitions. Second operand 6 states. [2018-06-22 11:43:15,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:15,706 INFO ]: Finished difference Result 24 states and 45 transitions. [2018-06-22 11:43:15,709 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:15,709 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:43:15,709 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:15,710 INFO ]: With dead ends: 24 [2018-06-22 11:43:15,710 INFO ]: Without dead ends: 24 [2018-06-22 11:43:15,710 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:15,710 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:43:15,717 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-06-22 11:43:15,717 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:43:15,718 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2018-06-22 11:43:15,718 INFO ]: Start accepts. Automaton has 18 states and 31 transitions. Word has length 13 [2018-06-22 11:43:15,718 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:15,718 INFO ]: Abstraction has 18 states and 31 transitions. [2018-06-22 11:43:15,718 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:43:15,718 INFO ]: Start isEmpty. Operand 18 states and 31 transitions. [2018-06-22 11:43:15,719 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:15,719 INFO ]: Found error trace [2018-06-22 11:43:15,719 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:15,719 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:15,719 INFO ]: Analyzing trace with hash -89496382, now seen corresponding path program 1 times [2018-06-22 11:43:15,719 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:15,719 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:15,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:15,720 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:15,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:15,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:15,801 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:15,801 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:15,801 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:43:15,801 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:43:15,801 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:43:15,801 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:15,801 INFO ]: Start difference. First operand 18 states and 31 transitions. Second operand 6 states. [2018-06-22 11:43:15,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:15,964 INFO ]: Finished difference Result 26 states and 52 transitions. [2018-06-22 11:43:15,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:15,966 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:43:15,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:15,966 INFO ]: With dead ends: 26 [2018-06-22 11:43:15,966 INFO ]: Without dead ends: 26 [2018-06-22 11:43:15,967 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:15,967 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:43:15,974 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-06-22 11:43:15,974 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:43:15,975 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 42 transitions. [2018-06-22 11:43:15,975 INFO ]: Start accepts. Automaton has 22 states and 42 transitions. Word has length 13 [2018-06-22 11:43:15,975 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:15,975 INFO ]: Abstraction has 22 states and 42 transitions. [2018-06-22 11:43:15,975 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:43:15,975 INFO ]: Start isEmpty. Operand 22 states and 42 transitions. [2018-06-22 11:43:15,976 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:15,976 INFO ]: Found error trace [2018-06-22 11:43:15,976 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:15,976 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:15,976 INFO ]: Analyzing trace with hash -1952365013, now seen corresponding path program 1 times [2018-06-22 11:43:15,976 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:15,976 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:15,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:16,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:16,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:16,044 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:16,324 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-06-22 11:43:16,339 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:16,339 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:16,339 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 11:43:16,346 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:16,359 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:16,360 INFO ]: Computing forward predicates... [2018-06-22 11:43:16,398 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:16,418 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:16,418 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:43:16,418 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:43:16,419 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:43:16,419 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:16,419 INFO ]: Start difference. First operand 22 states and 42 transitions. Second operand 6 states. [2018-06-22 11:43:16,495 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:16,495 INFO ]: Finished difference Result 26 states and 51 transitions. [2018-06-22 11:43:16,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:16,498 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:43:16,498 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:16,499 INFO ]: With dead ends: 26 [2018-06-22 11:43:16,499 INFO ]: Without dead ends: 26 [2018-06-22 11:43:16,499 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:16,499 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:43:16,505 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-06-22 11:43:16,505 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:43:16,506 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2018-06-22 11:43:16,506 INFO ]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 13 [2018-06-22 11:43:16,506 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:16,506 INFO ]: Abstraction has 22 states and 41 transitions. [2018-06-22 11:43:16,506 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:43:16,506 INFO ]: Start isEmpty. Operand 22 states and 41 transitions. [2018-06-22 11:43:16,507 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:16,507 INFO ]: Found error trace [2018-06-22 11:43:16,507 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:16,507 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:16,508 INFO ]: Analyzing trace with hash 1406597088, now seen corresponding path program 1 times [2018-06-22 11:43:16,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:16,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:16,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:16,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:16,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:16,538 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:17,012 WARN ]: Spent 143.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2018-06-22 11:43:17,013 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:17,013 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:17,013 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 11:43:17,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:17,066 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:17,069 INFO ]: Computing forward predicates... [2018-06-22 11:43:17,158 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-06-22 11:43:17,159 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:17,183 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-06-22 11:43:17,183 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-06-22 11:43:17,240 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:17,259 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:17,259 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:43:17,259 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:17,259 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:17,259 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:17,260 INFO ]: Start difference. First operand 22 states and 41 transitions. Second operand 8 states. [2018-06-22 11:43:17,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:17,943 INFO ]: Finished difference Result 26 states and 50 transitions. [2018-06-22 11:43:17,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:17,943 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:43:17,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:17,943 INFO ]: With dead ends: 26 [2018-06-22 11:43:17,943 INFO ]: Without dead ends: 26 [2018-06-22 11:43:17,944 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:43:17,944 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:43:17,948 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-06-22 11:43:17,948 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:43:17,948 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2018-06-22 11:43:17,948 INFO ]: Start accepts. Automaton has 22 states and 40 transitions. Word has length 13 [2018-06-22 11:43:17,948 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:17,948 INFO ]: Abstraction has 22 states and 40 transitions. [2018-06-22 11:43:17,948 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:17,949 INFO ]: Start isEmpty. Operand 22 states and 40 transitions. [2018-06-22 11:43:17,950 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:17,950 INFO ]: Found error trace [2018-06-22 11:43:17,950 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:17,950 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:17,950 INFO ]: Analyzing trace with hash 1257041373, now seen corresponding path program 1 times [2018-06-22 11:43:17,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:17,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:17,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:17,951 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:17,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:17,960 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:18,024 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:18,024 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:18,024 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 11:43:18,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:18,050 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:18,052 INFO ]: Computing forward predicates... [2018-06-22 11:43:18,095 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-06-22 11:43:18,096 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:18,104 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-06-22 11:43:18,104 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-06-22 11:43:18,182 INFO ]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:18,182 INFO ]: Needed 1 recursive calls to eliminate 2 variables, input treesize:23, output treesize:3 [2018-06-22 11:43:18,192 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:18,211 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:18,211 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:43:18,211 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:43:18,211 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:43:18,211 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:43:18,211 INFO ]: Start difference. First operand 22 states and 40 transitions. Second operand 10 states. [2018-06-22 11:43:18,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:18,487 INFO ]: Finished difference Result 32 states and 63 transitions. [2018-06-22 11:43:18,487 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:43:18,487 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:43:18,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:18,488 INFO ]: With dead ends: 32 [2018-06-22 11:43:18,488 INFO ]: Without dead ends: 32 [2018-06-22 11:43:18,488 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:43:18,488 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:43:18,494 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-06-22 11:43:18,494 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:43:18,495 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 45 transitions. [2018-06-22 11:43:18,495 INFO ]: Start accepts. Automaton has 24 states and 45 transitions. Word has length 13 [2018-06-22 11:43:18,495 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:18,495 INFO ]: Abstraction has 24 states and 45 transitions. [2018-06-22 11:43:18,495 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:43:18,495 INFO ]: Start isEmpty. Operand 24 states and 45 transitions. [2018-06-22 11:43:18,496 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:18,496 INFO ]: Found error trace [2018-06-22 11:43:18,496 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:18,496 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:18,496 INFO ]: Analyzing trace with hash -334747235, now seen corresponding path program 1 times [2018-06-22 11:43:18,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:18,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:18,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:18,497 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:18,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:18,505 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:18,783 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2018-06-22 11:43:18,798 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:18,798 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:18,798 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:18,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:18,836 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:18,838 INFO ]: Computing forward predicates... [2018-06-22 11:43:18,959 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-06-22 11:43:18,959 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:18,965 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:43:18,965 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-06-22 11:43:18,983 INFO ]: detected not equals via solver [2018-06-22 11:43:18,983 INFO ]: detected not equals via solver [2018-06-22 11:43:19,018 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2018-06-22 11:43:19,047 INFO ]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-06-22 11:43:19,067 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-06-22 11:43:19,067 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:36 [2018-06-22 11:43:19,079 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:19,097 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:19,098 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:43:19,098 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:19,098 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:19,098 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:19,098 INFO ]: Start difference. First operand 24 states and 45 transitions. Second operand 8 states. [2018-06-22 11:43:19,237 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:19,237 INFO ]: Finished difference Result 30 states and 62 transitions. [2018-06-22 11:43:19,237 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:19,237 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:43:19,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:19,238 INFO ]: With dead ends: 30 [2018-06-22 11:43:19,238 INFO ]: Without dead ends: 30 [2018-06-22 11:43:19,239 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:19,239 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:43:19,244 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-06-22 11:43:19,244 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:43:19,244 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 52 transitions. [2018-06-22 11:43:19,244 INFO ]: Start accepts. Automaton has 26 states and 52 transitions. Word has length 13 [2018-06-22 11:43:19,245 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:19,245 INFO ]: Abstraction has 26 states and 52 transitions. [2018-06-22 11:43:19,245 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:19,245 INFO ]: Start isEmpty. Operand 26 states and 52 transitions. [2018-06-22 11:43:19,245 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:19,245 INFO ]: Found error trace [2018-06-22 11:43:19,245 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:19,246 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:19,246 INFO ]: Analyzing trace with hash 1161346235, now seen corresponding path program 1 times [2018-06-22 11:43:19,246 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:19,246 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:19,246 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:19,246 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:19,246 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:19,267 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:19,449 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:19,449 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:19,449 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:43:19,449 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:43:19,449 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:43:19,449 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:43:19,450 INFO ]: Start difference. First operand 26 states and 52 transitions. Second operand 5 states. [2018-06-22 11:43:19,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:19,617 INFO ]: Finished difference Result 32 states and 68 transitions. [2018-06-22 11:43:19,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:19,617 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:43:19,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:19,618 INFO ]: With dead ends: 32 [2018-06-22 11:43:19,618 INFO ]: Without dead ends: 32 [2018-06-22 11:43:19,618 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:19,618 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:43:19,624 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-06-22 11:43:19,624 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:43:19,625 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2018-06-22 11:43:19,625 INFO ]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 13 [2018-06-22 11:43:19,626 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:19,626 INFO ]: Abstraction has 28 states and 58 transitions. [2018-06-22 11:43:19,626 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:43:19,626 INFO ]: Start isEmpty. Operand 28 states and 58 transitions. [2018-06-22 11:43:19,627 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:19,627 INFO ]: Found error trace [2018-06-22 11:43:19,627 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:19,627 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:19,627 INFO ]: Analyzing trace with hash 1011790520, now seen corresponding path program 1 times [2018-06-22 11:43:19,627 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:19,627 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:19,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:19,628 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:19,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:19,636 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:20,214 WARN ]: Spent 548.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-22 11:43:20,246 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:20,246 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:20,246 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:43:20,246 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:43:20,246 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:43:20,246 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:43:20,246 INFO ]: Start difference. First operand 28 states and 58 transitions. Second operand 5 states. [2018-06-22 11:43:20,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:20,336 INFO ]: Finished difference Result 32 states and 66 transitions. [2018-06-22 11:43:20,336 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:20,336 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:43:20,336 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:20,337 INFO ]: With dead ends: 32 [2018-06-22 11:43:20,337 INFO ]: Without dead ends: 32 [2018-06-22 11:43:20,337 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:20,337 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:43:20,342 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-06-22 11:43:20,342 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:43:20,342 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 56 transitions. [2018-06-22 11:43:20,342 INFO ]: Start accepts. Automaton has 28 states and 56 transitions. Word has length 13 [2018-06-22 11:43:20,343 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:20,343 INFO ]: Abstraction has 28 states and 56 transitions. [2018-06-22 11:43:20,343 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:43:20,343 INFO ]: Start isEmpty. Operand 28 states and 56 transitions. [2018-06-22 11:43:20,343 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:20,343 INFO ]: Found error trace [2018-06-22 11:43:20,343 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:20,343 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:20,344 INFO ]: Analyzing trace with hash 2097351430, now seen corresponding path program 1 times [2018-06-22 11:43:20,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:20,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:20,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:20,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:20,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:20,356 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:20,448 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:20,448 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:20,448 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:43:20,448 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:43:20,449 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:43:20,449 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:43:20,449 INFO ]: Start difference. First operand 28 states and 56 transitions. Second operand 5 states. [2018-06-22 11:43:20,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:20,525 INFO ]: Finished difference Result 32 states and 64 transitions. [2018-06-22 11:43:20,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:20,525 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:43:20,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:20,526 INFO ]: With dead ends: 32 [2018-06-22 11:43:20,526 INFO ]: Without dead ends: 32 [2018-06-22 11:43:20,526 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:20,526 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:43:20,531 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-06-22 11:43:20,531 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:43:20,531 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2018-06-22 11:43:20,531 INFO ]: Start accepts. Automaton has 28 states and 54 transitions. Word has length 13 [2018-06-22 11:43:20,532 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:20,532 INFO ]: Abstraction has 28 states and 54 transitions. [2018-06-22 11:43:20,532 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:43:20,532 INFO ]: Start isEmpty. Operand 28 states and 54 transitions. [2018-06-22 11:43:20,532 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:20,532 INFO ]: Found error trace [2018-06-22 11:43:20,532 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:20,532 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:20,533 INFO ]: Analyzing trace with hash 63709166, now seen corresponding path program 1 times [2018-06-22 11:43:20,533 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:20,533 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:20,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:20,533 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:20,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:20,542 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:20,673 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:20,673 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:20,673 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:20,673 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:20,673 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:20,673 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:20,674 INFO ]: Start difference. First operand 28 states and 54 transitions. Second operand 4 states. [2018-06-22 11:43:20,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:20,776 INFO ]: Finished difference Result 45 states and 92 transitions. [2018-06-22 11:43:20,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:43:20,778 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:43:20,778 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:20,779 INFO ]: With dead ends: 45 [2018-06-22 11:43:20,779 INFO ]: Without dead ends: 45 [2018-06-22 11:43:20,779 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:43:20,779 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:43:20,786 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-06-22 11:43:20,787 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:43:20,787 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 79 transitions. [2018-06-22 11:43:20,787 INFO ]: Start accepts. Automaton has 39 states and 79 transitions. Word has length 17 [2018-06-22 11:43:20,787 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:20,788 INFO ]: Abstraction has 39 states and 79 transitions. [2018-06-22 11:43:20,788 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:20,788 INFO ]: Start isEmpty. Operand 39 states and 79 transitions. [2018-06-22 11:43:20,793 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:20,793 INFO ]: Found error trace [2018-06-22 11:43:20,793 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:20,793 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:20,794 INFO ]: Analyzing trace with hash 1301335625, now seen corresponding path program 1 times [2018-06-22 11:43:20,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:20,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:20,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:20,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:20,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:20,798 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:20,837 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:20,837 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:20,837 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:20,837 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:20,837 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:20,837 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:20,837 INFO ]: Start difference. First operand 39 states and 79 transitions. Second operand 4 states. [2018-06-22 11:43:20,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:20,933 INFO ]: Finished difference Result 45 states and 86 transitions. [2018-06-22 11:43:20,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:43:20,933 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:43:20,933 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:20,934 INFO ]: With dead ends: 45 [2018-06-22 11:43:20,934 INFO ]: Without dead ends: 41 [2018-06-22 11:43:20,934 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:43:20,934 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:43:20,940 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-06-22 11:43:20,940 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:43:20,941 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 68 transitions. [2018-06-22 11:43:20,941 INFO ]: Start accepts. Automaton has 35 states and 68 transitions. Word has length 17 [2018-06-22 11:43:20,941 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:20,941 INFO ]: Abstraction has 35 states and 68 transitions. [2018-06-22 11:43:20,941 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:20,941 INFO ]: Start isEmpty. Operand 35 states and 68 transitions. [2018-06-22 11:43:20,942 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:20,942 INFO ]: Found error trace [2018-06-22 11:43:20,942 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:20,942 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:20,942 INFO ]: Analyzing trace with hash 281400902, now seen corresponding path program 1 times [2018-06-22 11:43:20,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:20,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:20,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:20,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:20,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:20,948 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:21,005 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:21,005 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:21,005 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:21,006 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:21,006 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:21,006 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:21,006 INFO ]: Start difference. First operand 35 states and 68 transitions. Second operand 7 states. [2018-06-22 11:43:21,152 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:21,152 INFO ]: Finished difference Result 43 states and 81 transitions. [2018-06-22 11:43:21,152 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:43:21,152 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:21,152 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:21,153 INFO ]: With dead ends: 43 [2018-06-22 11:43:21,153 INFO ]: Without dead ends: 43 [2018-06-22 11:43:21,153 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:43:21,153 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:43:21,157 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-06-22 11:43:21,157 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:43:21,158 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 67 transitions. [2018-06-22 11:43:21,158 INFO ]: Start accepts. Automaton has 35 states and 67 transitions. Word has length 17 [2018-06-22 11:43:21,158 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:21,158 INFO ]: Abstraction has 35 states and 67 transitions. [2018-06-22 11:43:21,158 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:21,158 INFO ]: Start isEmpty. Operand 35 states and 67 transitions. [2018-06-22 11:43:21,159 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:21,159 INFO ]: Found error trace [2018-06-22 11:43:21,159 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:21,159 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:21,159 INFO ]: Analyzing trace with hash 1838467172, now seen corresponding path program 1 times [2018-06-22 11:43:21,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:21,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:21,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:21,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:21,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:21,177 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:21,792 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-06-22 11:43:21,845 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:21,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:21,845 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 11:43:21,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:21,868 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:21,871 INFO ]: Computing forward predicates... [2018-06-22 11:43:21,933 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-06-22 11:43:21,933 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:21,939 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:43:21,939 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-06-22 11:43:22,013 INFO ]: detected not equals via solver [2018-06-22 11:43:22,013 INFO ]: detected not equals via solver [2018-06-22 11:43:22,014 INFO ]: detected not equals via solver [2018-06-22 11:43:22,015 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2018-06-22 11:43:22,015 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:22,019 INFO ]: detected not equals via solver [2018-06-22 11:43:22,019 INFO ]: detected not equals via solver [2018-06-22 11:43:22,020 INFO ]: detected not equals via solver [2018-06-22 11:43:22,021 INFO ]: detected not equals via solver [2018-06-22 11:43:22,040 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 77 [2018-06-22 11:43:22,042 INFO ]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-06-22 11:43:22,053 INFO ]: detected not equals via solver [2018-06-22 11:43:22,054 INFO ]: detected not equals via solver [2018-06-22 11:43:22,054 INFO ]: detected not equals via solver [2018-06-22 11:43:22,055 INFO ]: detected not equals via solver [2018-06-22 11:43:22,075 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 78 [2018-06-22 11:43:22,078 INFO ]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-06-22 11:43:22,120 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-06-22 11:43:22,120 INFO ]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:46 [2018-06-22 11:43:22,154 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:22,174 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:22,174 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:43:22,174 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:43:22,174 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:43:22,174 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:43:22,174 INFO ]: Start difference. First operand 35 states and 67 transitions. Second operand 14 states. [2018-06-22 11:43:22,997 WARN ]: Spent 282.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 54 [2018-06-22 11:43:23,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:23,437 INFO ]: Finished difference Result 63 states and 111 transitions. [2018-06-22 11:43:23,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:23,438 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 11:43:23,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:23,438 INFO ]: With dead ends: 63 [2018-06-22 11:43:23,438 INFO ]: Without dead ends: 58 [2018-06-22 11:43:23,439 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:43:23,439 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:43:23,444 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 42. [2018-06-22 11:43:23,444 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:43:23,445 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2018-06-22 11:43:23,445 INFO ]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 17 [2018-06-22 11:43:23,445 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:23,445 INFO ]: Abstraction has 42 states and 73 transitions. [2018-06-22 11:43:23,445 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:43:23,445 INFO ]: Start isEmpty. Operand 42 states and 73 transitions. [2018-06-22 11:43:23,446 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:23,446 INFO ]: Found error trace [2018-06-22 11:43:23,446 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:23,446 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:23,446 INFO ]: Analyzing trace with hash 1137972260, now seen corresponding path program 2 times [2018-06-22 11:43:23,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:23,446 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:23,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:23,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:23,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:23,463 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:24,081 WARN ]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2018-06-22 11:43:24,384 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:24,384 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:24,384 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 11:43:24,390 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:43:24,407 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:43:24,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:24,409 INFO ]: Computing forward predicates... [2018-06-22 11:43:24,450 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-06-22 11:43:24,450 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:24,456 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:43:24,456 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-06-22 11:43:24,510 INFO ]: detected not equals via solver [2018-06-22 11:43:24,511 INFO ]: detected not equals via solver [2018-06-22 11:43:24,536 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 48 [2018-06-22 11:43:24,536 INFO ]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-06-22 11:43:24,558 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-06-22 11:43:24,558 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:56 [2018-06-22 11:43:24,616 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:24,637 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:24,637 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:43:24,637 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:43:24,637 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:43:24,637 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:43:24,638 INFO ]: Start difference. First operand 42 states and 73 transitions. Second operand 11 states. [2018-06-22 11:43:25,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:25,239 INFO ]: Finished difference Result 66 states and 116 transitions. [2018-06-22 11:43:25,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:43:25,239 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:43:25,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:25,240 INFO ]: With dead ends: 66 [2018-06-22 11:43:25,240 INFO ]: Without dead ends: 66 [2018-06-22 11:43:25,240 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:43:25,240 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:43:25,246 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 44. [2018-06-22 11:43:25,246 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:43:25,247 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 78 transitions. [2018-06-22 11:43:25,247 INFO ]: Start accepts. Automaton has 44 states and 78 transitions. Word has length 17 [2018-06-22 11:43:25,247 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:25,247 INFO ]: Abstraction has 44 states and 78 transitions. [2018-06-22 11:43:25,247 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:43:25,247 INFO ]: Start isEmpty. Operand 44 states and 78 transitions. [2018-06-22 11:43:25,248 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:25,248 INFO ]: Found error trace [2018-06-22 11:43:25,248 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:25,248 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:25,248 INFO ]: Analyzing trace with hash 43398305, now seen corresponding path program 1 times [2018-06-22 11:43:25,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:25,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:25,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:25,249 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:25,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:25,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:25,500 WARN ]: Spent 193.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-06-22 11:43:25,864 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:25,864 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:25,864 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 11:43:25,870 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:25,883 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:25,886 INFO ]: Computing forward predicates... [2018-06-22 11:43:25,950 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-06-22 11:43:25,950 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:25,957 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:43:25,957 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:31 [2018-06-22 11:43:25,996 INFO ]: detected not equals via solver [2018-06-22 11:43:25,996 INFO ]: detected not equals via solver [2018-06-22 11:43:26,007 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 48 [2018-06-22 11:43:26,008 INFO ]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-06-22 11:43:26,031 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-06-22 11:43:26,031 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:66 [2018-06-22 11:43:26,063 INFO ]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:26,064 INFO ]: Needed 1 recursive calls to eliminate 3 variables, input treesize:32, output treesize:3 [2018-06-22 11:43:26,074 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:26,093 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:26,093 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:43:26,093 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:43:26,093 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:43:26,093 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:43:26,094 INFO ]: Start difference. First operand 44 states and 78 transitions. Second operand 13 states. [2018-06-22 11:43:26,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:26,615 INFO ]: Finished difference Result 74 states and 132 transitions. [2018-06-22 11:43:26,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:26,616 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:43:26,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:26,617 INFO ]: With dead ends: 74 [2018-06-22 11:43:26,617 INFO ]: Without dead ends: 74 [2018-06-22 11:43:26,617 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:43:26,617 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:43:26,623 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 50. [2018-06-22 11:43:26,623 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:43:26,624 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 92 transitions. [2018-06-22 11:43:26,624 INFO ]: Start accepts. Automaton has 50 states and 92 transitions. Word has length 17 [2018-06-22 11:43:26,624 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:26,624 INFO ]: Abstraction has 50 states and 92 transitions. [2018-06-22 11:43:26,624 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:43:26,624 INFO ]: Start isEmpty. Operand 50 states and 92 transitions. [2018-06-22 11:43:26,625 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:26,625 INFO ]: Found error trace [2018-06-22 11:43:26,625 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:26,625 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:26,625 INFO ]: Analyzing trace with hash 1160550383, now seen corresponding path program 1 times [2018-06-22 11:43:26,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:26,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:26,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:26,626 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:26,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:26,631 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:26,732 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:26,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:26,732 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 11:43:26,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:26,751 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:26,753 INFO ]: Computing forward predicates... [2018-06-22 11:43:26,809 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:26,839 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:26,839 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:43:26,839 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:43:26,839 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:43:26,839 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:43:26,839 INFO ]: Start difference. First operand 50 states and 92 transitions. Second operand 11 states. [2018-06-22 11:43:27,012 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:27,012 INFO ]: Finished difference Result 106 states and 194 transitions. [2018-06-22 11:43:27,013 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:43:27,013 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:43:27,013 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:27,014 INFO ]: With dead ends: 106 [2018-06-22 11:43:27,014 INFO ]: Without dead ends: 106 [2018-06-22 11:43:27,014 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:43:27,014 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 11:43:27,022 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 54. [2018-06-22 11:43:27,022 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:43:27,023 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 104 transitions. [2018-06-22 11:43:27,023 INFO ]: Start accepts. Automaton has 54 states and 104 transitions. Word has length 17 [2018-06-22 11:43:27,023 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:27,023 INFO ]: Abstraction has 54 states and 104 transitions. [2018-06-22 11:43:27,023 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:43:27,024 INFO ]: Start isEmpty. Operand 54 states and 104 transitions. [2018-06-22 11:43:27,024 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:27,024 INFO ]: Found error trace [2018-06-22 11:43:27,024 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:27,025 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:27,025 INFO ]: Analyzing trace with hash -636785746, now seen corresponding path program 2 times [2018-06-22 11:43:27,025 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:27,025 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:27,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:27,025 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:27,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:27,037 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:27,334 WARN ]: Spent 266.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-06-22 11:43:27,503 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 11:43:27,504 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:27,504 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:27,504 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:27,505 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:27,505 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:27,505 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:27,505 INFO ]: Start difference. First operand 54 states and 104 transitions. Second operand 4 states. [2018-06-22 11:43:27,960 WARN ]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 11:43:28,006 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:28,007 INFO ]: Finished difference Result 93 states and 177 transitions. [2018-06-22 11:43:28,007 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:43:28,007 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:43:28,007 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:28,008 INFO ]: With dead ends: 93 [2018-06-22 11:43:28,008 INFO ]: Without dead ends: 77 [2018-06-22 11:43:28,008 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:43:28,008 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 11:43:28,018 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-06-22 11:43:28,018 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:43:28,019 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 144 transitions. [2018-06-22 11:43:28,020 INFO ]: Start accepts. Automaton has 75 states and 144 transitions. Word has length 17 [2018-06-22 11:43:28,021 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:28,021 INFO ]: Abstraction has 75 states and 144 transitions. [2018-06-22 11:43:28,021 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:28,021 INFO ]: Start isEmpty. Operand 75 states and 144 transitions. [2018-06-22 11:43:28,022 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:28,022 INFO ]: Found error trace [2018-06-22 11:43:28,022 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:28,022 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:28,022 INFO ]: Analyzing trace with hash -1656720469, now seen corresponding path program 1 times [2018-06-22 11:43:28,022 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:28,022 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:28,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:28,023 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:28,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:28,027 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:28,482 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:28,482 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:28,482 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:28,482 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:28,482 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:28,482 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:28,483 INFO ]: Start difference. First operand 75 states and 144 transitions. Second operand 7 states. [2018-06-22 11:43:28,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:28,746 INFO ]: Finished difference Result 97 states and 169 transitions. [2018-06-22 11:43:28,746 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:28,746 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:28,746 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:28,748 INFO ]: With dead ends: 97 [2018-06-22 11:43:28,748 INFO ]: Without dead ends: 97 [2018-06-22 11:43:28,748 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:28,748 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 11:43:28,756 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 89. [2018-06-22 11:43:28,756 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-22 11:43:28,757 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 161 transitions. [2018-06-22 11:43:28,758 INFO ]: Start accepts. Automaton has 89 states and 161 transitions. Word has length 17 [2018-06-22 11:43:28,758 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:28,758 INFO ]: Abstraction has 89 states and 161 transitions. [2018-06-22 11:43:28,758 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:28,758 INFO ]: Start isEmpty. Operand 89 states and 161 transitions. [2018-06-22 11:43:28,759 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:28,759 INFO ]: Found error trace [2018-06-22 11:43:28,759 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:28,759 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:28,759 INFO ]: Analyzing trace with hash -99654199, now seen corresponding path program 2 times [2018-06-22 11:43:28,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:28,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:28,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:28,759 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:28,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:28,776 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:29,087 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-06-22 11:43:29,880 WARN ]: Spent 716.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2018-06-22 11:43:30,022 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:30,023 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:30,023 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 11:43:30,030 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:43:30,062 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:43:30,062 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:30,064 INFO ]: Computing forward predicates... [2018-06-22 11:43:30,071 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-06-22 11:43:30,071 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:30,072 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:43:30,072 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:5 [2018-06-22 11:43:30,144 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-06-22 11:43:30,145 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:30,152 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:43:30,152 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-06-22 11:43:30,264 INFO ]: detected not equals via solver [2018-06-22 11:43:30,284 INFO ]: detected not equals via solver [2018-06-22 11:43:30,289 INFO ]: Index analysis took 118 ms [2018-06-22 11:43:30,296 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 48 [2018-06-22 11:43:30,297 INFO ]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-06-22 11:43:30,318 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-06-22 11:43:30,318 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:56 [2018-06-22 11:43:30,366 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:30,386 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:30,386 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:43:30,386 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:43:30,386 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:43:30,386 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:43:30,386 INFO ]: Start difference. First operand 89 states and 161 transitions. Second operand 13 states. [2018-06-22 11:43:30,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:30,839 INFO ]: Finished difference Result 95 states and 166 transitions. [2018-06-22 11:43:30,839 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:43:30,839 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:43:30,839 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:30,840 INFO ]: With dead ends: 95 [2018-06-22 11:43:30,840 INFO ]: Without dead ends: 95 [2018-06-22 11:43:30,840 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:43:30,840 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 11:43:30,847 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 89. [2018-06-22 11:43:30,847 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-22 11:43:30,848 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 159 transitions. [2018-06-22 11:43:30,848 INFO ]: Start accepts. Automaton has 89 states and 159 transitions. Word has length 17 [2018-06-22 11:43:30,848 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:30,848 INFO ]: Abstraction has 89 states and 159 transitions. [2018-06-22 11:43:30,848 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:43:30,848 INFO ]: Start isEmpty. Operand 89 states and 159 transitions. [2018-06-22 11:43:30,849 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:30,849 INFO ]: Found error trace [2018-06-22 11:43:30,849 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:30,849 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:30,850 INFO ]: Analyzing trace with hash -1194228154, now seen corresponding path program 1 times [2018-06-22 11:43:30,850 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:30,850 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:30,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:30,850 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:30,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:30,855 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:30,933 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:30,933 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:30,933 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 11:43:30,939 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:30,956 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:30,957 INFO ]: Computing forward predicates... [2018-06-22 11:43:30,982 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:31,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:31,001 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:43:31,001 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:31,001 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:31,001 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:31,001 INFO ]: Start difference. First operand 89 states and 159 transitions. Second operand 8 states. [2018-06-22 11:43:31,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:31,109 INFO ]: Finished difference Result 93 states and 162 transitions. [2018-06-22 11:43:31,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:31,110 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:43:31,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:31,111 INFO ]: With dead ends: 93 [2018-06-22 11:43:31,111 INFO ]: Without dead ends: 89 [2018-06-22 11:43:31,111 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:43:31,111 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-22 11:43:31,120 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-06-22 11:43:31,120 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-22 11:43:31,121 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 152 transitions. [2018-06-22 11:43:31,121 INFO ]: Start accepts. Automaton has 85 states and 152 transitions. Word has length 17 [2018-06-22 11:43:31,121 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:31,121 INFO ]: Abstraction has 85 states and 152 transitions. [2018-06-22 11:43:31,121 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:31,121 INFO ]: Start isEmpty. Operand 85 states and 152 transitions. [2018-06-22 11:43:31,122 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:31,122 INFO ]: Found error trace [2018-06-22 11:43:31,122 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:31,122 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:31,122 INFO ]: Analyzing trace with hash 818532449, now seen corresponding path program 2 times [2018-06-22 11:43:31,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:31,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:31,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:31,128 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:31,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:31,143 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:31,561 WARN ]: Spent 295.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2018-06-22 11:43:31,638 INFO ]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:31,638 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:31,639 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 11:43:31,644 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:43:31,660 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:43:31,660 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:31,662 INFO ]: Computing forward predicates... [2018-06-22 11:43:31,697 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-06-22 11:43:31,697 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:31,703 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:43:31,703 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-06-22 11:43:31,723 INFO ]: detected not equals via solver [2018-06-22 11:43:31,725 INFO ]: detected not equals via solver [2018-06-22 11:43:31,735 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2018-06-22 11:43:31,735 INFO ]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-06-22 11:43:31,754 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-22 11:43:31,754 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:65 [2018-06-22 11:43:31,786 INFO ]: detected not equals via solver [2018-06-22 11:43:31,787 INFO ]: detected not equals via solver [2018-06-22 11:43:31,787 INFO ]: detected not equals via solver [2018-06-22 11:43:31,791 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2018-06-22 11:43:31,791 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:31,806 INFO ]: detected not equals via solver [2018-06-22 11:43:31,811 INFO ]: detected not equals via solver [2018-06-22 11:43:31,814 INFO ]: detected not equals via solver [2018-06-22 11:43:31,815 INFO ]: detected not equals via solver [2018-06-22 11:43:31,815 INFO ]: detected not equals via solver [2018-06-22 11:43:31,817 INFO ]: detected not equals via solver [2018-06-22 11:43:31,848 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 3 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 92 [2018-06-22 11:43:31,849 INFO ]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-06-22 11:43:31,900 INFO ]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-06-22 11:43:31,900 INFO ]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:95 [2018-06-22 11:43:31,914 INFO ]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:31,933 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:31,934 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:43:31,934 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:43:31,934 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:43:31,934 INFO ]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:43:31,934 INFO ]: Start difference. First operand 85 states and 152 transitions. Second operand 11 states. [2018-06-22 11:43:32,092 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:32,093 INFO ]: Finished difference Result 89 states and 155 transitions. [2018-06-22 11:43:32,093 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:32,093 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:43:32,093 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:32,094 INFO ]: With dead ends: 89 [2018-06-22 11:43:32,094 INFO ]: Without dead ends: 87 [2018-06-22 11:43:32,094 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:32,094 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 11:43:32,101 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-06-22 11:43:32,101 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:43:32,102 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 149 transitions. [2018-06-22 11:43:32,102 INFO ]: Start accepts. Automaton has 83 states and 149 transitions. Word has length 17 [2018-06-22 11:43:32,102 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:32,102 INFO ]: Abstraction has 83 states and 149 transitions. [2018-06-22 11:43:32,102 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:43:32,102 INFO ]: Start isEmpty. Operand 83 states and 149 transitions. [2018-06-22 11:43:32,103 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:32,103 INFO ]: Found error trace [2018-06-22 11:43:32,103 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:32,103 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:32,103 INFO ]: Analyzing trace with hash 663996136, now seen corresponding path program 3 times [2018-06-22 11:43:32,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:32,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:32,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:32,103 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:32,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:32,124 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:32,328 WARN ]: Spent 139.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 4 [2018-06-22 11:43:32,552 INFO ]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:43:32,552 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:32,552 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 11:43:32,557 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:43:32,577 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:43:32,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:32,580 INFO ]: Computing forward predicates... [2018-06-22 11:43:32,687 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-06-22 11:43:32,688 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:32,758 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:43:32,758 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-06-22 11:43:32,780 INFO ]: detected not equals via solver [2018-06-22 11:43:32,782 INFO ]: detected not equals via solver [2018-06-22 11:43:32,792 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2018-06-22 11:43:32,793 INFO ]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-06-22 11:43:32,812 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-22 11:43:32,813 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:71 [2018-06-22 11:43:32,856 INFO ]: detected not equals via solver [2018-06-22 11:43:32,857 INFO ]: detected not equals via solver [2018-06-22 11:43:32,858 INFO ]: detected not equals via solver [2018-06-22 11:43:32,858 INFO ]: detected not equals via solver [2018-06-22 11:43:32,859 INFO ]: detected not equals via solver [2018-06-22 11:43:32,859 INFO ]: detected equality via solver [2018-06-22 11:43:32,866 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 85 [2018-06-22 11:43:32,866 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:32,901 INFO ]: detected not equals via solver [2018-06-22 11:43:32,902 INFO ]: detected not equals via solver [2018-06-22 11:43:32,908 INFO ]: detected not equals via solver [2018-06-22 11:43:32,909 INFO ]: detected not equals via solver [2018-06-22 11:43:32,910 INFO ]: detected not equals via solver [2018-06-22 11:43:32,918 INFO ]: detected not equals via solver [2018-06-22 11:43:32,964 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 143 [2018-06-22 11:43:32,966 INFO ]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-06-22 11:43:33,038 INFO ]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-06-22 11:43:33,038 INFO ]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:180 [2018-06-22 11:43:33,113 INFO ]: detected not equals via solver [2018-06-22 11:43:33,113 INFO ]: detected not equals via solver [2018-06-22 11:43:33,114 INFO ]: detected not equals via solver [2018-06-22 11:43:33,114 INFO ]: detected not equals via solver [2018-06-22 11:43:33,115 INFO ]: detected not equals via solver [2018-06-22 11:43:33,115 INFO ]: detected not equals via solver [2018-06-22 11:43:33,120 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-06-22 11:43:33,120 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:33,121 INFO ]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:43:33,121 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:1 [2018-06-22 11:43:33,124 INFO ]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:43:33,144 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:33,144 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-06-22 11:43:33,144 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:43:33,144 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:43:33,144 INFO ]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:43:33,144 INFO ]: Start difference. First operand 83 states and 149 transitions. Second operand 16 states. [2018-06-22 11:43:33,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:33,494 INFO ]: Finished difference Result 92 states and 169 transitions. [2018-06-22 11:43:33,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:33,494 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:43:33,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:33,495 INFO ]: With dead ends: 92 [2018-06-22 11:43:33,495 INFO ]: Without dead ends: 0 [2018-06-22 11:43:33,495 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:43:33,495 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:43:33,495 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:43:33,495 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:43:33,495 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:43:33,495 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-06-22 11:43:33,495 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:33,495 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:43:33,495 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:43:33,495 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:43:33,495 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:43:33,499 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:43:33 BoogieIcfgContainer [2018-06-22 11:43:33,499 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:43:33,500 INFO ]: Toolchain (without parser) took 23154.71 ms. Allocated memory was 303.0 MB in the beginning and 597.7 MB in the end (delta: 294.6 MB). Free memory was 255.4 MB in the beginning and 400.2 MB in the end (delta: -144.8 MB). Peak memory consumption was 149.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:43:33,501 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:43:33,501 INFO ]: ChcToBoogie took 62.35 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:43:33,501 INFO ]: Boogie Preprocessor took 57.03 ms. Allocated memory is still 303.0 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:43:33,502 INFO ]: RCFGBuilder took 488.54 ms. Allocated memory is still 303.0 MB. Free memory was 251.4 MB in the beginning and 237.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:43:33,502 INFO ]: TraceAbstraction took 22532.32 ms. Allocated memory was 303.0 MB in the beginning and 597.7 MB in the end (delta: 294.6 MB). Free memory was 237.5 MB in the beginning and 400.2 MB in the end (delta: -162.7 MB). Peak memory consumption was 131.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:43:33,506 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.35 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 57.03 ms. Allocated memory is still 303.0 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 488.54 ms. Allocated memory is still 303.0 MB. Free memory was 251.4 MB in the beginning and 237.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 22532.32 ms. Allocated memory was 303.0 MB in the beginning and 597.7 MB in the end (delta: 294.6 MB). Free memory was 237.5 MB in the beginning and 400.2 MB in the end (delta: -162.7 MB). Peak memory consumption was 131.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. SAFE Result, 22.4s OverallTime, 29 OverallIterations, 4 TraceHistogramMax, 8.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 775 SDtfs, 148 SDslu, 2069 SDs, 0 SdLazy, 3057 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 445 GetRequests, 211 SyntacticMatches, 23 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=25, 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.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 218 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 627 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 584 ConstructedInterpolants, 9 QuantifiedInterpolants, 137772 SizeOfPredicates, 203 NumberOfNonLiveVariables, 1652 ConjunctsInSsa, 585 ConjunctsInUnsatCore, 43 InterpolantComputations, 15 PerfectInterpolantSequences, 145/262 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__memccpy_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-43-33-516.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__memccpy_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-43-33-516.csv Received shutdown request...