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_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:10:29,755 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:10:29,756 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:10:29,767 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:10:29,768 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:10:29,769 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:10:29,770 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:10:29,775 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:10:29,777 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:10:29,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:10:29,780 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:10:29,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:10:29,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:10:29,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:10:29,786 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:10:29,787 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:10:29,789 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:10:29,802 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:10:29,803 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:10:29,804 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:10:29,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:10:29,807 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:10:29,807 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:10:29,807 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:10:29,808 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:10:29,809 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:10:29,809 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:10:29,813 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:10:29,814 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:10:29,814 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:10:29,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:10:29,816 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:10:29,816 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:10:29,817 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:10:29,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:10:29,817 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:10:29,836 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:10:29,836 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:10:29,837 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:10:29,837 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:10:29,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:10:29,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:10:29,838 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:10:29,839 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:10:29,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:10:29,839 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:10:29,839 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:10:29,839 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:10:29,839 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:10:29,840 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:10:29,843 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:10:29,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:10:29,843 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:10:29,846 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:10:29,846 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:10:29,898 INFO ]: Repository-Root is: /tmp [2018-06-22 02:10:29,912 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:10:29,918 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:10:29,919 INFO ]: Initializing SmtParser... [2018-06-22 02:10:29,919 INFO ]: SmtParser initialized [2018-06-22 02:10:29,920 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big.smt2 [2018-06-22 02:10:29,921 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 02:10:30,007 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@741e30b6 [2018-06-22 02:10:30,184 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big.smt2 [2018-06-22 02:10:30,188 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:10:30,194 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:10:30,194 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:10:30,194 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:10:30,194 INFO ]: ChcToBoogie initialized [2018-06-22 02:10:30,198 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:10:30" (1/1) ... [2018-06-22 02:10:30,264 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:30 Unit [2018-06-22 02:10:30,264 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:10:30,265 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:10:30,265 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:10:30,265 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:10:30,283 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:30" (1/1) ... [2018-06-22 02:10:30,283 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:30" (1/1) ... [2018-06-22 02:10:30,289 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:30" (1/1) ... [2018-06-22 02:10:30,289 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:30" (1/1) ... [2018-06-22 02:10:30,292 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:30" (1/1) ... [2018-06-22 02:10:30,294 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:30" (1/1) ... [2018-06-22 02:10:30,296 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:30" (1/1) ... [2018-06-22 02:10:30,298 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:10:30,299 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:10:30,299 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:10:30,299 INFO ]: RCFGBuilder initialized [2018-06-22 02:10:30,299 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:30" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:10:30,319 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:10:30,319 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:10:30,319 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:10:30,319 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:10:30,319 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:10:30,319 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 02:10:30,642 INFO ]: Using library mode [2018-06-22 02:10:30,642 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:10:30 BoogieIcfgContainer [2018-06-22 02:10:30,643 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:10:30,651 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:10:30,651 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:10:30,654 INFO ]: TraceAbstraction initialized [2018-06-22 02:10:30,654 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:10:30" (1/3) ... [2018-06-22 02:10:30,655 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9648c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:10:30, skipping insertion in model container [2018-06-22 02:10:30,655 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:30" (2/3) ... [2018-06-22 02:10:30,656 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9648c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:10:30, skipping insertion in model container [2018-06-22 02:10:30,656 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:10:30" (3/3) ... [2018-06-22 02:10:30,657 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:10:30,675 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:10:30,688 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:10:30,727 INFO ]: Using default assertion order modulation [2018-06-22 02:10:30,727 INFO ]: Interprodecural is true [2018-06-22 02:10:30,727 INFO ]: Hoare is false [2018-06-22 02:10:30,727 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:10:30,727 INFO ]: Backedges is TWOTRACK [2018-06-22 02:10:30,728 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:10:30,728 INFO ]: Difference is false [2018-06-22 02:10:30,728 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:10:30,728 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:10:30,753 INFO ]: Start isEmpty. Operand 11 states. [2018-06-22 02:10:30,763 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:10:30,763 INFO ]: Found error trace [2018-06-22 02:10:30,764 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:30,768 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:30,773 INFO ]: Analyzing trace with hash 871593666, now seen corresponding path program 1 times [2018-06-22 02:10:30,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:30,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:30,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:30,821 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:30,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:30,870 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:30,982 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:30,983 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:10:30,984 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:10:30,985 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:10:30,996 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:10:30,997 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:10:30,999 INFO ]: Start difference. First operand 11 states. Second operand 4 states. [2018-06-22 02:10:31,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:31,137 INFO ]: Finished difference Result 14 states and 27 transitions. [2018-06-22 02:10:31,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:10:31,138 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 02:10:31,138 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:31,148 INFO ]: With dead ends: 14 [2018-06-22 02:10:31,148 INFO ]: Without dead ends: 14 [2018-06-22 02:10:31,153 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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 02:10:31,171 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 02:10:31,195 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 02:10:31,197 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 02:10:31,197 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2018-06-22 02:10:31,199 INFO ]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 8 [2018-06-22 02:10:31,201 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:31,201 INFO ]: Abstraction has 11 states and 21 transitions. [2018-06-22 02:10:31,201 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:10:31,201 INFO ]: Start isEmpty. Operand 11 states and 21 transitions. [2018-06-22 02:10:31,201 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:10:31,201 INFO ]: Found error trace [2018-06-22 02:10:31,201 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:31,201 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:31,202 INFO ]: Analyzing trace with hash 1402868956, now seen corresponding path program 1 times [2018-06-22 02:10:31,202 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:31,202 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:31,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:31,203 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:31,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:31,232 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:31,396 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:31,396 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:10:31,397 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:10:31,399 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:10:31,399 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:10:31,399 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:10:31,399 INFO ]: Start difference. First operand 11 states and 21 transitions. Second operand 4 states. [2018-06-22 02:10:31,777 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:31,777 INFO ]: Finished difference Result 16 states and 33 transitions. [2018-06-22 02:10:31,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:10:31,779 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 02:10:31,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:31,780 INFO ]: With dead ends: 16 [2018-06-22 02:10:31,780 INFO ]: Without dead ends: 16 [2018-06-22 02:10:31,781 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:10:31,781 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 02:10:31,785 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-22 02:10:31,785 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 02:10:31,785 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2018-06-22 02:10:31,785 INFO ]: Start accepts. Automaton has 13 states and 27 transitions. Word has length 9 [2018-06-22 02:10:31,786 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:31,786 INFO ]: Abstraction has 13 states and 27 transitions. [2018-06-22 02:10:31,786 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:10:31,786 INFO ]: Start isEmpty. Operand 13 states and 27 transitions. [2018-06-22 02:10:31,786 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:10:31,786 INFO ]: Found error trace [2018-06-22 02:10:31,786 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:31,786 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:31,786 INFO ]: Analyzing trace with hash 1116577446, now seen corresponding path program 1 times [2018-06-22 02:10:31,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:31,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:31,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:31,787 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:31,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:31,828 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:32,028 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:32,028 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:32,028 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 02:10:32,035 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:32,070 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:32,078 INFO ]: Computing forward predicates... [2018-06-22 02:10:32,269 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:32,305 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:32,305 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 02:10:32,306 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:10:32,306 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:10:32,306 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:10:32,306 INFO ]: Start difference. First operand 13 states and 27 transitions. Second operand 8 states. [2018-06-22 02:10:32,469 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:32,469 INFO ]: Finished difference Result 18 states and 40 transitions. [2018-06-22 02:10:32,469 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:10:32,469 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 02:10:32,469 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:32,470 INFO ]: With dead ends: 18 [2018-06-22 02:10:32,470 INFO ]: Without dead ends: 18 [2018-06-22 02:10:32,470 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:10:32,470 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 02:10:32,473 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-06-22 02:10:32,473 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 02:10:32,473 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2018-06-22 02:10:32,473 INFO ]: Start accepts. Automaton has 14 states and 31 transitions. Word has length 9 [2018-06-22 02:10:32,474 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:32,474 INFO ]: Abstraction has 14 states and 31 transitions. [2018-06-22 02:10:32,474 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:10:32,474 INFO ]: Start isEmpty. Operand 14 states and 31 transitions. [2018-06-22 02:10:32,474 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:10:32,474 INFO ]: Found error trace [2018-06-22 02:10:32,474 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:32,474 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:32,474 INFO ]: Analyzing trace with hash 1240329260, now seen corresponding path program 1 times [2018-06-22 02:10:32,474 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:32,474 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:32,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:32,475 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:32,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:32,495 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:32,547 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:32,548 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:32,548 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 02:10:32,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:32,597 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:32,599 INFO ]: Computing forward predicates... [2018-06-22 02:10:32,610 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:32,633 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:32,633 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 02:10:32,633 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:10:32,633 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:10:32,633 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:10:32,634 INFO ]: Start difference. First operand 14 states and 31 transitions. Second operand 5 states. [2018-06-22 02:10:32,869 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:32,869 INFO ]: Finished difference Result 19 states and 43 transitions. [2018-06-22 02:10:32,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:10:32,869 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-22 02:10:32,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:32,870 INFO ]: With dead ends: 19 [2018-06-22 02:10:32,870 INFO ]: Without dead ends: 17 [2018-06-22 02:10:32,870 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:10:32,870 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 02:10:32,874 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-22 02:10:32,874 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 02:10:32,874 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 31 transitions. [2018-06-22 02:10:32,874 INFO ]: Start accepts. Automaton has 15 states and 31 transitions. Word has length 9 [2018-06-22 02:10:32,874 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:32,874 INFO ]: Abstraction has 15 states and 31 transitions. [2018-06-22 02:10:32,874 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:10:32,874 INFO ]: Start isEmpty. Operand 15 states and 31 transitions. [2018-06-22 02:10:32,875 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:10:32,875 INFO ]: Found error trace [2018-06-22 02:10:32,875 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:32,875 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:32,875 INFO ]: Analyzing trace with hash 1247717428, now seen corresponding path program 1 times [2018-06-22 02:10:32,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:32,875 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:32,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:32,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:32,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:32,886 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:32,934 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:32,934 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:10:32,934 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:10:32,934 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:10:32,934 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:10:32,934 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:10:32,934 INFO ]: Start difference. First operand 15 states and 31 transitions. Second operand 3 states. [2018-06-22 02:10:33,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:33,037 INFO ]: Finished difference Result 18 states and 38 transitions. [2018-06-22 02:10:33,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:10:33,037 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 02:10:33,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:33,038 INFO ]: With dead ends: 18 [2018-06-22 02:10:33,038 INFO ]: Without dead ends: 16 [2018-06-22 02:10:33,038 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:10:33,038 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 02:10:33,039 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-06-22 02:10:33,039 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 02:10:33,040 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 27 transitions. [2018-06-22 02:10:33,040 INFO ]: Start accepts. Automaton has 14 states and 27 transitions. Word has length 9 [2018-06-22 02:10:33,040 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:33,040 INFO ]: Abstraction has 14 states and 27 transitions. [2018-06-22 02:10:33,040 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:10:33,040 INFO ]: Start isEmpty. Operand 14 states and 27 transitions. [2018-06-22 02:10:33,040 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:10:33,040 INFO ]: Found error trace [2018-06-22 02:10:33,040 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:33,040 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:33,041 INFO ]: Analyzing trace with hash 529994066, now seen corresponding path program 1 times [2018-06-22 02:10:33,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:33,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:33,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:33,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:33,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:33,054 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:33,172 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:10:33,172 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:10:33,172 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:10:33,172 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:10:33,172 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:10:33,172 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:10:33,172 INFO ]: Start difference. First operand 14 states and 27 transitions. Second operand 3 states. [2018-06-22 02:10:33,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:33,284 INFO ]: Finished difference Result 16 states and 33 transitions. [2018-06-22 02:10:33,285 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:10:33,285 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-22 02:10:33,285 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:33,285 INFO ]: With dead ends: 16 [2018-06-22 02:10:33,285 INFO ]: Without dead ends: 14 [2018-06-22 02:10:33,285 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:10:33,285 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 02:10:33,287 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 02:10:33,287 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 02:10:33,287 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-06-22 02:10:33,287 INFO ]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2018-06-22 02:10:33,287 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:33,287 INFO ]: Abstraction has 14 states and 25 transitions. [2018-06-22 02:10:33,287 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:10:33,287 INFO ]: Start isEmpty. Operand 14 states and 25 transitions. [2018-06-22 02:10:33,288 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:10:33,288 INFO ]: Found error trace [2018-06-22 02:10:33,288 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:33,288 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:33,288 INFO ]: Analyzing trace with hash 533688150, now seen corresponding path program 1 times [2018-06-22 02:10:33,288 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:33,288 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:33,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:33,289 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:33,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:33,301 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:33,407 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:33,407 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:33,407 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 02:10:33,413 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:33,441 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:33,444 INFO ]: Computing forward predicates... [2018-06-22 02:10:33,466 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:33,499 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:33,499 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 02:10:33,499 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:10:33,499 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:10:33,499 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:10:33,500 INFO ]: Start difference. First operand 14 states and 25 transitions. Second operand 7 states. [2018-06-22 02:10:33,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:33,737 INFO ]: Finished difference Result 22 states and 43 transitions. [2018-06-22 02:10:33,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 02:10:33,738 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-22 02:10:33,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:33,738 INFO ]: With dead ends: 22 [2018-06-22 02:10:33,738 INFO ]: Without dead ends: 16 [2018-06-22 02:10:33,739 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:10:33,739 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 02:10:33,740 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 02:10:33,740 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 02:10:33,741 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-06-22 02:10:33,741 INFO ]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-06-22 02:10:33,741 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:33,741 INFO ]: Abstraction has 16 states and 29 transitions. [2018-06-22 02:10:33,741 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:10:33,741 INFO ]: Start isEmpty. Operand 16 states and 29 transitions. [2018-06-22 02:10:33,741 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:10:33,741 INFO ]: Found error trace [2018-06-22 02:10:33,741 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:33,742 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:33,742 INFO ]: Analyzing trace with hash 121140034, now seen corresponding path program 2 times [2018-06-22 02:10:33,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:33,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:33,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:33,743 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:33,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:33,753 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:33,800 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:33,800 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:10:33,800 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:10:33,800 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:10:33,800 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:10:33,800 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:10:33,801 INFO ]: Start difference. First operand 16 states and 29 transitions. Second operand 5 states. [2018-06-22 02:10:33,856 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:33,856 INFO ]: Finished difference Result 17 states and 26 transitions. [2018-06-22 02:10:33,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:10:33,856 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 02:10:33,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:33,856 INFO ]: With dead ends: 17 [2018-06-22 02:10:33,856 INFO ]: Without dead ends: 16 [2018-06-22 02:10:33,857 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:10:33,857 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 02:10:33,858 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-06-22 02:10:33,858 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 02:10:33,859 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2018-06-22 02:10:33,859 INFO ]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 10 [2018-06-22 02:10:33,859 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:33,859 INFO ]: Abstraction has 14 states and 21 transitions. [2018-06-22 02:10:33,859 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:10:33,859 INFO ]: Start isEmpty. Operand 14 states and 21 transitions. [2018-06-22 02:10:33,859 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:10:33,859 INFO ]: Found error trace [2018-06-22 02:10:33,859 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:33,859 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:33,860 INFO ]: Analyzing trace with hash -11866384, now seen corresponding path program 2 times [2018-06-22 02:10:33,860 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:33,860 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:33,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:33,861 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:33,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:33,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:33,929 INFO ]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:33,929 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:33,929 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 02:10:33,943 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:33,993 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:33,993 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:33,996 INFO ]: Computing forward predicates... [2018-06-22 02:10:34,105 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:34,129 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:34,129 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 02:10:34,130 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:10:34,130 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:10:34,130 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:10:34,130 INFO ]: Start difference. First operand 14 states and 21 transitions. Second operand 7 states. [2018-06-22 02:10:34,225 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:34,225 INFO ]: Finished difference Result 25 states and 41 transitions. [2018-06-22 02:10:34,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:10:34,225 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-22 02:10:34,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:34,226 INFO ]: With dead ends: 25 [2018-06-22 02:10:34,226 INFO ]: Without dead ends: 25 [2018-06-22 02:10:34,226 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:10:34,226 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 02:10:34,230 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-06-22 02:10:34,230 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 02:10:34,231 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2018-06-22 02:10:34,231 INFO ]: Start accepts. Automaton has 16 states and 25 transitions. Word has length 11 [2018-06-22 02:10:34,231 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:34,231 INFO ]: Abstraction has 16 states and 25 transitions. [2018-06-22 02:10:34,231 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:10:34,231 INFO ]: Start isEmpty. Operand 16 states and 25 transitions. [2018-06-22 02:10:34,231 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:10:34,231 INFO ]: Found error trace [2018-06-22 02:10:34,231 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:34,232 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:34,232 INFO ]: Analyzing trace with hash -260100550, now seen corresponding path program 1 times [2018-06-22 02:10:34,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:34,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:34,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:34,232 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:34,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:34,246 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:34,355 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:34,355 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:34,355 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 02:10:34,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:34,394 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:34,396 INFO ]: Computing forward predicates... [2018-06-22 02:10:34,463 INFO ]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:10:34,484 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:34,484 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-06-22 02:10:34,484 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:10:34,484 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:10:34,484 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:10:34,485 INFO ]: Start difference. First operand 16 states and 25 transitions. Second operand 8 states. [2018-06-22 02:10:34,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:34,630 INFO ]: Finished difference Result 27 states and 46 transitions. [2018-06-22 02:10:34,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 02:10:34,630 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-22 02:10:34,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:34,631 INFO ]: With dead ends: 27 [2018-06-22 02:10:34,631 INFO ]: Without dead ends: 27 [2018-06-22 02:10:34,631 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:10:34,631 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 02:10:34,633 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-22 02:10:34,633 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 02:10:34,634 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2018-06-22 02:10:34,634 INFO ]: Start accepts. Automaton has 21 states and 35 transitions. Word has length 11 [2018-06-22 02:10:34,634 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:34,634 INFO ]: Abstraction has 21 states and 35 transitions. [2018-06-22 02:10:34,634 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:10:34,634 INFO ]: Start isEmpty. Operand 21 states and 35 transitions. [2018-06-22 02:10:34,634 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:10:34,634 INFO ]: Found error trace [2018-06-22 02:10:34,635 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:34,635 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:34,635 INFO ]: Analyzing trace with hash -373434430, now seen corresponding path program 3 times [2018-06-22 02:10:34,635 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:34,635 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:34,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:34,636 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:34,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:34,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:34,750 INFO ]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:34,751 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:34,751 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 02:10:34,757 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:10:34,810 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 02:10:34,810 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:34,812 INFO ]: Computing forward predicates... [2018-06-22 02:10:35,141 INFO ]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:10:35,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:35,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-06-22 02:10:35,162 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:10:35,163 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:10:35,163 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:10:35,163 INFO ]: Start difference. First operand 21 states and 35 transitions. Second operand 11 states. [2018-06-22 02:10:35,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:35,728 INFO ]: Finished difference Result 37 states and 66 transitions. [2018-06-22 02:10:35,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 02:10:35,729 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-22 02:10:35,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:35,729 INFO ]: With dead ends: 37 [2018-06-22 02:10:35,729 INFO ]: Without dead ends: 25 [2018-06-22 02:10:35,730 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:10:35,730 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 02:10:35,732 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-06-22 02:10:35,732 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 02:10:35,733 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. [2018-06-22 02:10:35,733 INFO ]: Start accepts. Automaton has 22 states and 35 transitions. Word has length 12 [2018-06-22 02:10:35,734 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:35,734 INFO ]: Abstraction has 22 states and 35 transitions. [2018-06-22 02:10:35,734 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:10:35,734 INFO ]: Start isEmpty. Operand 22 states and 35 transitions. [2018-06-22 02:10:35,734 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:10:35,734 INFO ]: Found error trace [2018-06-22 02:10:35,734 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:35,734 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:35,734 INFO ]: Analyzing trace with hash 902253526, now seen corresponding path program 2 times [2018-06-22 02:10:35,734 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:35,735 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:35,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:35,735 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:35,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:35,765 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:35,963 INFO ]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:35,963 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:35,963 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 02:10:35,972 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:35,999 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:35,999 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:36,001 INFO ]: Computing forward predicates... [2018-06-22 02:10:36,099 INFO ]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:10:36,118 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:36,118 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 02:10:36,118 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:10:36,118 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:10:36,118 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:10:36,119 INFO ]: Start difference. First operand 22 states and 35 transitions. Second operand 12 states. [2018-06-22 02:10:36,274 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:36,274 INFO ]: Finished difference Result 32 states and 55 transitions. [2018-06-22 02:10:36,275 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:10:36,275 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-22 02:10:36,275 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:36,275 INFO ]: With dead ends: 32 [2018-06-22 02:10:36,275 INFO ]: Without dead ends: 27 [2018-06-22 02:10:36,276 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:10:36,276 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 02:10:36,277 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-22 02:10:36,277 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 02:10:36,278 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2018-06-22 02:10:36,278 INFO ]: Start accepts. Automaton has 21 states and 33 transitions. Word has length 12 [2018-06-22 02:10:36,278 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:36,278 INFO ]: Abstraction has 21 states and 33 transitions. [2018-06-22 02:10:36,278 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:10:36,278 INFO ]: Start isEmpty. Operand 21 states and 33 transitions. [2018-06-22 02:10:36,278 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:10:36,278 INFO ]: Found error trace [2018-06-22 02:10:36,278 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:36,278 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:36,278 INFO ]: Analyzing trace with hash -665331492, now seen corresponding path program 4 times [2018-06-22 02:10:36,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:36,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:36,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:36,279 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:36,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:36,295 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:36,394 INFO ]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:36,395 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:36,395 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 02:10:36,403 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:10:36,434 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:10:36,434 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:36,436 INFO ]: Computing forward predicates... [2018-06-22 02:10:36,456 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:36,485 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:36,485 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 02:10:36,485 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:10:36,485 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:10:36,486 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:10:36,486 INFO ]: Start difference. First operand 21 states and 33 transitions. Second operand 9 states. [2018-06-22 02:10:36,578 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:36,578 INFO ]: Finished difference Result 38 states and 62 transitions. [2018-06-22 02:10:36,580 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:10:36,580 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 02:10:36,580 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:36,581 INFO ]: With dead ends: 38 [2018-06-22 02:10:36,581 INFO ]: Without dead ends: 38 [2018-06-22 02:10:36,581 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:10:36,581 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 02:10:36,583 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 24. [2018-06-22 02:10:36,583 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 02:10:36,584 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2018-06-22 02:10:36,585 INFO ]: Start accepts. Automaton has 24 states and 38 transitions. Word has length 13 [2018-06-22 02:10:36,585 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:36,585 INFO ]: Abstraction has 24 states and 38 transitions. [2018-06-22 02:10:36,585 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:10:36,585 INFO ]: Start isEmpty. Operand 24 states and 38 transitions. [2018-06-22 02:10:36,585 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:10:36,585 INFO ]: Found error trace [2018-06-22 02:10:36,585 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:36,585 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:36,585 INFO ]: Analyzing trace with hash 843983702, now seen corresponding path program 5 times [2018-06-22 02:10:36,585 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:36,585 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:36,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:36,586 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:36,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:36,599 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:36,743 INFO ]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:36,743 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:36,743 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 02:10:36,755 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:10:36,797 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 02:10:36,798 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:36,799 INFO ]: Computing forward predicates... [2018-06-22 02:10:36,872 INFO ]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:36,892 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:36,892 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 02:10:36,892 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:10:36,892 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:10:36,892 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:10:36,893 INFO ]: Start difference. First operand 24 states and 38 transitions. Second operand 11 states. [2018-06-22 02:10:37,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:37,068 INFO ]: Finished difference Result 40 states and 69 transitions. [2018-06-22 02:10:37,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:10:37,068 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-22 02:10:37,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:37,069 INFO ]: With dead ends: 40 [2018-06-22 02:10:37,069 INFO ]: Without dead ends: 26 [2018-06-22 02:10:37,069 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:10:37,069 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 02:10:37,070 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-06-22 02:10:37,070 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 02:10:37,072 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2018-06-22 02:10:37,073 INFO ]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 14 [2018-06-22 02:10:37,073 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:37,073 INFO ]: Abstraction has 21 states and 32 transitions. [2018-06-22 02:10:37,073 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:10:37,073 INFO ]: Start isEmpty. Operand 21 states and 32 transitions. [2018-06-22 02:10:37,073 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:10:37,073 INFO ]: Found error trace [2018-06-22 02:10:37,073 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:37,073 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:37,073 INFO ]: Analyzing trace with hash 1630573634, now seen corresponding path program 3 times [2018-06-22 02:10:37,073 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:37,073 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:37,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:37,074 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:37,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:37,085 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:37,909 INFO ]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:37,909 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:37,909 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 02:10:37,924 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:10:37,972 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:10:37,972 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:37,974 INFO ]: Computing forward predicates... [2018-06-22 02:10:38,059 INFO ]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:38,081 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:38,081 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-22 02:10:38,081 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:10:38,081 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:10:38,081 INFO ]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:10:38,081 INFO ]: Start difference. First operand 21 states and 32 transitions. Second operand 13 states. [2018-06-22 02:10:38,445 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:38,445 INFO ]: Finished difference Result 43 states and 75 transitions. [2018-06-22 02:10:38,445 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:10:38,446 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-22 02:10:38,446 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:38,446 INFO ]: With dead ends: 43 [2018-06-22 02:10:38,446 INFO ]: Without dead ends: 43 [2018-06-22 02:10:38,447 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=160, Invalid=302, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:10:38,447 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 02:10:38,449 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 20. [2018-06-22 02:10:38,449 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 02:10:38,449 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-06-22 02:10:38,449 INFO ]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 14 [2018-06-22 02:10:38,449 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:38,449 INFO ]: Abstraction has 20 states and 31 transitions. [2018-06-22 02:10:38,449 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:10:38,449 INFO ]: Start isEmpty. Operand 20 states and 31 transitions. [2018-06-22 02:10:38,450 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 02:10:38,450 INFO ]: Found error trace [2018-06-22 02:10:38,450 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:38,450 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:38,450 INFO ]: Analyzing trace with hash -496218640, now seen corresponding path program 6 times [2018-06-22 02:10:38,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:38,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:38,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:38,451 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:38,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:38,463 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:38,672 INFO ]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:38,672 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:38,672 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 02:10:38,678 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:10:38,716 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-22 02:10:38,716 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:38,719 INFO ]: Computing forward predicates... [2018-06-22 02:10:38,746 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:38,766 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:38,766 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 02:10:38,766 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:10:38,767 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:10:38,767 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:10:38,767 INFO ]: Start difference. First operand 20 states and 31 transitions. Second operand 11 states. [2018-06-22 02:10:38,904 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:38,904 INFO ]: Finished difference Result 68 states and 116 transitions. [2018-06-22 02:10:38,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:10:38,905 INFO ]: Start accepts. Automaton has 11 states. Word has length 15 [2018-06-22 02:10:38,905 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:38,905 INFO ]: With dead ends: 68 [2018-06-22 02:10:38,905 INFO ]: Without dead ends: 68 [2018-06-22 02:10:38,906 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:10:38,906 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 02:10:38,910 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 28. [2018-06-22 02:10:38,910 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 02:10:38,910 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 44 transitions. [2018-06-22 02:10:38,911 INFO ]: Start accepts. Automaton has 28 states and 44 transitions. Word has length 15 [2018-06-22 02:10:38,911 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:38,911 INFO ]: Abstraction has 28 states and 44 transitions. [2018-06-22 02:10:38,911 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:10:38,911 INFO ]: Start isEmpty. Operand 28 states and 44 transitions. [2018-06-22 02:10:38,912 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 02:10:38,912 INFO ]: Found error trace [2018-06-22 02:10:38,912 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:38,912 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:38,912 INFO ]: Analyzing trace with hash -1787045830, now seen corresponding path program 4 times [2018-06-22 02:10:38,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:38,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:38,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:38,913 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:38,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:38,928 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:39,153 INFO ]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:10:39,153 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:39,153 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 02:10:39,159 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:10:39,185 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:10:39,185 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:39,187 INFO ]: Computing forward predicates... [2018-06-22 02:10:39,290 INFO ]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:10:39,310 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:39,310 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2018-06-22 02:10:39,310 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:10:39,310 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:10:39,310 INFO ]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:10:39,310 INFO ]: Start difference. First operand 28 states and 44 transitions. Second operand 10 states. [2018-06-22 02:10:39,636 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-06-22 02:10:39,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:39,716 INFO ]: Finished difference Result 48 states and 83 transitions. [2018-06-22 02:10:39,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:10:39,716 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-22 02:10:39,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:39,717 INFO ]: With dead ends: 48 [2018-06-22 02:10:39,717 INFO ]: Without dead ends: 48 [2018-06-22 02:10:39,717 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:10:39,717 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 02:10:39,720 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 35. [2018-06-22 02:10:39,720 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 02:10:39,721 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2018-06-22 02:10:39,721 INFO ]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 15 [2018-06-22 02:10:39,721 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:39,721 INFO ]: Abstraction has 35 states and 58 transitions. [2018-06-22 02:10:39,721 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:10:39,721 INFO ]: Start isEmpty. Operand 35 states and 58 transitions. [2018-06-22 02:10:39,721 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 02:10:39,721 INFO ]: Found error trace [2018-06-22 02:10:39,721 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:39,722 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:39,722 INFO ]: Analyzing trace with hash -997401424, now seen corresponding path program 5 times [2018-06-22 02:10:39,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:39,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:39,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:39,722 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:39,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:39,734 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:39,814 INFO ]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:10:39,814 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:39,814 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 02:10:39,823 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:10:39,868 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 02:10:39,868 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:39,870 INFO ]: Computing forward predicates... [2018-06-22 02:10:39,916 INFO ]: Checked inductivity of 16 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:10:39,943 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:39,943 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 02:10:39,943 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:10:39,943 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:10:39,943 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:10:39,944 INFO ]: Start difference. First operand 35 states and 58 transitions. Second operand 10 states. [2018-06-22 02:10:40,020 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:40,020 INFO ]: Finished difference Result 51 states and 87 transitions. [2018-06-22 02:10:40,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:10:40,021 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-22 02:10:40,021 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:40,022 INFO ]: With dead ends: 51 [2018-06-22 02:10:40,022 INFO ]: Without dead ends: 40 [2018-06-22 02:10:40,022 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:10:40,022 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 02:10:40,024 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-06-22 02:10:40,024 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 02:10:40,025 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 57 transitions. [2018-06-22 02:10:40,025 INFO ]: Start accepts. Automaton has 35 states and 57 transitions. Word has length 15 [2018-06-22 02:10:40,025 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:40,025 INFO ]: Abstraction has 35 states and 57 transitions. [2018-06-22 02:10:40,025 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:10:40,025 INFO ]: Start isEmpty. Operand 35 states and 57 transitions. [2018-06-22 02:10:40,025 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:10:40,025 INFO ]: Found error trace [2018-06-22 02:10:40,025 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:40,025 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:40,026 INFO ]: Analyzing trace with hash 1791514818, now seen corresponding path program 7 times [2018-06-22 02:10:40,026 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:40,026 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:40,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:40,026 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:40,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:40,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:40,257 INFO ]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:40,257 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:40,257 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 02:10:40,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:40,291 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:40,294 INFO ]: Computing forward predicates... [2018-06-22 02:10:40,320 INFO ]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:40,341 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:40,341 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 02:10:40,341 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:10:40,341 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:10:40,342 INFO ]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:10:40,342 INFO ]: Start difference. First operand 35 states and 57 transitions. Second operand 13 states. [2018-06-22 02:10:40,501 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:40,501 INFO ]: Finished difference Result 70 states and 124 transitions. [2018-06-22 02:10:40,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:10:40,501 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-22 02:10:40,501 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:40,502 INFO ]: With dead ends: 70 [2018-06-22 02:10:40,502 INFO ]: Without dead ends: 41 [2018-06-22 02:10:40,502 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:10:40,502 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 02:10:40,504 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-06-22 02:10:40,504 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 02:10:40,504 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 55 transitions. [2018-06-22 02:10:40,505 INFO ]: Start accepts. Automaton has 35 states and 55 transitions. Word has length 16 [2018-06-22 02:10:40,505 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:40,506 INFO ]: Abstraction has 35 states and 55 transitions. [2018-06-22 02:10:40,506 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:10:40,506 INFO ]: Start isEmpty. Operand 35 states and 55 transitions. [2018-06-22 02:10:40,507 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:10:40,507 INFO ]: Found error trace [2018-06-22 02:10:40,507 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:40,507 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:40,507 INFO ]: Analyzing trace with hash -1744582698, now seen corresponding path program 6 times [2018-06-22 02:10:40,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:40,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:40,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:40,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:40,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:40,519 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:40,910 INFO ]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:40,910 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:40,910 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:40,916 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:10:40,998 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 02:10:40,998 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:41,001 INFO ]: Computing forward predicates... [2018-06-22 02:10:41,357 INFO ]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:10:41,377 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:41,377 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-06-22 02:10:41,377 INFO ]: Interpolant automaton has 18 states [2018-06-22 02:10:41,377 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 02:10:41,377 INFO ]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:10:41,377 INFO ]: Start difference. First operand 35 states and 55 transitions. Second operand 18 states. [2018-06-22 02:10:41,905 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:41,905 INFO ]: Finished difference Result 70 states and 122 transitions. [2018-06-22 02:10:41,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 02:10:41,906 INFO ]: Start accepts. Automaton has 18 states. Word has length 16 [2018-06-22 02:10:41,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:41,906 INFO ]: With dead ends: 70 [2018-06-22 02:10:41,906 INFO ]: Without dead ends: 55 [2018-06-22 02:10:41,906 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=271, Invalid=851, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 02:10:41,906 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 02:10:41,909 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-06-22 02:10:41,909 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 02:10:41,909 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 51 transitions. [2018-06-22 02:10:41,909 INFO ]: Start accepts. Automaton has 32 states and 51 transitions. Word has length 16 [2018-06-22 02:10:41,909 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:41,909 INFO ]: Abstraction has 32 states and 51 transitions. [2018-06-22 02:10:41,909 INFO ]: Interpolant automaton has 18 states. [2018-06-22 02:10:41,910 INFO ]: Start isEmpty. Operand 32 states and 51 transitions. [2018-06-22 02:10:41,910 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:10:41,910 INFO ]: Found error trace [2018-06-22 02:10:41,910 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:41,910 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:41,910 INFO ]: Analyzing trace with hash -1947714340, now seen corresponding path program 8 times [2018-06-22 02:10:41,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:41,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:41,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:41,911 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:41,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:41,923 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:42,039 INFO ]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:42,039 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:42,039 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:42,048 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:42,093 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:42,093 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:42,095 INFO ]: Computing forward predicates... [2018-06-22 02:10:42,126 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:42,157 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:42,157 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 02:10:42,157 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:10:42,157 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:10:42,157 INFO ]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:10:42,157 INFO ]: Start difference. First operand 32 states and 51 transitions. Second operand 13 states. [2018-06-22 02:10:42,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:42,456 INFO ]: Finished difference Result 80 states and 133 transitions. [2018-06-22 02:10:42,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 02:10:42,456 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 02:10:42,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:42,457 INFO ]: With dead ends: 80 [2018-06-22 02:10:42,457 INFO ]: Without dead ends: 80 [2018-06-22 02:10:42,457 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:10:42,457 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 02:10:42,460 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 40. [2018-06-22 02:10:42,460 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 02:10:42,460 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 64 transitions. [2018-06-22 02:10:42,460 INFO ]: Start accepts. Automaton has 40 states and 64 transitions. Word has length 17 [2018-06-22 02:10:42,460 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:42,460 INFO ]: Abstraction has 40 states and 64 transitions. [2018-06-22 02:10:42,460 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:10:42,460 INFO ]: Start isEmpty. Operand 40 states and 64 transitions. [2018-06-22 02:10:42,461 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 02:10:42,461 INFO ]: Found error trace [2018-06-22 02:10:42,461 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:42,461 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:42,461 INFO ]: Analyzing trace with hash -255178922, now seen corresponding path program 9 times [2018-06-22 02:10:42,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:42,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:42,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:42,462 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:42,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:42,475 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:42,877 INFO ]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:42,877 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:42,877 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 02:10:42,891 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:42,946 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 02:10:42,946 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:42,948 INFO ]: Computing forward predicates... [2018-06-22 02:10:43,060 INFO ]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:10:43,094 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:43,094 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2018-06-22 02:10:43,094 INFO ]: Interpolant automaton has 20 states [2018-06-22 02:10:43,094 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 02:10:43,094 INFO ]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:10:43,095 INFO ]: Start difference. First operand 40 states and 64 transitions. Second operand 20 states. [2018-06-22 02:10:43,599 WARN ]: Spent 161.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-06-22 02:10:44,004 WARN ]: Spent 188.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-06-22 02:10:44,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:44,716 INFO ]: Finished difference Result 127 states and 222 transitions. [2018-06-22 02:10:44,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-22 02:10:44,718 INFO ]: Start accepts. Automaton has 20 states. Word has length 18 [2018-06-22 02:10:44,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:44,718 INFO ]: With dead ends: 127 [2018-06-22 02:10:44,718 INFO ]: Without dead ends: 61 [2018-06-22 02:10:44,719 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=419, Invalid=1743, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 02:10:44,719 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 02:10:44,721 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 33. [2018-06-22 02:10:44,721 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 02:10:44,722 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2018-06-22 02:10:44,722 INFO ]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 18 [2018-06-22 02:10:44,722 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:44,722 INFO ]: Abstraction has 33 states and 52 transitions. [2018-06-22 02:10:44,722 INFO ]: Interpolant automaton has 20 states. [2018-06-22 02:10:44,722 INFO ]: Start isEmpty. Operand 33 states and 52 transitions. [2018-06-22 02:10:44,722 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 02:10:44,722 INFO ]: Found error trace [2018-06-22 02:10:44,723 INFO ]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:44,723 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:44,723 INFO ]: Analyzing trace with hash 965268802, now seen corresponding path program 7 times [2018-06-22 02:10:44,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:44,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:44,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:44,723 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:44,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:44,739 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:45,073 INFO ]: Checked inductivity of 31 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:45,073 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:45,073 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:45,079 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:45,107 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:45,109 INFO ]: Computing forward predicates... [2018-06-22 02:10:45,150 INFO ]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:45,171 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:45,171 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-22 02:10:45,171 INFO ]: Interpolant automaton has 14 states [2018-06-22 02:10:45,171 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 02:10:45,171 INFO ]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:10:45,172 INFO ]: Start difference. First operand 33 states and 52 transitions. Second operand 14 states. [2018-06-22 02:10:45,304 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:45,304 INFO ]: Finished difference Result 78 states and 136 transitions. [2018-06-22 02:10:45,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:10:45,304 INFO ]: Start accepts. Automaton has 14 states. Word has length 18 [2018-06-22 02:10:45,304 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:45,304 INFO ]: With dead ends: 78 [2018-06-22 02:10:45,304 INFO ]: Without dead ends: 78 [2018-06-22 02:10:45,304 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:10:45,305 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 02:10:45,307 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 37. [2018-06-22 02:10:45,307 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 02:10:45,307 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 60 transitions. [2018-06-22 02:10:45,307 INFO ]: Start accepts. Automaton has 37 states and 60 transitions. Word has length 18 [2018-06-22 02:10:45,307 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:45,308 INFO ]: Abstraction has 37 states and 60 transitions. [2018-06-22 02:10:45,308 INFO ]: Interpolant automaton has 14 states. [2018-06-22 02:10:45,308 INFO ]: Start isEmpty. Operand 37 states and 60 transitions. [2018-06-22 02:10:45,308 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:10:45,308 INFO ]: Found error trace [2018-06-22 02:10:45,308 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:45,308 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:45,308 INFO ]: Analyzing trace with hash 1233226992, now seen corresponding path program 10 times [2018-06-22 02:10:45,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:45,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:45,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:45,309 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:45,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:45,330 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:45,468 INFO ]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:45,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:45,468 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:45,474 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:10:45,503 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:10:45,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:45,505 INFO ]: Computing forward predicates... [2018-06-22 02:10:45,578 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:45,600 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:45,601 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-06-22 02:10:45,601 INFO ]: Interpolant automaton has 21 states [2018-06-22 02:10:45,601 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 02:10:45,601 INFO ]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-06-22 02:10:45,601 INFO ]: Start difference. First operand 37 states and 60 transitions. Second operand 21 states. [2018-06-22 02:10:46,858 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:46,858 INFO ]: Finished difference Result 183 states and 331 transitions. [2018-06-22 02:10:46,858 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-06-22 02:10:46,858 INFO ]: Start accepts. Automaton has 21 states. Word has length 19 [2018-06-22 02:10:46,858 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:46,860 INFO ]: With dead ends: 183 [2018-06-22 02:10:46,860 INFO ]: Without dead ends: 183 [2018-06-22 02:10:46,861 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2290 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2063, Invalid=4579, Unknown=0, NotChecked=0, Total=6642 [2018-06-22 02:10:46,861 INFO ]: Start minimizeSevpa. Operand 183 states. [2018-06-22 02:10:46,865 INFO ]: Finished minimizeSevpa. Reduced states from 183 to 46. [2018-06-22 02:10:46,865 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 02:10:46,865 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 74 transitions. [2018-06-22 02:10:46,865 INFO ]: Start accepts. Automaton has 46 states and 74 transitions. Word has length 19 [2018-06-22 02:10:46,866 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:46,866 INFO ]: Abstraction has 46 states and 74 transitions. [2018-06-22 02:10:46,866 INFO ]: Interpolant automaton has 21 states. [2018-06-22 02:10:46,867 INFO ]: Start isEmpty. Operand 46 states and 74 transitions. [2018-06-22 02:10:46,867 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:10:46,867 INFO ]: Found error trace [2018-06-22 02:10:46,867 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:46,867 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:46,867 INFO ]: Analyzing trace with hash 2043601466, now seen corresponding path program 8 times [2018-06-22 02:10:46,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:46,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:46,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:46,868 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:46,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:46,883 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:47,590 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:10:47,590 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:47,590 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:47,596 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:47,631 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:47,631 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:47,635 INFO ]: Computing forward predicates... [2018-06-22 02:10:47,717 INFO ]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:10:47,738 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:47,738 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-06-22 02:10:47,738 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:10:47,738 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:10:47,738 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:10:47,739 INFO ]: Start difference. First operand 46 states and 74 transitions. Second operand 12 states. [2018-06-22 02:10:47,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:47,879 INFO ]: Finished difference Result 76 states and 133 transitions. [2018-06-22 02:10:47,880 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 02:10:47,880 INFO ]: Start accepts. Automaton has 12 states. Word has length 19 [2018-06-22 02:10:47,880 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:47,880 INFO ]: With dead ends: 76 [2018-06-22 02:10:47,880 INFO ]: Without dead ends: 76 [2018-06-22 02:10:47,880 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:10:47,880 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 02:10:47,883 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 57. [2018-06-22 02:10:47,883 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 02:10:47,883 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 96 transitions. [2018-06-22 02:10:47,883 INFO ]: Start accepts. Automaton has 57 states and 96 transitions. Word has length 19 [2018-06-22 02:10:47,884 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:47,884 INFO ]: Abstraction has 57 states and 96 transitions. [2018-06-22 02:10:47,884 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:10:47,884 INFO ]: Start isEmpty. Operand 57 states and 96 transitions. [2018-06-22 02:10:47,884 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:10:47,884 INFO ]: Found error trace [2018-06-22 02:10:47,884 INFO ]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:47,884 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:47,885 INFO ]: Analyzing trace with hash -147014736, now seen corresponding path program 9 times [2018-06-22 02:10:47,885 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:47,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:47,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:47,885 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:47,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:47,895 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:48,070 INFO ]: Checked inductivity of 36 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 02:10:48,070 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:48,070 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:48,076 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:10:48,106 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 02:10:48,106 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:48,109 INFO ]: Computing forward predicates... [2018-06-22 02:10:48,318 INFO ]: Checked inductivity of 36 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:10:48,338 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:48,338 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 18 [2018-06-22 02:10:48,338 INFO ]: Interpolant automaton has 18 states [2018-06-22 02:10:48,338 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 02:10:48,338 INFO ]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:10:48,339 INFO ]: Start difference. First operand 57 states and 96 transitions. Second operand 18 states. [2018-06-22 02:10:48,836 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:48,836 INFO ]: Finished difference Result 108 states and 188 transitions. [2018-06-22 02:10:48,836 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 02:10:48,836 INFO ]: Start accepts. Automaton has 18 states. Word has length 19 [2018-06-22 02:10:48,836 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:48,836 INFO ]: With dead ends: 108 [2018-06-22 02:10:48,836 INFO ]: Without dead ends: 61 [2018-06-22 02:10:48,837 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 02:10:48,837 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 02:10:48,840 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 47. [2018-06-22 02:10:48,840 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 02:10:48,841 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2018-06-22 02:10:48,841 INFO ]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 19 [2018-06-22 02:10:48,841 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:48,841 INFO ]: Abstraction has 47 states and 78 transitions. [2018-06-22 02:10:48,841 INFO ]: Interpolant automaton has 18 states. [2018-06-22 02:10:48,841 INFO ]: Start isEmpty. Operand 47 states and 78 transitions. [2018-06-22 02:10:48,842 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:10:48,842 INFO ]: Found error trace [2018-06-22 02:10:48,842 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:48,842 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:48,842 INFO ]: Analyzing trace with hash -430245438, now seen corresponding path program 11 times [2018-06-22 02:10:48,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:48,842 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:48,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:48,842 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:48,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:48,859 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:49,052 INFO ]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:49,052 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:49,052 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:49,058 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:10:49,095 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 02:10:49,095 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:49,098 INFO ]: Computing forward predicates... [2018-06-22 02:10:49,130 INFO ]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:49,151 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:49,151 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-22 02:10:49,151 INFO ]: Interpolant automaton has 17 states [2018-06-22 02:10:49,151 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 02:10:49,151 INFO ]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:10:49,151 INFO ]: Start difference. First operand 47 states and 78 transitions. Second operand 17 states. [2018-06-22 02:10:49,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:49,302 INFO ]: Finished difference Result 116 states and 216 transitions. [2018-06-22 02:10:49,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 02:10:49,305 INFO ]: Start accepts. Automaton has 17 states. Word has length 20 [2018-06-22 02:10:49,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:49,305 INFO ]: With dead ends: 116 [2018-06-22 02:10:49,306 INFO ]: Without dead ends: 45 [2018-06-22 02:10:49,306 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:10:49,306 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 02:10:49,308 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-22 02:10:49,308 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 02:10:49,308 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2018-06-22 02:10:49,308 INFO ]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 20 [2018-06-22 02:10:49,308 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:49,308 INFO ]: Abstraction has 45 states and 72 transitions. [2018-06-22 02:10:49,308 INFO ]: Interpolant automaton has 17 states. [2018-06-22 02:10:49,308 INFO ]: Start isEmpty. Operand 45 states and 72 transitions. [2018-06-22 02:10:49,309 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 02:10:49,309 INFO ]: Found error trace [2018-06-22 02:10:49,309 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:49,309 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:49,309 INFO ]: Analyzing trace with hash -296271652, now seen corresponding path program 12 times [2018-06-22 02:10:49,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:49,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:49,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:49,310 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:49,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:49,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:49,489 INFO ]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:49,489 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:49,490 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:49,497 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:10:49,537 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 02:10:49,538 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:49,540 INFO ]: Computing forward predicates... [2018-06-22 02:10:49,561 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:49,585 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:49,585 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-22 02:10:49,585 INFO ]: Interpolant automaton has 17 states [2018-06-22 02:10:49,585 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 02:10:49,585 INFO ]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:10:49,585 INFO ]: Start difference. First operand 45 states and 72 transitions. Second operand 17 states. [2018-06-22 02:10:49,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:49,820 INFO ]: Finished difference Result 110 states and 180 transitions. [2018-06-22 02:10:49,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 02:10:49,820 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 02:10:49,820 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:49,821 INFO ]: With dead ends: 110 [2018-06-22 02:10:49,821 INFO ]: Without dead ends: 110 [2018-06-22 02:10:49,821 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2018-06-22 02:10:49,821 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 02:10:49,824 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 49. [2018-06-22 02:10:49,824 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 02:10:49,824 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 80 transitions. [2018-06-22 02:10:49,824 INFO ]: Start accepts. Automaton has 49 states and 80 transitions. Word has length 21 [2018-06-22 02:10:49,824 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:49,824 INFO ]: Abstraction has 49 states and 80 transitions. [2018-06-22 02:10:49,824 INFO ]: Interpolant automaton has 17 states. [2018-06-22 02:10:49,824 INFO ]: Start isEmpty. Operand 49 states and 80 transitions. [2018-06-22 02:10:49,825 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 02:10:49,825 INFO ]: Found error trace [2018-06-22 02:10:49,825 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:49,825 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:49,825 INFO ]: Analyzing trace with hash -600063146, now seen corresponding path program 13 times [2018-06-22 02:10:49,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:49,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:49,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:49,826 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:49,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:49,843 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:50,374 INFO ]: Checked inductivity of 56 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:50,374 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:50,374 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:50,379 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:50,417 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:50,420 INFO ]: Computing forward predicates... [2018-06-22 02:10:50,450 INFO ]: Checked inductivity of 56 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:50,484 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:50,484 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-22 02:10:50,484 INFO ]: Interpolant automaton has 19 states [2018-06-22 02:10:50,485 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 02:10:50,485 INFO ]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:10:50,485 INFO ]: Start difference. First operand 49 states and 80 transitions. Second operand 19 states. [2018-06-22 02:10:50,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:50,655 INFO ]: Finished difference Result 139 states and 260 transitions. [2018-06-22 02:10:50,655 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 02:10:50,655 INFO ]: Start accepts. Automaton has 19 states. Word has length 22 [2018-06-22 02:10:50,655 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:50,656 INFO ]: With dead ends: 139 [2018-06-22 02:10:50,656 INFO ]: Without dead ends: 44 [2018-06-22 02:10:50,656 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2018-06-22 02:10:50,656 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 02:10:50,657 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-06-22 02:10:50,658 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 02:10:50,658 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2018-06-22 02:10:50,658 INFO ]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 22 [2018-06-22 02:10:50,658 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:50,658 INFO ]: Abstraction has 37 states and 61 transitions. [2018-06-22 02:10:50,658 INFO ]: Interpolant automaton has 19 states. [2018-06-22 02:10:50,658 INFO ]: Start isEmpty. Operand 37 states and 61 transitions. [2018-06-22 02:10:50,658 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:10:50,658 INFO ]: Found error trace [2018-06-22 02:10:50,658 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:50,659 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:50,659 INFO ]: Analyzing trace with hash -700273680, now seen corresponding path program 14 times [2018-06-22 02:10:50,659 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:50,659 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:50,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:50,659 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:50,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:50,672 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:51,344 INFO ]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:51,344 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:51,344 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:51,350 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:51,392 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:51,392 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:51,395 INFO ]: Computing forward predicates... [2018-06-22 02:10:51,415 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:51,435 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:51,435 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-22 02:10:51,435 INFO ]: Interpolant automaton has 19 states [2018-06-22 02:10:51,435 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 02:10:51,435 INFO ]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:10:51,436 INFO ]: Start difference. First operand 37 states and 61 transitions. Second operand 19 states. [2018-06-22 02:10:51,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:51,839 INFO ]: Finished difference Result 121 states and 193 transitions. [2018-06-22 02:10:51,839 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 02:10:51,839 INFO ]: Start accepts. Automaton has 19 states. Word has length 23 [2018-06-22 02:10:51,839 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:51,840 INFO ]: With dead ends: 121 [2018-06-22 02:10:51,840 INFO ]: Without dead ends: 121 [2018-06-22 02:10:51,840 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=391, Invalid=731, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 02:10:51,840 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-22 02:10:51,843 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 49. [2018-06-22 02:10:51,843 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 02:10:51,843 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2018-06-22 02:10:51,843 INFO ]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 23 [2018-06-22 02:10:51,844 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:51,844 INFO ]: Abstraction has 49 states and 78 transitions. [2018-06-22 02:10:51,844 INFO ]: Interpolant automaton has 19 states. [2018-06-22 02:10:51,844 INFO ]: Start isEmpty. Operand 49 states and 78 transitions. [2018-06-22 02:10:51,844 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:10:51,844 INFO ]: Found error trace [2018-06-22 02:10:51,844 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:51,844 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:51,844 INFO ]: Analyzing trace with hash -906998726, now seen corresponding path program 10 times [2018-06-22 02:10:51,844 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:51,844 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:51,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:51,845 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:51,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:51,864 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:52,071 INFO ]: Checked inductivity of 64 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 02:10:52,071 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:52,071 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:52,093 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:10:52,147 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:10:52,147 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:52,154 INFO ]: Computing forward predicates... [2018-06-22 02:10:52,329 INFO ]: Checked inductivity of 64 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 02:10:52,349 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:52,349 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2018-06-22 02:10:52,349 INFO ]: Interpolant automaton has 14 states [2018-06-22 02:10:52,349 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 02:10:52,349 INFO ]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:10:52,349 INFO ]: Start difference. First operand 49 states and 78 transitions. Second operand 14 states. [2018-06-22 02:10:52,563 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:52,563 INFO ]: Finished difference Result 88 states and 155 transitions. [2018-06-22 02:10:52,566 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 02:10:52,566 INFO ]: Start accepts. Automaton has 14 states. Word has length 23 [2018-06-22 02:10:52,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:52,567 INFO ]: With dead ends: 88 [2018-06-22 02:10:52,567 INFO ]: Without dead ends: 88 [2018-06-22 02:10:52,567 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:10:52,567 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 02:10:52,569 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 61. [2018-06-22 02:10:52,569 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 02:10:52,570 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 102 transitions. [2018-06-22 02:10:52,570 INFO ]: Start accepts. Automaton has 61 states and 102 transitions. Word has length 23 [2018-06-22 02:10:52,570 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:52,570 INFO ]: Abstraction has 61 states and 102 transitions. [2018-06-22 02:10:52,570 INFO ]: Interpolant automaton has 14 states. [2018-06-22 02:10:52,570 INFO ]: Start isEmpty. Operand 61 states and 102 transitions. [2018-06-22 02:10:52,570 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 02:10:52,570 INFO ]: Found error trace [2018-06-22 02:10:52,571 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:52,571 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:52,571 INFO ]: Analyzing trace with hash -239224126, now seen corresponding path program 15 times [2018-06-22 02:10:52,571 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:52,571 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:52,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:52,571 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:52,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:52,587 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:53,356 INFO ]: Checked inductivity of 72 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:53,356 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:53,356 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:53,362 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:10:53,420 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 02:10:53,420 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:53,424 INFO ]: Computing forward predicates... [2018-06-22 02:10:53,555 INFO ]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 02:10:53,580 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:53,580 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 29 [2018-06-22 02:10:53,580 INFO ]: Interpolant automaton has 29 states [2018-06-22 02:10:53,581 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 02:10:53,581 INFO ]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2018-06-22 02:10:53,581 INFO ]: Start difference. First operand 61 states and 102 transitions. Second operand 29 states. [2018-06-22 02:10:54,146 WARN ]: Spent 154.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-06-22 02:10:55,142 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 02:10:55,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:55,899 INFO ]: Finished difference Result 283 states and 518 transitions. [2018-06-22 02:10:55,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-06-22 02:10:55,906 INFO ]: Start accepts. Automaton has 29 states. Word has length 24 [2018-06-22 02:10:55,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:55,907 INFO ]: With dead ends: 283 [2018-06-22 02:10:55,907 INFO ]: Without dead ends: 94 [2018-06-22 02:10:55,909 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1918 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1189, Invalid=5617, Unknown=0, NotChecked=0, Total=6806 [2018-06-22 02:10:55,909 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 02:10:55,912 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 59. [2018-06-22 02:10:55,912 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 02:10:55,912 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 96 transitions. [2018-06-22 02:10:55,913 INFO ]: Start accepts. Automaton has 59 states and 96 transitions. Word has length 24 [2018-06-22 02:10:55,913 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:55,913 INFO ]: Abstraction has 59 states and 96 transitions. [2018-06-22 02:10:55,913 INFO ]: Interpolant automaton has 29 states. [2018-06-22 02:10:55,913 INFO ]: Start isEmpty. Operand 59 states and 96 transitions. [2018-06-22 02:10:55,913 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 02:10:55,913 INFO ]: Found error trace [2018-06-22 02:10:55,913 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:55,913 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:55,913 INFO ]: Analyzing trace with hash -2052266788, now seen corresponding path program 16 times [2018-06-22 02:10:55,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:55,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:55,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:55,917 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:55,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:55,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:56,285 INFO ]: Checked inductivity of 81 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:56,286 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:56,286 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:56,305 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:10:56,349 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:10:56,349 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:56,352 INFO ]: Computing forward predicates... [2018-06-22 02:10:56,372 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:56,392 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:56,392 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-22 02:10:56,392 INFO ]: Interpolant automaton has 21 states [2018-06-22 02:10:56,392 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 02:10:56,393 INFO ]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-06-22 02:10:56,393 INFO ]: Start difference. First operand 59 states and 96 transitions. Second operand 21 states. [2018-06-22 02:10:56,698 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:56,698 INFO ]: Finished difference Result 149 states and 239 transitions. [2018-06-22 02:10:56,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 02:10:56,699 INFO ]: Start accepts. Automaton has 21 states. Word has length 25 [2018-06-22 02:10:56,699 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:56,699 INFO ]: With dead ends: 149 [2018-06-22 02:10:56,699 INFO ]: Without dead ends: 149 [2018-06-22 02:10:56,700 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=489, Invalid=917, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 02:10:56,700 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-22 02:10:56,703 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 63. [2018-06-22 02:10:56,703 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 02:10:56,704 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 104 transitions. [2018-06-22 02:10:56,704 INFO ]: Start accepts. Automaton has 63 states and 104 transitions. Word has length 25 [2018-06-22 02:10:56,704 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:56,704 INFO ]: Abstraction has 63 states and 104 transitions. [2018-06-22 02:10:56,704 INFO ]: Interpolant automaton has 21 states. [2018-06-22 02:10:56,704 INFO ]: Start isEmpty. Operand 63 states and 104 transitions. [2018-06-22 02:10:56,704 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 02:10:56,704 INFO ]: Found error trace [2018-06-22 02:10:56,704 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:56,704 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:56,704 INFO ]: Analyzing trace with hash 798662486, now seen corresponding path program 17 times [2018-06-22 02:10:56,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:56,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:56,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:56,706 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:56,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:56,723 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:56,972 INFO ]: Checked inductivity of 90 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:56,973 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:56,973 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:56,978 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:10:57,029 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 02:10:57,029 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:57,032 INFO ]: Computing forward predicates... [2018-06-22 02:10:57,128 INFO ]: Checked inductivity of 90 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:57,161 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:57,161 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-22 02:10:57,162 INFO ]: Interpolant automaton has 23 states [2018-06-22 02:10:57,162 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 02:10:57,162 INFO ]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-06-22 02:10:57,162 INFO ]: Start difference. First operand 63 states and 104 transitions. Second operand 23 states. [2018-06-22 02:10:57,902 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:57,902 INFO ]: Finished difference Result 209 states and 396 transitions. [2018-06-22 02:10:57,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 02:10:57,902 INFO ]: Start accepts. Automaton has 23 states. Word has length 26 [2018-06-22 02:10:57,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:57,903 INFO ]: With dead ends: 209 [2018-06-22 02:10:57,903 INFO ]: Without dead ends: 56 [2018-06-22 02:10:57,903 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 02:10:57,903 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 02:10:57,904 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 47. [2018-06-22 02:10:57,904 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 02:10:57,904 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. [2018-06-22 02:10:57,904 INFO ]: Start accepts. Automaton has 47 states and 79 transitions. Word has length 26 [2018-06-22 02:10:57,905 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:57,905 INFO ]: Abstraction has 47 states and 79 transitions. [2018-06-22 02:10:57,905 INFO ]: Interpolant automaton has 23 states. [2018-06-22 02:10:57,905 INFO ]: Start isEmpty. Operand 47 states and 79 transitions. [2018-06-22 02:10:57,905 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 02:10:57,905 INFO ]: Found error trace [2018-06-22 02:10:57,905 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:57,905 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:57,905 INFO ]: Analyzing trace with hash -2073580816, now seen corresponding path program 18 times [2018-06-22 02:10:57,905 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:57,905 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:57,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:57,906 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:57,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:57,922 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:58,560 INFO ]: Checked inductivity of 100 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:58,560 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:58,560 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:58,566 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:10:58,636 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 02:10:58,637 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:58,640 INFO ]: Computing forward predicates... [2018-06-22 02:10:58,793 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:58,813 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:58,813 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 33 [2018-06-22 02:10:58,813 INFO ]: Interpolant automaton has 33 states [2018-06-22 02:10:58,814 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 02:10:58,814 INFO ]: CoverageRelationStatistics Valid=199, Invalid=857, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 02:10:58,814 INFO ]: Start difference. First operand 47 states and 79 transitions. Second operand 33 states. [2018-06-22 02:11:01,580 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:01,581 INFO ]: Finished difference Result 373 states and 676 transitions. [2018-06-22 02:11:01,585 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-06-22 02:11:01,585 INFO ]: Start accepts. Automaton has 33 states. Word has length 27 [2018-06-22 02:11:01,585 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:01,588 INFO ]: With dead ends: 373 [2018-06-22 02:11:01,589 INFO ]: Without dead ends: 373 [2018-06-22 02:11:01,594 INFO ]: 0 DeclaredPredicates, 167 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9557 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=7063, Invalid=15889, Unknown=0, NotChecked=0, Total=22952 [2018-06-22 02:11:01,595 INFO ]: Start minimizeSevpa. Operand 373 states. [2018-06-22 02:11:01,600 INFO ]: Finished minimizeSevpa. Reduced states from 373 to 61. [2018-06-22 02:11:01,600 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 02:11:01,600 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 98 transitions. [2018-06-22 02:11:01,600 INFO ]: Start accepts. Automaton has 61 states and 98 transitions. Word has length 27 [2018-06-22 02:11:01,601 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:01,601 INFO ]: Abstraction has 61 states and 98 transitions. [2018-06-22 02:11:01,601 INFO ]: Interpolant automaton has 33 states. [2018-06-22 02:11:01,601 INFO ]: Start isEmpty. Operand 61 states and 98 transitions. [2018-06-22 02:11:01,601 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 02:11:01,601 INFO ]: Found error trace [2018-06-22 02:11:01,601 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:01,601 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:01,601 INFO ]: Analyzing trace with hash -1403513286, now seen corresponding path program 11 times [2018-06-22 02:11:01,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:01,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:01,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:01,602 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:01,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:01,658 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:02,399 INFO ]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 02:11:02,399 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:02,399 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:02,409 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:11:02,512 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 02:11:02,512 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:02,519 INFO ]: Computing forward predicates... [2018-06-22 02:11:02,998 INFO ]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 02:11:03,019 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:03,019 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2018-06-22 02:11:03,019 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:11:03,019 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:11:03,019 INFO ]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:11:03,019 INFO ]: Start difference. First operand 61 states and 98 transitions. Second operand 16 states. [2018-06-22 02:11:03,297 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:03,297 INFO ]: Finished difference Result 110 states and 195 transitions. [2018-06-22 02:11:03,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 02:11:03,298 INFO ]: Start accepts. Automaton has 16 states. Word has length 27 [2018-06-22 02:11:03,298 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:03,298 INFO ]: With dead ends: 110 [2018-06-22 02:11:03,298 INFO ]: Without dead ends: 110 [2018-06-22 02:11:03,298 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:11:03,298 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 02:11:03,301 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 75. [2018-06-22 02:11:03,301 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 02:11:03,302 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 126 transitions. [2018-06-22 02:11:03,302 INFO ]: Start accepts. Automaton has 75 states and 126 transitions. Word has length 27 [2018-06-22 02:11:03,303 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:03,303 INFO ]: Abstraction has 75 states and 126 transitions. [2018-06-22 02:11:03,303 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:11:03,303 INFO ]: Start isEmpty. Operand 75 states and 126 transitions. [2018-06-22 02:11:03,303 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 02:11:03,303 INFO ]: Found error trace [2018-06-22 02:11:03,303 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:03,303 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:03,303 INFO ]: Analyzing trace with hash 137927618, now seen corresponding path program 19 times [2018-06-22 02:11:03,303 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:03,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:03,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:03,304 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:03,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:03,323 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:04,281 INFO ]: Checked inductivity of 110 backedges. 45 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:04,281 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:04,281 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:04,288 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:04,338 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:04,342 INFO ]: Computing forward predicates... [2018-06-22 02:11:04,369 INFO ]: Checked inductivity of 110 backedges. 45 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:04,399 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:04,399 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-22 02:11:04,399 INFO ]: Interpolant automaton has 25 states [2018-06-22 02:11:04,399 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 02:11:04,399 INFO ]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:11:04,399 INFO ]: Start difference. First operand 75 states and 126 transitions. Second operand 25 states. [2018-06-22 02:11:04,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:04,806 INFO ]: Finished difference Result 259 states and 494 transitions. [2018-06-22 02:11:04,806 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 02:11:04,806 INFO ]: Start accepts. Automaton has 25 states. Word has length 28 [2018-06-22 02:11:04,806 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:04,807 INFO ]: With dead ends: 259 [2018-06-22 02:11:04,807 INFO ]: Without dead ends: 73 [2018-06-22 02:11:04,807 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=323, Invalid=937, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 02:11:04,807 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 02:11:04,809 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-06-22 02:11:04,809 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 02:11:04,810 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2018-06-22 02:11:04,810 INFO ]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 28 [2018-06-22 02:11:04,811 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:04,811 INFO ]: Abstraction has 73 states and 120 transitions. [2018-06-22 02:11:04,811 INFO ]: Interpolant automaton has 25 states. [2018-06-22 02:11:04,811 INFO ]: Start isEmpty. Operand 73 states and 120 transitions. [2018-06-22 02:11:04,811 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 02:11:04,811 INFO ]: Found error trace [2018-06-22 02:11:04,811 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:04,811 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:04,811 INFO ]: Analyzing trace with hash 1576085724, now seen corresponding path program 20 times [2018-06-22 02:11:04,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:04,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:04,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:04,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:04,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:04,837 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:05,128 INFO ]: Checked inductivity of 121 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:05,128 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:05,128 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:05,134 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:11:05,184 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:11:05,184 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:05,188 INFO ]: Computing forward predicates... [2018-06-22 02:11:05,424 INFO ]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:05,445 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:05,445 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 36 [2018-06-22 02:11:05,445 INFO ]: Interpolant automaton has 36 states [2018-06-22 02:11:05,446 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 02:11:05,446 INFO ]: CoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 02:11:05,446 INFO ]: Start difference. First operand 73 states and 120 transitions. Second operand 36 states. [2018-06-22 02:11:08,222 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:08,222 INFO ]: Finished difference Result 448 states and 814 transitions. [2018-06-22 02:11:08,222 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-06-22 02:11:08,222 INFO ]: Start accepts. Automaton has 36 states. Word has length 29 [2018-06-22 02:11:08,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:08,224 INFO ]: With dead ends: 448 [2018-06-22 02:11:08,224 INFO ]: Without dead ends: 448 [2018-06-22 02:11:08,226 INFO ]: 0 DeclaredPredicates, 194 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13714 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=9617, Invalid=21889, Unknown=0, NotChecked=0, Total=31506 [2018-06-22 02:11:08,227 INFO ]: Start minimizeSevpa. Operand 448 states. [2018-06-22 02:11:08,231 INFO ]: Finished minimizeSevpa. Reduced states from 448 to 77. [2018-06-22 02:11:08,231 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 02:11:08,231 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 128 transitions. [2018-06-22 02:11:08,232 INFO ]: Start accepts. Automaton has 77 states and 128 transitions. Word has length 29 [2018-06-22 02:11:08,232 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:08,232 INFO ]: Abstraction has 77 states and 128 transitions. [2018-06-22 02:11:08,232 INFO ]: Interpolant automaton has 36 states. [2018-06-22 02:11:08,232 INFO ]: Start isEmpty. Operand 77 states and 128 transitions. [2018-06-22 02:11:08,232 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 02:11:08,232 INFO ]: Found error trace [2018-06-22 02:11:08,232 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:08,232 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:08,232 INFO ]: Analyzing trace with hash 1608440662, now seen corresponding path program 21 times [2018-06-22 02:11:08,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:08,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:08,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:08,233 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:08,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:08,252 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:08,672 INFO ]: Checked inductivity of 132 backedges. 55 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:08,672 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:08,672 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:08,679 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:11:08,744 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 02:11:08,744 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:08,749 INFO ]: Computing forward predicates... [2018-06-22 02:11:08,971 INFO ]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:08,991 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:08,991 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 38 [2018-06-22 02:11:08,991 INFO ]: Interpolant automaton has 38 states [2018-06-22 02:11:08,991 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 02:11:08,991 INFO ]: CoverageRelationStatistics Valid=272, Invalid=1134, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 02:11:08,992 INFO ]: Start difference. First operand 77 states and 128 transitions. Second operand 38 states. [2018-06-22 02:11:10,794 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:10,794 INFO ]: Finished difference Result 224 states and 290 transitions. [2018-06-22 02:11:10,796 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-06-22 02:11:10,796 INFO ]: Start accepts. Automaton has 38 states. Word has length 30 [2018-06-22 02:11:10,796 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:10,796 INFO ]: With dead ends: 224 [2018-06-22 02:11:10,796 INFO ]: Without dead ends: 68 [2018-06-22 02:11:10,798 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3541 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3808, Invalid=9532, Unknown=0, NotChecked=0, Total=13340 [2018-06-22 02:11:10,798 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 02:11:10,800 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-06-22 02:11:10,800 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 02:11:10,800 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 97 transitions. [2018-06-22 02:11:10,800 INFO ]: Start accepts. Automaton has 57 states and 97 transitions. Word has length 30 [2018-06-22 02:11:10,800 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:10,800 INFO ]: Abstraction has 57 states and 97 transitions. [2018-06-22 02:11:10,800 INFO ]: Interpolant automaton has 38 states. [2018-06-22 02:11:10,800 INFO ]: Start isEmpty. Operand 57 states and 97 transitions. [2018-06-22 02:11:10,800 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 02:11:10,800 INFO ]: Found error trace [2018-06-22 02:11:10,801 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:10,801 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:10,802 INFO ]: Analyzing trace with hash 698911216, now seen corresponding path program 22 times [2018-06-22 02:11:10,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:10,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:10,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:10,802 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:10,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:10,822 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:11,175 INFO ]: Checked inductivity of 144 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:11,175 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:11,175 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:11,182 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:11:11,237 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:11:11,237 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:11,241 INFO ]: Computing forward predicates... [2018-06-22 02:11:11,463 INFO ]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:11,483 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:11,484 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 39 [2018-06-22 02:11:11,484 INFO ]: Interpolant automaton has 39 states [2018-06-22 02:11:11,484 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 02:11:11,484 INFO ]: CoverageRelationStatistics Valid=274, Invalid=1208, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 02:11:11,484 INFO ]: Start difference. First operand 57 states and 97 transitions. Second operand 39 states. [2018-06-22 02:11:15,200 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:15,200 INFO ]: Finished difference Result 528 states and 961 transitions. [2018-06-22 02:11:15,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-06-22 02:11:15,200 INFO ]: Start accepts. Automaton has 39 states. Word has length 31 [2018-06-22 02:11:15,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:15,202 INFO ]: With dead ends: 528 [2018-06-22 02:11:15,202 INFO ]: Without dead ends: 528 [2018-06-22 02:11:15,205 INFO ]: 0 DeclaredPredicates, 223 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19095 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=12793, Invalid=29437, Unknown=0, NotChecked=0, Total=42230 [2018-06-22 02:11:15,205 INFO ]: Start minimizeSevpa. Operand 528 states. [2018-06-22 02:11:15,211 INFO ]: Finished minimizeSevpa. Reduced states from 528 to 73. [2018-06-22 02:11:15,211 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 02:11:15,212 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 118 transitions. [2018-06-22 02:11:15,212 INFO ]: Start accepts. Automaton has 73 states and 118 transitions. Word has length 31 [2018-06-22 02:11:15,212 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:15,212 INFO ]: Abstraction has 73 states and 118 transitions. [2018-06-22 02:11:15,212 INFO ]: Interpolant automaton has 39 states. [2018-06-22 02:11:15,212 INFO ]: Start isEmpty. Operand 73 states and 118 transitions. [2018-06-22 02:11:15,212 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 02:11:15,212 INFO ]: Found error trace [2018-06-22 02:11:15,212 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:15,212 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:15,212 INFO ]: Analyzing trace with hash -1048690630, now seen corresponding path program 12 times [2018-06-22 02:11:15,212 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:15,212 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:15,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:15,213 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:15,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:15,240 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:15,625 INFO ]: Checked inductivity of 144 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 02:11:15,625 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:15,625 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:15,631 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:11:15,712 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 02:11:15,712 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:15,719 INFO ]: Computing forward predicates... [2018-06-22 02:11:16,526 WARN ]: unable to prove that (exists ((v_gotoProc_hhv_INV_MAIN_2_2_Int_49 Int) (v_gotoProc_hbv_INV_MAIN_2_1_Int_152 Int)) (let ((.cse0 (+ v_gotoProc_hbv_INV_MAIN_2_1_Int_152 8)) (.cse2 (+ v_gotoProc_hhv_INV_MAIN_2_2_Int_49 9)) (.cse1 (+ c_gotoProc_hhv_INV_MAIN_2_2_Int c_gotoProc_hhv_INV_MAIN_2_1_Int))) (and (<= .cse0 c_gotoProc_hhv_INV_MAIN_2_4_Int) (<= .cse1 .cse2) (not (= (+ (* 10 v_gotoProc_hhv_INV_MAIN_2_2_Int_49) 9) (+ (* 9 c_gotoProc_hhv_INV_MAIN_2_2_Int) c_gotoProc_hhv_INV_MAIN_2_5_Int (* 9 v_gotoProc_hbv_INV_MAIN_2_1_Int_152)))) (<= c_gotoProc_hhv_INV_MAIN_2_4_Int .cse0) (<= .cse2 .cse1)))) is different from true [2018-06-22 02:11:16,944 WARN ]: unable to prove that (exists ((v_gotoProc_hhv_INV_MAIN_2_2_Int_49 Int) (v_gotoProc_hbv_INV_MAIN_2_1_Int_152 Int)) (let ((.cse2 (+ v_gotoProc_hhv_INV_MAIN_2_2_Int_49 9)) (.cse1 (+ c_gotoProc_hhv_INV_MAIN_2_0_Int c_gotoProc_hhv_INV_MAIN_2_2_Int c_gotoProc_hhv_INV_MAIN_2_1_Int)) (.cse0 (+ v_gotoProc_hbv_INV_MAIN_2_1_Int_152 8))) (and (<= .cse0 c_gotoProc_hhv_INV_MAIN_2_4_Int) (<= .cse1 .cse2) (<= .cse2 .cse1) (<= c_gotoProc_hhv_INV_MAIN_2_4_Int .cse0) (not (= (+ (* 9 c_gotoProc_hhv_INV_MAIN_2_0_Int) (* 9 c_gotoProc_hhv_INV_MAIN_2_2_Int) c_gotoProc_hhv_INV_MAIN_2_5_Int c_gotoProc_hhv_INV_MAIN_2_3_Int (* 9 v_gotoProc_hbv_INV_MAIN_2_1_Int_152)) (+ (* 10 v_gotoProc_hhv_INV_MAIN_2_2_Int_49) 9)))))) is different from true [2018-06-22 02:11:26,360 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-22 02:11:28,526 WARN ]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-06-22 02:11:30,801 WARN ]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 35 Received shutdown request... [2018-06-22 02:11:31,748 INFO ]: Timeout while computing interpolants [2018-06-22 02:11:31,949 WARN ]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:31,949 WARN ]: Verification canceled [2018-06-22 02:11:31,952 WARN ]: Timeout [2018-06-22 02:11:31,953 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:11:31 BoogieIcfgContainer [2018-06-22 02:11:31,953 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:11:31,969 INFO ]: Toolchain (without parser) took 61764.44 ms. Allocated memory was 308.8 MB in the beginning and 745.0 MB in the end (delta: 436.2 MB). Free memory was 264.3 MB in the beginning and 646.7 MB in the end (delta: -382.4 MB). Peak memory consumption was 53.8 MB. Max. memory is 3.6 GB. [2018-06-22 02:11:31,970 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:11:31,970 INFO ]: ChcToBoogie took 70.09 ms. Allocated memory is still 308.8 MB. Free memory was 264.3 MB in the beginning and 262.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:11:31,970 INFO ]: Boogie Preprocessor took 33.59 ms. Allocated memory is still 308.8 MB. Free memory was 262.3 MB in the beginning and 260.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:11:31,971 INFO ]: RCFGBuilder took 344.01 ms. Allocated memory is still 308.8 MB. Free memory was 260.3 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:11:31,971 INFO ]: TraceAbstraction took 61301.75 ms. Allocated memory was 308.8 MB in the beginning and 745.0 MB in the end (delta: 436.2 MB). Free memory was 250.3 MB in the beginning and 646.7 MB in the end (delta: -396.4 MB). Peak memory consumption was 39.8 MB. Max. memory is 3.6 GB. [2018-06-22 02:11:31,973 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 70.09 ms. Allocated memory is still 308.8 MB. Free memory was 264.3 MB in the beginning and 262.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 33.59 ms. Allocated memory is still 308.8 MB. Free memory was 262.3 MB in the beginning and 260.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 344.01 ms. Allocated memory is still 308.8 MB. Free memory was 260.3 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61301.75 ms. Allocated memory was 308.8 MB in the beginning and 745.0 MB in the end (delta: 436.2 MB). Free memory was 250.3 MB in the beginning and 646.7 MB in the end (delta: -396.4 MB). Peak memory consumption was 39.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 33 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 11 locations, 1 error locations. TIMEOUT Result, 61.2s OverallTime, 41 OverallIterations, 12 TraceHistogramMax, 24.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 401 SDtfs, 822 SDslu, 2578 SDs, 0 SdLazy, 7978 SolverSat, 2443 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1999 GetRequests, 574 SyntacticMatches, 35 SemanticMatches, 1390 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52630 ImplicationChecksByTransitivity, 29.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 1929 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 1362 NumberOfCodeBlocks, 1362 NumberOfCodeBlocksAsserted, 131 NumberOfCheckSat, 1287 ConstructedInterpolants, 0 QuantifiedInterpolants, 121229 SizeOfPredicates, 142 NumberOfNonLiveVariables, 10550 ConjunctsInSsa, 1800 ConjunctsInUnsatCore, 75 InterpolantComputations, 5 PerfectInterpolantSequences, 1433/3141 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-11-31-990.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-11-31-990.csv Completed graceful shutdown