java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:57:15,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:57:15,881 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:57:15,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:57:15,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:57:15,896 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:57:15,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:57:15,900 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:57:15,902 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:57:15,902 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:57:15,904 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:57:15,904 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:57:15,905 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:57:15,906 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:57:15,909 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:57:15,910 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:57:15,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:57:15,920 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:57:15,922 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:57:15,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:57:15,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:57:15,929 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:57:15,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:57:15,929 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:57:15,930 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:57:15,931 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:57:15,931 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:57:15,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:57:15,934 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:57:15,934 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:57:15,935 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:57:15,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:57:15,940 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:57:15,941 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:57:15,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:57:15,942 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:57:15,961 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:57:15,962 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:57:15,962 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:57:15,962 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:57:15,963 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:57:15,963 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:57:15,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:57:15,964 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:57:15,964 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:57:15,964 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:57:15,964 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:57:15,965 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:57:15,967 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:57:15,968 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:57:15,968 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:57:15,968 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:57:15,968 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:57:15,968 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:57:15,968 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:57:15,970 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:57:15,970 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:57:16,020 INFO ]: Repository-Root is: /tmp [2018-06-22 11:57:16,034 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:57:16,038 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:57:16,040 INFO ]: Initializing SmtParser... [2018-06-22 11:57:16,040 INFO ]: SmtParser initialized [2018-06-22 11:57:16,041 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big.smt2 [2018-06-22 11:57:16,042 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:57:16,127 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@5163ee95 [2018-06-22 11:57:16,338 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big.smt2 [2018-06-22 11:57:16,343 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:57:16,350 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:57:16,350 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:57:16,350 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:57:16,350 INFO ]: ChcToBoogie initialized [2018-06-22 11:57:16,354 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:57:16" (1/1) ... [2018-06-22 11:57:16,398 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:16 Unit [2018-06-22 11:57:16,399 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:57:16,399 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:57:16,399 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:57:16,399 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:57:16,422 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:16" (1/1) ... [2018-06-22 11:57:16,422 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:16" (1/1) ... [2018-06-22 11:57:16,428 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:16" (1/1) ... [2018-06-22 11:57:16,429 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:16" (1/1) ... [2018-06-22 11:57:16,432 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:16" (1/1) ... [2018-06-22 11:57:16,433 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:16" (1/1) ... [2018-06-22 11:57:16,434 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:16" (1/1) ... [2018-06-22 11:57:16,436 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:57:16,436 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:57:16,436 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:57:16,436 INFO ]: RCFGBuilder initialized [2018-06-22 11:57:16,437 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:57:16,456 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:57:16,456 INFO ]: Found specification of procedure False [2018-06-22 11:57:16,456 INFO ]: Found implementation of procedure False [2018-06-22 11:57:16,456 INFO ]: Specification and implementation of procedure INV_MAIN_2 given in one single declaration [2018-06-22 11:57:16,456 INFO ]: Found specification of procedure INV_MAIN_2 [2018-06-22 11:57:16,456 INFO ]: Found implementation of procedure INV_MAIN_2 [2018-06-22 11:57:16,456 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-22 11:57:16,456 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-22 11:57:16,457 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-22 11:57:16,457 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:57:16,457 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:57:16,457 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:57:16,797 INFO ]: Using library mode [2018-06-22 11:57:16,797 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:57:16 BoogieIcfgContainer [2018-06-22 11:57:16,797 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:57:16,798 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:57:16,798 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:57:16,801 INFO ]: TraceAbstraction initialized [2018-06-22 11:57:16,801 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:57:16" (1/3) ... [2018-06-22 11:57:16,802 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d08d2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:57:16, skipping insertion in model container [2018-06-22 11:57:16,802 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:16" (2/3) ... [2018-06-22 11:57:16,802 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d08d2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:57:16, skipping insertion in model container [2018-06-22 11:57:16,803 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:57:16" (3/3) ... [2018-06-22 11:57:16,804 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:57:16,813 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:57:16,822 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:57:16,868 INFO ]: Using default assertion order modulation [2018-06-22 11:57:16,869 INFO ]: Interprodecural is true [2018-06-22 11:57:16,869 INFO ]: Hoare is false [2018-06-22 11:57:16,869 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:57:16,869 INFO ]: Backedges is TWOTRACK [2018-06-22 11:57:16,869 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:57:16,869 INFO ]: Difference is false [2018-06-22 11:57:16,869 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:57:16,869 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:57:16,885 INFO ]: Start isEmpty. Operand 22 states. [2018-06-22 11:57:16,896 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:57:16,896 INFO ]: Found error trace [2018-06-22 11:57:16,897 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:16,897 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:16,902 INFO ]: Analyzing trace with hash -1139565346, now seen corresponding path program 1 times [2018-06-22 11:57:16,903 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:16,905 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:16,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:16,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:16,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:16,972 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:17,093 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:57:17,095 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:57:17,095 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:57:17,096 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:57:17,106 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:57:17,106 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:57:17,108 INFO ]: Start difference. First operand 22 states. Second operand 5 states. [2018-06-22 11:57:17,327 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:17,327 INFO ]: Finished difference Result 24 states and 40 transitions. [2018-06-22 11:57:17,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:57:17,330 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:57:17,330 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:17,342 INFO ]: With dead ends: 24 [2018-06-22 11:57:17,342 INFO ]: Without dead ends: 24 [2018-06-22 11:57:17,345 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:57:17,363 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:57:17,403 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 11:57:17,404 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:57:17,406 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 40 transitions. [2018-06-22 11:57:17,409 INFO ]: Start accepts. Automaton has 24 states and 40 transitions. Word has length 13 [2018-06-22 11:57:17,410 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:17,410 INFO ]: Abstraction has 24 states and 40 transitions. [2018-06-22 11:57:17,410 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:57:17,410 INFO ]: Start isEmpty. Operand 24 states and 40 transitions. [2018-06-22 11:57:17,413 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:57:17,413 INFO ]: Found error trace [2018-06-22 11:57:17,413 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:17,413 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:17,414 INFO ]: Analyzing trace with hash -548583576, now seen corresponding path program 1 times [2018-06-22 11:57:17,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:17,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:17,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:17,414 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:17,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:17,443 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:17,587 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:17,588 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:57:17,588 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:57:17,589 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:57:17,589 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:57:17,589 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:57:17,590 INFO ]: Start difference. First operand 24 states and 40 transitions. Second operand 6 states. [2018-06-22 11:57:18,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:18,117 INFO ]: Finished difference Result 38 states and 68 transitions. [2018-06-22 11:57:18,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:57:18,117 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:57:18,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:18,119 INFO ]: With dead ends: 38 [2018-06-22 11:57:18,120 INFO ]: Without dead ends: 38 [2018-06-22 11:57:18,120 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:57:18,121 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:57:18,135 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-06-22 11:57:18,135 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:57:18,137 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions. [2018-06-22 11:57:18,137 INFO ]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 17 [2018-06-22 11:57:18,137 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:18,137 INFO ]: Abstraction has 32 states and 56 transitions. [2018-06-22 11:57:18,137 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:57:18,137 INFO ]: Start isEmpty. Operand 32 states and 56 transitions. [2018-06-22 11:57:18,140 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:57:18,140 INFO ]: Found error trace [2018-06-22 11:57:18,140 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:18,140 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:18,141 INFO ]: Analyzing trace with hash 360859040, now seen corresponding path program 1 times [2018-06-22 11:57:18,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:18,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:18,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:18,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:18,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:18,167 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:18,567 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:18,567 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:18,567 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:18,574 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:18,604 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:18,611 INFO ]: Computing forward predicates... [2018-06-22 11:57:18,672 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:18,694 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:18,695 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:57:18,695 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:57:18,695 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:57:18,695 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:57:18,695 INFO ]: Start difference. First operand 32 states and 56 transitions. Second operand 9 states. [2018-06-22 11:57:19,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:19,276 INFO ]: Finished difference Result 48 states and 92 transitions. [2018-06-22 11:57:19,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:57:19,277 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:57:19,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:19,278 INFO ]: With dead ends: 48 [2018-06-22 11:57:19,278 INFO ]: Without dead ends: 46 [2018-06-22 11:57:19,278 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:57:19,278 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:57:19,290 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-06-22 11:57:19,290 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:57:19,291 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 66 transitions. [2018-06-22 11:57:19,291 INFO ]: Start accepts. Automaton has 36 states and 66 transitions. Word has length 17 [2018-06-22 11:57:19,292 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:19,292 INFO ]: Abstraction has 36 states and 66 transitions. [2018-06-22 11:57:19,292 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:57:19,292 INFO ]: Start isEmpty. Operand 36 states and 66 transitions. [2018-06-22 11:57:19,294 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:57:19,294 INFO ]: Found error trace [2018-06-22 11:57:19,294 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:19,294 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:19,294 INFO ]: Analyzing trace with hash -971569492, now seen corresponding path program 1 times [2018-06-22 11:57:19,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:19,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:19,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:19,295 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:19,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:19,310 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:19,386 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:19,386 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:19,386 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:19,391 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:19,418 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:19,420 INFO ]: Computing forward predicates... [2018-06-22 11:57:19,452 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:19,471 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:19,471 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:57:19,471 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:57:19,471 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:57:19,472 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:57:19,472 INFO ]: Start difference. First operand 36 states and 66 transitions. Second operand 9 states. [2018-06-22 11:57:19,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:19,891 INFO ]: Finished difference Result 54 states and 104 transitions. [2018-06-22 11:57:19,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:57:19,892 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:57:19,893 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:19,895 INFO ]: With dead ends: 54 [2018-06-22 11:57:19,895 INFO ]: Without dead ends: 54 [2018-06-22 11:57:19,895 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:57:19,895 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:57:19,908 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 40. [2018-06-22 11:57:19,908 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:57:19,909 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 75 transitions. [2018-06-22 11:57:19,909 INFO ]: Start accepts. Automaton has 40 states and 75 transitions. Word has length 17 [2018-06-22 11:57:19,909 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:19,910 INFO ]: Abstraction has 40 states and 75 transitions. [2018-06-22 11:57:19,910 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:57:19,910 INFO ]: Start isEmpty. Operand 40 states and 75 transitions. [2018-06-22 11:57:19,911 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:57:19,911 INFO ]: Found error trace [2018-06-22 11:57:19,911 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:19,911 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:19,911 INFO ]: Analyzing trace with hash -1357180704, now seen corresponding path program 1 times [2018-06-22 11:57:19,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:19,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:19,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:19,912 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:19,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:19,929 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:20,029 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:20,029 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:20,029 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:20,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:20,057 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:20,060 INFO ]: Computing forward predicates... [2018-06-22 11:57:20,177 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:20,198 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:20,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:57:20,198 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:57:20,199 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:57:20,199 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:57:20,199 INFO ]: Start difference. First operand 40 states and 75 transitions. Second operand 11 states. [2018-06-22 11:57:20,375 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:20,375 INFO ]: Finished difference Result 48 states and 87 transitions. [2018-06-22 11:57:20,376 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:57:20,376 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:57:20,376 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:20,378 INFO ]: With dead ends: 48 [2018-06-22 11:57:20,378 INFO ]: Without dead ends: 48 [2018-06-22 11:57:20,378 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:57:20,378 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:57:20,398 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-06-22 11:57:20,398 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:57:20,399 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 77 transitions. [2018-06-22 11:57:20,399 INFO ]: Start accepts. Automaton has 42 states and 77 transitions. Word has length 17 [2018-06-22 11:57:20,400 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:20,400 INFO ]: Abstraction has 42 states and 77 transitions. [2018-06-22 11:57:20,400 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:57:20,400 INFO ]: Start isEmpty. Operand 42 states and 77 transitions. [2018-06-22 11:57:20,401 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:57:20,401 INFO ]: Found error trace [2018-06-22 11:57:20,402 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:20,402 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:20,406 INFO ]: Analyzing trace with hash 1306897450, now seen corresponding path program 1 times [2018-06-22 11:57:20,406 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:20,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:20,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:20,407 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:20,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:20,419 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:20,451 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:57:20,451 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:57:20,451 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:57:20,451 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:57:20,451 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:57:20,451 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:57:20,451 INFO ]: Start difference. First operand 42 states and 77 transitions. Second operand 4 states. [2018-06-22 11:57:20,585 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:20,585 INFO ]: Finished difference Result 40 states and 71 transitions. [2018-06-22 11:57:20,587 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:57:20,587 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:57:20,587 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:20,588 INFO ]: With dead ends: 40 [2018-06-22 11:57:20,588 INFO ]: Without dead ends: 40 [2018-06-22 11:57:20,588 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:57:20,589 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:57:20,598 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-06-22 11:57:20,598 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:57:20,601 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2018-06-22 11:57:20,601 INFO ]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 21 [2018-06-22 11:57:20,601 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:20,601 INFO ]: Abstraction has 38 states and 65 transitions. [2018-06-22 11:57:20,601 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:57:20,601 INFO ]: Start isEmpty. Operand 38 states and 65 transitions. [2018-06-22 11:57:20,603 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:57:20,603 INFO ]: Found error trace [2018-06-22 11:57:20,603 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:20,603 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:20,603 INFO ]: Analyzing trace with hash -1705491026, now seen corresponding path program 1 times [2018-06-22 11:57:20,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:20,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:20,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:20,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:20,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:20,619 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:20,667 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:57:20,667 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:57:20,667 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:57:20,667 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:57:20,667 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:57:20,667 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:57:20,668 INFO ]: Start difference. First operand 38 states and 65 transitions. Second operand 4 states. [2018-06-22 11:57:20,739 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:20,739 INFO ]: Finished difference Result 38 states and 65 transitions. [2018-06-22 11:57:20,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:57:20,740 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:57:20,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:20,741 INFO ]: With dead ends: 38 [2018-06-22 11:57:20,741 INFO ]: Without dead ends: 38 [2018-06-22 11:57:20,741 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:57:20,741 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:57:20,747 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 11:57:20,747 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:57:20,748 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2018-06-22 11:57:20,748 INFO ]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 21 [2018-06-22 11:57:20,748 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:20,748 INFO ]: Abstraction has 38 states and 65 transitions. [2018-06-22 11:57:20,748 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:57:20,748 INFO ]: Start isEmpty. Operand 38 states and 65 transitions. [2018-06-22 11:57:20,750 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:57:20,750 INFO ]: Found error trace [2018-06-22 11:57:20,750 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:20,750 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:20,750 INFO ]: Analyzing trace with hash 1354582917, now seen corresponding path program 1 times [2018-06-22 11:57:20,750 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:20,750 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:20,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:20,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:20,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:20,760 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:20,823 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:57:20,823 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:20,823 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:20,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:20,845 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:20,847 INFO ]: Computing forward predicates... [2018-06-22 11:57:21,099 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:57:21,120 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:21,120 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:57:21,120 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:57:21,120 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:57:21,120 INFO ]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:57:21,120 INFO ]: Start difference. First operand 38 states and 65 transitions. Second operand 16 states. [2018-06-22 11:57:21,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:21,688 INFO ]: Finished difference Result 48 states and 76 transitions. [2018-06-22 11:57:21,688 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:57:21,688 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:57:21,688 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:21,689 INFO ]: With dead ends: 48 [2018-06-22 11:57:21,689 INFO ]: Without dead ends: 48 [2018-06-22 11:57:21,690 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:57:21,690 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:57:21,697 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-06-22 11:57:21,697 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:57:21,698 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 62 transitions. [2018-06-22 11:57:21,698 INFO ]: Start accepts. Automaton has 38 states and 62 transitions. Word has length 21 [2018-06-22 11:57:21,698 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:21,698 INFO ]: Abstraction has 38 states and 62 transitions. [2018-06-22 11:57:21,698 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:57:21,698 INFO ]: Start isEmpty. Operand 38 states and 62 transitions. [2018-06-22 11:57:21,700 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:57:21,700 INFO ]: Found error trace [2018-06-22 11:57:21,700 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:21,700 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:21,700 INFO ]: Analyzing trace with hash -491560947, now seen corresponding path program 1 times [2018-06-22 11:57:21,700 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:21,700 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:21,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:21,701 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:21,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:21,712 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:21,889 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:57:21,889 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:21,889 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:21,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:21,912 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:21,914 INFO ]: Computing forward predicates... [2018-06-22 11:57:21,964 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:57:21,983 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:21,983 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-22 11:57:21,983 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:57:21,983 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:57:21,983 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:57:21,984 INFO ]: Start difference. First operand 38 states and 62 transitions. Second operand 12 states. [2018-06-22 11:57:22,165 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:22,165 INFO ]: Finished difference Result 52 states and 86 transitions. [2018-06-22 11:57:22,166 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:57:22,166 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:57:22,166 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:22,167 INFO ]: With dead ends: 52 [2018-06-22 11:57:22,167 INFO ]: Without dead ends: 52 [2018-06-22 11:57:22,167 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:57:22,168 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:57:22,174 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-06-22 11:57:22,174 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:57:22,175 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 67 transitions. [2018-06-22 11:57:22,175 INFO ]: Start accepts. Automaton has 40 states and 67 transitions. Word has length 21 [2018-06-22 11:57:22,175 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:22,175 INFO ]: Abstraction has 40 states and 67 transitions. [2018-06-22 11:57:22,175 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:57:22,175 INFO ]: Start isEmpty. Operand 40 states and 67 transitions. [2018-06-22 11:57:22,176 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:57:22,176 INFO ]: Found error trace [2018-06-22 11:57:22,176 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:22,176 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:22,176 INFO ]: Analyzing trace with hash 1384288994, now seen corresponding path program 2 times [2018-06-22 11:57:22,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:22,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:22,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:22,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:22,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:22,185 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:22,246 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:57:22,246 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:22,246 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:22,252 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:22,270 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:22,270 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:22,272 INFO ]: Computing forward predicates... [2018-06-22 11:57:22,316 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:57:22,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:22,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:57:22,336 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:57:22,337 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:57:22,337 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:57:22,337 INFO ]: Start difference. First operand 40 states and 67 transitions. Second operand 11 states. [2018-06-22 11:57:22,536 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:22,536 INFO ]: Finished difference Result 60 states and 103 transitions. [2018-06-22 11:57:22,536 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:57:22,536 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:57:22,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:22,537 INFO ]: With dead ends: 60 [2018-06-22 11:57:22,537 INFO ]: Without dead ends: 47 [2018-06-22 11:57:22,537 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:57:22,537 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:57:22,546 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-22 11:57:22,546 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:57:22,547 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 83 transitions. [2018-06-22 11:57:22,547 INFO ]: Start accepts. Automaton has 47 states and 83 transitions. Word has length 21 [2018-06-22 11:57:22,547 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:22,547 INFO ]: Abstraction has 47 states and 83 transitions. [2018-06-22 11:57:22,547 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:57:22,547 INFO ]: Start isEmpty. Operand 47 states and 83 transitions. [2018-06-22 11:57:22,549 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:57:22,549 INFO ]: Found error trace [2018-06-22 11:57:22,549 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:22,549 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:22,549 INFO ]: Analyzing trace with hash -1295412913, now seen corresponding path program 1 times [2018-06-22 11:57:22,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:22,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:22,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:22,550 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:22,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:22,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:22,689 INFO ]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:57:22,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:22,689 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) [2018-06-22 11:57:22,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:22,739 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:22,743 INFO ]: Computing forward predicates... [2018-06-22 11:57:23,268 INFO ]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:57:23,287 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:23,287 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-06-22 11:57:23,287 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:57:23,287 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:57:23,287 INFO ]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:57:23,287 INFO ]: Start difference. First operand 47 states and 83 transitions. Second operand 19 states. [2018-06-22 11:57:23,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:23,717 INFO ]: Finished difference Result 79 states and 131 transitions. [2018-06-22 11:57:23,717 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:57:23,717 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-22 11:57:23,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:23,718 INFO ]: With dead ends: 79 [2018-06-22 11:57:23,718 INFO ]: Without dead ends: 79 [2018-06-22 11:57:23,719 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:57:23,719 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:57:23,727 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-06-22 11:57:23,727 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:57:23,728 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2018-06-22 11:57:23,728 INFO ]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 25 [2018-06-22 11:57:23,728 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:23,728 INFO ]: Abstraction has 57 states and 99 transitions. [2018-06-22 11:57:23,728 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:57:23,728 INFO ]: Start isEmpty. Operand 57 states and 99 transitions. [2018-06-22 11:57:23,730 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:57:23,730 INFO ]: Found error trace [2018-06-22 11:57:23,730 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:23,730 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:23,730 INFO ]: Analyzing trace with hash 1164215255, now seen corresponding path program 2 times [2018-06-22 11:57:23,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:23,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:23,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:23,731 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:23,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:23,740 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:23,802 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:57:23,802 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:23,802 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:23,811 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:23,826 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:23,826 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:23,828 INFO ]: Computing forward predicates... [2018-06-22 11:57:23,938 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:57:23,957 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:23,957 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-22 11:57:23,957 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:57:23,957 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:57:23,958 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:57:23,958 INFO ]: Start difference. First operand 57 states and 99 transitions. Second operand 13 states. [2018-06-22 11:57:24,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:24,188 INFO ]: Finished difference Result 83 states and 134 transitions. [2018-06-22 11:57:24,188 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:57:24,188 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 11:57:24,189 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:24,189 INFO ]: With dead ends: 83 [2018-06-22 11:57:24,189 INFO ]: Without dead ends: 75 [2018-06-22 11:57:24,190 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:57:24,190 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:57:24,198 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 65. [2018-06-22 11:57:24,198 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:57:24,200 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 112 transitions. [2018-06-22 11:57:24,200 INFO ]: Start accepts. Automaton has 65 states and 112 transitions. Word has length 25 [2018-06-22 11:57:24,200 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:24,200 INFO ]: Abstraction has 65 states and 112 transitions. [2018-06-22 11:57:24,200 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:57:24,200 INFO ]: Start isEmpty. Operand 65 states and 112 transitions. [2018-06-22 11:57:24,201 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:57:24,201 INFO ]: Found error trace [2018-06-22 11:57:24,201 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:24,201 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:24,201 INFO ]: Analyzing trace with hash 865448541, now seen corresponding path program 1 times [2018-06-22 11:57:24,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:24,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:24,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:24,202 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:24,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:24,210 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:24,340 INFO ]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:57:24,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:24,340 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:24,346 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:24,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:24,365 INFO ]: Computing forward predicates... [2018-06-22 11:57:24,429 INFO ]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:57:24,449 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:24,449 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-22 11:57:24,449 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:57:24,449 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:57:24,449 INFO ]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:57:24,449 INFO ]: Start difference. First operand 65 states and 112 transitions. Second operand 17 states. [2018-06-22 11:57:24,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:24,716 INFO ]: Finished difference Result 97 states and 162 transitions. [2018-06-22 11:57:24,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:57:24,716 INFO ]: Start accepts. Automaton has 17 states. Word has length 29 [2018-06-22 11:57:24,717 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:24,718 INFO ]: With dead ends: 97 [2018-06-22 11:57:24,718 INFO ]: Without dead ends: 97 [2018-06-22 11:57:24,718 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:57:24,718 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 11:57:24,728 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 67. [2018-06-22 11:57:24,728 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 11:57:24,729 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 116 transitions. [2018-06-22 11:57:24,729 INFO ]: Start accepts. Automaton has 67 states and 116 transitions. Word has length 29 [2018-06-22 11:57:24,729 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:24,729 INFO ]: Abstraction has 67 states and 116 transitions. [2018-06-22 11:57:24,729 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:57:24,729 INFO ]: Start isEmpty. Operand 67 states and 116 transitions. [2018-06-22 11:57:24,730 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:57:24,730 INFO ]: Found error trace [2018-06-22 11:57:24,730 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:24,731 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:24,731 INFO ]: Analyzing trace with hash 1687935825, now seen corresponding path program 1 times [2018-06-22 11:57:24,731 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:24,731 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:24,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:24,731 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:24,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:24,740 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:24,853 INFO ]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:57:24,853 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:24,853 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:24,859 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:24,884 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:24,887 INFO ]: Computing forward predicates... [2018-06-22 11:57:24,987 INFO ]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:57:25,010 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:25,010 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-22 11:57:25,011 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:57:25,011 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:57:25,011 INFO ]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:57:25,011 INFO ]: Start difference. First operand 67 states and 116 transitions. Second operand 15 states. [2018-06-22 11:57:25,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:25,309 INFO ]: Finished difference Result 115 states and 205 transitions. [2018-06-22 11:57:25,309 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:57:25,309 INFO ]: Start accepts. Automaton has 15 states. Word has length 29 [2018-06-22 11:57:25,309 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:25,310 INFO ]: With dead ends: 115 [2018-06-22 11:57:25,310 INFO ]: Without dead ends: 100 [2018-06-22 11:57:25,310 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:57:25,311 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 11:57:25,320 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 78. [2018-06-22 11:57:25,320 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 11:57:25,321 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 139 transitions. [2018-06-22 11:57:25,321 INFO ]: Start accepts. Automaton has 78 states and 139 transitions. Word has length 29 [2018-06-22 11:57:25,322 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:25,322 INFO ]: Abstraction has 78 states and 139 transitions. [2018-06-22 11:57:25,322 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:57:25,322 INFO ]: Start isEmpty. Operand 78 states and 139 transitions. [2018-06-22 11:57:25,323 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:57:25,323 INFO ]: Found error trace [2018-06-22 11:57:25,323 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:25,323 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:25,323 INFO ]: Analyzing trace with hash 710344849, now seen corresponding path program 2 times [2018-06-22 11:57:25,323 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:25,323 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:25,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:25,324 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:25,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:25,332 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:25,447 INFO ]: Checked inductivity of 22 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:57:25,447 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:25,447 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:25,455 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:25,470 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:25,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:25,472 INFO ]: Computing forward predicates... [2018-06-22 11:57:25,848 INFO ]: Checked inductivity of 22 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:57:25,867 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:25,867 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-06-22 11:57:25,867 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:57:25,867 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:57:25,867 INFO ]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:57:25,867 INFO ]: Start difference. First operand 78 states and 139 transitions. Second operand 16 states. [2018-06-22 11:57:26,887 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:26,887 INFO ]: Finished difference Result 132 states and 222 transitions. [2018-06-22 11:57:26,887 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:57:26,887 INFO ]: Start accepts. Automaton has 16 states. Word has length 29 [2018-06-22 11:57:26,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:26,889 INFO ]: With dead ends: 132 [2018-06-22 11:57:26,889 INFO ]: Without dead ends: 118 [2018-06-22 11:57:26,889 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:57:26,889 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 11:57:26,898 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 80. [2018-06-22 11:57:26,898 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 11:57:26,899 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 138 transitions. [2018-06-22 11:57:26,900 INFO ]: Start accepts. Automaton has 80 states and 138 transitions. Word has length 29 [2018-06-22 11:57:26,900 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:26,900 INFO ]: Abstraction has 80 states and 138 transitions. [2018-06-22 11:57:26,900 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:57:26,900 INFO ]: Start isEmpty. Operand 80 states and 138 transitions. [2018-06-22 11:57:26,901 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:57:26,901 INFO ]: Found error trace [2018-06-22 11:57:26,901 INFO ]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:26,901 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:26,901 INFO ]: Analyzing trace with hash 1044163545, now seen corresponding path program 1 times [2018-06-22 11:57:26,901 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:26,901 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:26,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:26,902 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:26,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:26,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:26,961 INFO ]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:57:26,962 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:57:26,962 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:57:26,962 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:57:26,962 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:57:26,962 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:57:26,962 INFO ]: Start difference. First operand 80 states and 138 transitions. Second operand 5 states. [2018-06-22 11:57:26,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:26,990 INFO ]: Finished difference Result 70 states and 112 transitions. [2018-06-22 11:57:26,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:57:26,993 INFO ]: Start accepts. Automaton has 5 states. Word has length 29 [2018-06-22 11:57:26,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:26,994 INFO ]: With dead ends: 70 [2018-06-22 11:57:26,994 INFO ]: Without dead ends: 69 [2018-06-22 11:57:26,994 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:57:26,994 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:57:27,000 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-06-22 11:57:27,001 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 11:57:27,001 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 105 transitions. [2018-06-22 11:57:27,001 INFO ]: Start accepts. Automaton has 67 states and 105 transitions. Word has length 29 [2018-06-22 11:57:27,001 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:27,001 INFO ]: Abstraction has 67 states and 105 transitions. [2018-06-22 11:57:27,001 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:57:27,001 INFO ]: Start isEmpty. Operand 67 states and 105 transitions. [2018-06-22 11:57:27,009 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:57:27,009 INFO ]: Found error trace [2018-06-22 11:57:27,009 INFO ]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:27,009 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:27,009 INFO ]: Analyzing trace with hash 355884191, now seen corresponding path program 2 times [2018-06-22 11:57:27,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:27,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:27,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:27,010 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:27,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:27,022 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:27,087 INFO ]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:57:27,087 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:57:27,087 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:57:27,087 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:57:27,087 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:57:27,087 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:57:27,088 INFO ]: Start difference. First operand 67 states and 105 transitions. Second operand 5 states. [2018-06-22 11:57:27,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:27,109 INFO ]: Finished difference Result 63 states and 97 transitions. [2018-06-22 11:57:27,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:57:27,110 INFO ]: Start accepts. Automaton has 5 states. Word has length 33 [2018-06-22 11:57:27,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:27,111 INFO ]: With dead ends: 63 [2018-06-22 11:57:27,111 INFO ]: Without dead ends: 62 [2018-06-22 11:57:27,111 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:57:27,111 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:57:27,115 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-06-22 11:57:27,115 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:57:27,116 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2018-06-22 11:57:27,116 INFO ]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 33 [2018-06-22 11:57:27,116 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:27,116 INFO ]: Abstraction has 62 states and 95 transitions. [2018-06-22 11:57:27,116 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:57:27,116 INFO ]: Start isEmpty. Operand 62 states and 95 transitions. [2018-06-22 11:57:27,117 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:57:27,117 INFO ]: Found error trace [2018-06-22 11:57:27,117 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:27,117 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:27,118 INFO ]: Analyzing trace with hash -267524218, now seen corresponding path program 3 times [2018-06-22 11:57:27,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:27,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:27,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:27,118 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:27,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:27,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:27,264 INFO ]: Checked inductivity of 31 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:57:27,264 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:27,264 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:27,270 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:27,315 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:57:27,315 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:27,317 INFO ]: Computing forward predicates... [2018-06-22 11:57:27,462 INFO ]: Checked inductivity of 31 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:57:27,481 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:27,481 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-22 11:57:27,481 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:57:27,481 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:57:27,481 INFO ]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:57:27,481 INFO ]: Start difference. First operand 62 states and 95 transitions. Second operand 20 states. [2018-06-22 11:57:28,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:28,355 INFO ]: Finished difference Result 98 states and 135 transitions. [2018-06-22 11:57:28,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:57:28,355 INFO ]: Start accepts. Automaton has 20 states. Word has length 33 [2018-06-22 11:57:28,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:28,356 INFO ]: With dead ends: 98 [2018-06-22 11:57:28,356 INFO ]: Without dead ends: 80 [2018-06-22 11:57:28,356 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:57:28,357 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 11:57:28,364 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 68. [2018-06-22 11:57:28,364 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:57:28,364 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2018-06-22 11:57:28,364 INFO ]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 33 [2018-06-22 11:57:28,365 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:28,365 INFO ]: Abstraction has 68 states and 103 transitions. [2018-06-22 11:57:28,365 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:57:28,365 INFO ]: Start isEmpty. Operand 68 states and 103 transitions. [2018-06-22 11:57:28,366 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:57:28,366 INFO ]: Found error trace [2018-06-22 11:57:28,366 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:28,368 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:28,368 INFO ]: Analyzing trace with hash -1585039106, now seen corresponding path program 3 times [2018-06-22 11:57:28,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:28,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:28,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:28,369 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:28,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:28,388 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:28,595 INFO ]: Checked inductivity of 29 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:57:28,595 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:28,595 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:28,601 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:28,621 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:57:28,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:28,624 INFO ]: Computing forward predicates... [2018-06-22 11:57:28,884 INFO ]: Checked inductivity of 29 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:57:28,903 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:28,904 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2018-06-22 11:57:28,904 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:57:28,904 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:57:28,904 INFO ]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:57:28,904 INFO ]: Start difference. First operand 68 states and 103 transitions. Second operand 24 states. [2018-06-22 11:57:29,304 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:29,304 INFO ]: Finished difference Result 88 states and 124 transitions. [2018-06-22 11:57:29,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:57:29,304 INFO ]: Start accepts. Automaton has 24 states. Word has length 33 [2018-06-22 11:57:29,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:29,305 INFO ]: With dead ends: 88 [2018-06-22 11:57:29,305 INFO ]: Without dead ends: 88 [2018-06-22 11:57:29,306 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:57:29,306 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 11:57:29,311 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 68. [2018-06-22 11:57:29,311 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:57:29,313 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2018-06-22 11:57:29,313 INFO ]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 33 [2018-06-22 11:57:29,313 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:29,313 INFO ]: Abstraction has 68 states and 103 transitions. [2018-06-22 11:57:29,313 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:57:29,313 INFO ]: Start isEmpty. Operand 68 states and 103 transitions. [2018-06-22 11:57:29,314 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:57:29,314 INFO ]: Found error trace [2018-06-22 11:57:29,314 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:29,314 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:29,314 INFO ]: Analyzing trace with hash -1395168650, now seen corresponding path program 4 times [2018-06-22 11:57:29,314 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:29,314 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:29,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:29,315 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:29,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:29,325 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:29,611 INFO ]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:57:29,611 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:29,611 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:29,617 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:57:29,651 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:57:29,651 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:29,653 INFO ]: Computing forward predicates... [2018-06-22 11:57:29,750 INFO ]: Checked inductivity of 29 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:57:29,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:29,769 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-22 11:57:29,769 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:57:29,769 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:57:29,769 INFO ]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:57:29,769 INFO ]: Start difference. First operand 68 states and 103 transitions. Second operand 15 states. [2018-06-22 11:57:29,914 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:29,914 INFO ]: Finished difference Result 72 states and 107 transitions. [2018-06-22 11:57:29,915 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:57:29,915 INFO ]: Start accepts. Automaton has 15 states. Word has length 33 [2018-06-22 11:57:29,915 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:29,916 INFO ]: With dead ends: 72 [2018-06-22 11:57:29,916 INFO ]: Without dead ends: 72 [2018-06-22 11:57:29,916 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:57:29,916 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 11:57:29,920 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-06-22 11:57:29,920 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:57:29,921 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2018-06-22 11:57:29,921 INFO ]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 33 [2018-06-22 11:57:29,921 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:29,921 INFO ]: Abstraction has 68 states and 101 transitions. [2018-06-22 11:57:29,921 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:57:29,921 INFO ]: Start isEmpty. Operand 68 states and 101 transitions. [2018-06-22 11:57:29,922 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:57:29,922 INFO ]: Found error trace [2018-06-22 11:57:29,922 INFO ]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:29,922 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:29,922 INFO ]: Analyzing trace with hash -206584448, now seen corresponding path program 5 times [2018-06-22 11:57:29,922 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:29,922 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:29,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:29,923 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:29,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:29,931 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:30,151 INFO ]: Checked inductivity of 42 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:57:30,151 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:30,151 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 11:57:30,157 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:57:30,179 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 11:57:30,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:30,181 INFO ]: Computing forward predicates... [2018-06-22 11:57:30,274 INFO ]: Checked inductivity of 42 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:57:30,293 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:30,293 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-06-22 11:57:30,293 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:57:30,293 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:57:30,293 INFO ]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:57:30,293 INFO ]: Start difference. First operand 68 states and 101 transitions. Second operand 19 states. [2018-06-22 11:57:30,755 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:30,755 INFO ]: Finished difference Result 96 states and 142 transitions. [2018-06-22 11:57:30,756 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:57:30,756 INFO ]: Start accepts. Automaton has 19 states. Word has length 37 [2018-06-22 11:57:30,756 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:30,757 INFO ]: With dead ends: 96 [2018-06-22 11:57:30,757 INFO ]: Without dead ends: 88 [2018-06-22 11:57:30,757 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=911, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:57:30,757 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 11:57:30,762 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 64. [2018-06-22 11:57:30,762 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 11:57:30,763 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2018-06-22 11:57:30,763 INFO ]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 37 [2018-06-22 11:57:30,763 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:30,763 INFO ]: Abstraction has 64 states and 96 transitions. [2018-06-22 11:57:30,763 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:57:30,763 INFO ]: Start isEmpty. Operand 64 states and 96 transitions. [2018-06-22 11:57:30,764 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:57:30,764 INFO ]: Found error trace [2018-06-22 11:57:30,764 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:30,764 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:30,764 INFO ]: Analyzing trace with hash -1757193173, now seen corresponding path program 4 times [2018-06-22 11:57:30,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:30,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:30,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:30,765 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:30,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:30,774 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:31,491 INFO ]: Checked inductivity of 42 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:57:31,492 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:31,492 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 11:57:31,497 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:57:31,516 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:57:31,516 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:31,518 INFO ]: Computing forward predicates... [2018-06-22 11:57:31,582 INFO ]: Checked inductivity of 42 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:57:31,601 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:31,601 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-06-22 11:57:31,601 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:57:31,601 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:57:31,601 INFO ]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:57:31,602 INFO ]: Start difference. First operand 64 states and 96 transitions. Second operand 19 states. [2018-06-22 11:57:31,852 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:31,852 INFO ]: Finished difference Result 86 states and 131 transitions. [2018-06-22 11:57:31,855 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:57:31,855 INFO ]: Start accepts. Automaton has 19 states. Word has length 37 [2018-06-22 11:57:31,855 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:31,856 INFO ]: With dead ends: 86 [2018-06-22 11:57:31,856 INFO ]: Without dead ends: 82 [2018-06-22 11:57:31,856 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:57:31,856 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 11:57:31,861 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-06-22 11:57:31,861 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:57:31,861 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2018-06-22 11:57:31,861 INFO ]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 37 [2018-06-22 11:57:31,861 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:31,861 INFO ]: Abstraction has 72 states and 109 transitions. [2018-06-22 11:57:31,861 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:57:31,861 INFO ]: Start isEmpty. Operand 72 states and 109 transitions. [2018-06-22 11:57:31,862 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:57:31,862 INFO ]: Found error trace [2018-06-22 11:57:31,862 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:31,862 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:31,863 INFO ]: Analyzing trace with hash -858652043, now seen corresponding path program 5 times [2018-06-22 11:57:31,863 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:31,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:31,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:31,863 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:31,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:31,872 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:32,030 INFO ]: Checked inductivity of 57 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:57:32,030 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:32,030 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:32,036 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:57:32,065 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 11:57:32,065 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:32,066 INFO ]: Computing forward predicates... [2018-06-22 11:57:32,205 INFO ]: Checked inductivity of 57 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:57:32,227 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:32,227 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-06-22 11:57:32,227 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:57:32,227 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:57:32,227 INFO ]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:57:32,228 INFO ]: Start difference. First operand 72 states and 109 transitions. Second operand 19 states. [2018-06-22 11:57:32,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:32,490 INFO ]: Finished difference Result 126 states and 170 transitions. [2018-06-22 11:57:32,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:57:32,494 INFO ]: Start accepts. Automaton has 19 states. Word has length 41 [2018-06-22 11:57:32,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:32,495 INFO ]: With dead ends: 126 [2018-06-22 11:57:32,495 INFO ]: Without dead ends: 92 [2018-06-22 11:57:32,496 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:57:32,496 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-22 11:57:32,503 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 80. [2018-06-22 11:57:32,503 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 11:57:32,504 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 119 transitions. [2018-06-22 11:57:32,504 INFO ]: Start accepts. Automaton has 80 states and 119 transitions. Word has length 41 [2018-06-22 11:57:32,504 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:32,504 INFO ]: Abstraction has 80 states and 119 transitions. [2018-06-22 11:57:32,504 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:57:32,504 INFO ]: Start isEmpty. Operand 80 states and 119 transitions. [2018-06-22 11:57:32,505 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:57:32,505 INFO ]: Found error trace [2018-06-22 11:57:32,505 INFO ]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:32,505 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:32,505 INFO ]: Analyzing trace with hash 163253605, now seen corresponding path program 6 times [2018-06-22 11:57:32,505 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:32,505 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:32,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:32,506 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:32,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:32,517 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:32,658 INFO ]: Checked inductivity of 53 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:57:32,658 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:32,658 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 11:57:32,665 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:57:32,689 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:57:32,689 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:32,691 INFO ]: Computing forward predicates... [2018-06-22 11:57:32,777 INFO ]: Checked inductivity of 53 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:57:32,799 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:32,799 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2018-06-22 11:57:32,799 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:57:32,799 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:57:32,800 INFO ]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:57:32,800 INFO ]: Start difference. First operand 80 states and 119 transitions. Second operand 18 states. [2018-06-22 11:57:33,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:33,146 INFO ]: Finished difference Result 94 states and 138 transitions. [2018-06-22 11:57:33,146 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:57:33,146 INFO ]: Start accepts. Automaton has 18 states. Word has length 41 [2018-06-22 11:57:33,146 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:33,147 INFO ]: With dead ends: 94 [2018-06-22 11:57:33,147 INFO ]: Without dead ends: 94 [2018-06-22 11:57:33,147 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:57:33,147 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 11:57:33,151 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 80. [2018-06-22 11:57:33,151 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 11:57:33,152 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 117 transitions. [2018-06-22 11:57:33,152 INFO ]: Start accepts. Automaton has 80 states and 117 transitions. Word has length 41 [2018-06-22 11:57:33,152 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:33,152 INFO ]: Abstraction has 80 states and 117 transitions. [2018-06-22 11:57:33,152 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:57:33,152 INFO ]: Start isEmpty. Operand 80 states and 117 transitions. [2018-06-22 11:57:33,153 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:57:33,153 INFO ]: Found error trace [2018-06-22 11:57:33,153 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:33,153 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:33,153 INFO ]: Analyzing trace with hash 45135130, now seen corresponding path program 6 times [2018-06-22 11:57:33,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:33,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:33,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:33,154 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:33,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:33,165 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:33,837 INFO ]: Checked inductivity of 72 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 11:57:33,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:33,837 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) [2018-06-22 11:57:33,851 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:33,885 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:57:33,885 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:33,887 INFO ]: Computing forward predicates... [2018-06-22 11:57:34,058 INFO ]: Checked inductivity of 72 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 11:57:34,077 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:34,077 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 22 [2018-06-22 11:57:34,078 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:57:34,078 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:57:34,078 INFO ]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:57:34,078 INFO ]: Start difference. First operand 80 states and 117 transitions. Second operand 22 states. [2018-06-22 11:57:34,313 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:34,314 INFO ]: Finished difference Result 102 states and 152 transitions. [2018-06-22 11:57:34,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:57:34,314 INFO ]: Start accepts. Automaton has 22 states. Word has length 45 [2018-06-22 11:57:34,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:34,315 INFO ]: With dead ends: 102 [2018-06-22 11:57:34,315 INFO ]: Without dead ends: 98 [2018-06-22 11:57:34,315 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=765, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:57:34,315 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 11:57:34,320 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 88. [2018-06-22 11:57:34,320 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 11:57:34,321 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2018-06-22 11:57:34,321 INFO ]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 45 [2018-06-22 11:57:34,321 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:34,321 INFO ]: Abstraction has 88 states and 130 transitions. [2018-06-22 11:57:34,321 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:57:34,321 INFO ]: Start isEmpty. Operand 88 states and 130 transitions. [2018-06-22 11:57:34,322 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:57:34,322 INFO ]: Found error trace [2018-06-22 11:57:34,322 INFO ]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:34,322 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:34,322 INFO ]: Analyzing trace with hash 221344175, now seen corresponding path program 7 times [2018-06-22 11:57:34,323 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:34,323 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:34,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:34,323 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:34,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:34,335 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:34,825 INFO ]: Checked inductivity of 70 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:57:34,825 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:34,825 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 11:57:34,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:34,854 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:34,856 INFO ]: Computing forward predicates... [2018-06-22 11:57:34,950 INFO ]: Checked inductivity of 70 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:57:34,969 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:34,969 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2018-06-22 11:57:34,969 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:57:34,969 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:57:34,970 INFO ]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:57:34,970 INFO ]: Start difference. First operand 88 states and 130 transitions. Second operand 22 states. [2018-06-22 11:57:35,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:35,608 INFO ]: Finished difference Result 126 states and 185 transitions. [2018-06-22 11:57:35,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:57:35,608 INFO ]: Start accepts. Automaton has 22 states. Word has length 45 [2018-06-22 11:57:35,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:35,609 INFO ]: With dead ends: 126 [2018-06-22 11:57:35,609 INFO ]: Without dead ends: 116 [2018-06-22 11:57:35,610 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=306, Invalid=1334, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:57:35,610 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-22 11:57:35,615 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 82. [2018-06-22 11:57:35,615 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:57:35,616 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 123 transitions. [2018-06-22 11:57:35,616 INFO ]: Start accepts. Automaton has 82 states and 123 transitions. Word has length 45 [2018-06-22 11:57:35,616 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:35,616 INFO ]: Abstraction has 82 states and 123 transitions. [2018-06-22 11:57:35,616 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:57:35,616 INFO ]: Start isEmpty. Operand 82 states and 123 transitions. [2018-06-22 11:57:35,618 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:57:35,618 INFO ]: Found error trace [2018-06-22 11:57:35,618 INFO ]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:35,618 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:35,618 INFO ]: Analyzing trace with hash 1004402580, now seen corresponding path program 8 times [2018-06-22 11:57:35,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:35,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:35,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:35,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:35,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:35,630 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:36,542 INFO ]: Checked inductivity of 85 backedges. 29 proven. 23 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 11:57:36,542 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:36,542 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 11:57:36,550 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:36,577 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:36,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:36,579 INFO ]: Computing forward predicates... [2018-06-22 11:57:36,676 INFO ]: Checked inductivity of 85 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:57:36,695 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:36,695 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 21 [2018-06-22 11:57:36,695 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:57:36,695 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:57:36,696 INFO ]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:57:36,696 INFO ]: Start difference. First operand 82 states and 123 transitions. Second operand 21 states. [2018-06-22 11:57:36,923 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:36,923 INFO ]: Finished difference Result 112 states and 167 transitions. [2018-06-22 11:57:36,923 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:57:36,923 INFO ]: Start accepts. Automaton has 21 states. Word has length 49 [2018-06-22 11:57:36,924 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:36,924 INFO ]: With dead ends: 112 [2018-06-22 11:57:36,924 INFO ]: Without dead ends: 112 [2018-06-22 11:57:36,925 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:57:36,925 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:57:36,930 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 82. [2018-06-22 11:57:36,930 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:57:36,931 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 122 transitions. [2018-06-22 11:57:36,931 INFO ]: Start accepts. Automaton has 82 states and 122 transitions. Word has length 49 [2018-06-22 11:57:36,931 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:36,931 INFO ]: Abstraction has 82 states and 122 transitions. [2018-06-22 11:57:36,931 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:57:36,931 INFO ]: Start isEmpty. Operand 82 states and 122 transitions. [2018-06-22 11:57:36,932 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:57:36,932 INFO ]: Found error trace [2018-06-22 11:57:36,932 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:36,932 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:36,932 INFO ]: Analyzing trace with hash -1294113628, now seen corresponding path program 7 times [2018-06-22 11:57:36,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:36,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:36,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:36,934 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:36,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:36,945 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:37,346 INFO ]: Checked inductivity of 91 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:57:37,346 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:37,346 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 11:57:37,352 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:37,378 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:37,380 INFO ]: Computing forward predicates... [2018-06-22 11:57:37,582 INFO ]: Checked inductivity of 91 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:57:37,607 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:37,607 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2018-06-22 11:57:37,607 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:57:37,607 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:57:37,607 INFO ]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:57:37,608 INFO ]: Start difference. First operand 82 states and 122 transitions. Second operand 22 states. [2018-06-22 11:57:37,858 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:37,859 INFO ]: Finished difference Result 154 states and 205 transitions. [2018-06-22 11:57:37,859 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:57:37,859 INFO ]: Start accepts. Automaton has 22 states. Word has length 49 [2018-06-22 11:57:37,859 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:37,859 INFO ]: With dead ends: 154 [2018-06-22 11:57:37,859 INFO ]: Without dead ends: 98 [2018-06-22 11:57:37,860 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=866, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:57:37,860 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 11:57:37,865 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 92. [2018-06-22 11:57:37,865 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-22 11:57:37,865 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 133 transitions. [2018-06-22 11:57:37,865 INFO ]: Start accepts. Automaton has 92 states and 133 transitions. Word has length 49 [2018-06-22 11:57:37,866 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:37,866 INFO ]: Abstraction has 92 states and 133 transitions. [2018-06-22 11:57:37,866 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:57:37,866 INFO ]: Start isEmpty. Operand 92 states and 133 transitions. [2018-06-22 11:57:37,867 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:57:37,867 INFO ]: Found error trace [2018-06-22 11:57:37,867 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:37,867 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:37,867 INFO ]: Analyzing trace with hash -895765175, now seen corresponding path program 8 times [2018-06-22 11:57:37,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:37,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:37,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:37,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:37,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:37,880 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:38,055 INFO ]: Checked inductivity of 110 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 11:57:38,055 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:38,055 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 11:57:38,060 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:38,090 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:38,090 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:38,092 INFO ]: Computing forward predicates... [2018-06-22 11:57:38,206 INFO ]: Checked inductivity of 110 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 11:57:38,225 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:38,225 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 25 [2018-06-22 11:57:38,225 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:57:38,225 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:57:38,226 INFO ]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:57:38,226 INFO ]: Start difference. First operand 92 states and 133 transitions. Second operand 25 states. [2018-06-22 11:57:38,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:38,645 INFO ]: Finished difference Result 114 states and 168 transitions. [2018-06-22 11:57:38,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:57:38,645 INFO ]: Start accepts. Automaton has 25 states. Word has length 53 [2018-06-22 11:57:38,646 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:38,646 INFO ]: With dead ends: 114 [2018-06-22 11:57:38,646 INFO ]: Without dead ends: 110 [2018-06-22 11:57:38,647 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=1037, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:57:38,647 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 11:57:38,652 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-06-22 11:57:38,652 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 11:57:38,653 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 146 transitions. [2018-06-22 11:57:38,653 INFO ]: Start accepts. Automaton has 100 states and 146 transitions. Word has length 53 [2018-06-22 11:57:38,653 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:38,653 INFO ]: Abstraction has 100 states and 146 transitions. [2018-06-22 11:57:38,653 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:57:38,653 INFO ]: Start isEmpty. Operand 100 states and 146 transitions. [2018-06-22 11:57:38,654 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:57:38,654 INFO ]: Found error trace [2018-06-22 11:57:38,654 INFO ]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:38,654 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:38,654 INFO ]: Analyzing trace with hash -433810146, now seen corresponding path program 9 times [2018-06-22 11:57:38,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:38,655 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:38,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:38,655 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:38,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:38,666 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:39,465 INFO ]: Checked inductivity of 106 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:57:39,465 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:39,465 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 11:57:39,471 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:39,567 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:57:39,567 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:39,571 INFO ]: Computing forward predicates... [2018-06-22 11:57:39,894 INFO ]: Checked inductivity of 106 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:57:39,913 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:39,913 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2018-06-22 11:57:39,913 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:57:39,913 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:57:39,914 INFO ]: CoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:57:39,914 INFO ]: Start difference. First operand 100 states and 146 transitions. Second operand 31 states. [2018-06-22 11:57:40,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:40,943 INFO ]: Finished difference Result 144 states and 210 transitions. [2018-06-22 11:57:40,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:57:40,943 INFO ]: Start accepts. Automaton has 31 states. Word has length 53 [2018-06-22 11:57:40,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:40,944 INFO ]: With dead ends: 144 [2018-06-22 11:57:40,944 INFO ]: Without dead ends: 132 [2018-06-22 11:57:40,945 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=481, Invalid=2711, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:57:40,947 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-22 11:57:40,953 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 92. [2018-06-22 11:57:40,953 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-22 11:57:40,954 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2018-06-22 11:57:40,954 INFO ]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 53 [2018-06-22 11:57:40,954 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:40,954 INFO ]: Abstraction has 92 states and 137 transitions. [2018-06-22 11:57:40,954 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:57:40,954 INFO ]: Start isEmpty. Operand 92 states and 137 transitions. [2018-06-22 11:57:40,956 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:57:40,956 INFO ]: Found error trace [2018-06-22 11:57:40,956 INFO ]: trace histogram [7, 6, 5, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:40,956 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:40,956 INFO ]: Analyzing trace with hash 84982019, now seen corresponding path program 10 times [2018-06-22 11:57:40,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:40,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:40,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:40,956 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:40,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:40,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:41,186 INFO ]: Checked inductivity of 125 backedges. 41 proven. 34 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 11:57:41,186 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:41,186 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 11:57:41,193 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:57:41,223 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:57:41,223 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:41,226 INFO ]: Computing forward predicates... [2018-06-22 11:57:41,915 INFO ]: Checked inductivity of 125 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 11:57:41,935 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:41,935 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2018-06-22 11:57:41,935 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:57:41,935 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:57:41,935 INFO ]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:57:41,935 INFO ]: Start difference. First operand 92 states and 137 transitions. Second operand 24 states. [2018-06-22 11:57:42,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:42,356 INFO ]: Finished difference Result 144 states and 214 transitions. [2018-06-22 11:57:42,356 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:57:42,356 INFO ]: Start accepts. Automaton has 24 states. Word has length 57 [2018-06-22 11:57:42,356 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:42,360 INFO ]: With dead ends: 144 [2018-06-22 11:57:42,360 INFO ]: Without dead ends: 144 [2018-06-22 11:57:42,360 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=192, Invalid=998, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:57:42,361 INFO ]: Start minimizeSevpa. Operand 144 states. [2018-06-22 11:57:42,369 INFO ]: Finished minimizeSevpa. Reduced states from 144 to 92. [2018-06-22 11:57:42,369 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-22 11:57:42,369 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2018-06-22 11:57:42,370 INFO ]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 57 [2018-06-22 11:57:42,370 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:42,370 INFO ]: Abstraction has 92 states and 136 transitions. [2018-06-22 11:57:42,370 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:57:42,370 INFO ]: Start isEmpty. Operand 92 states and 136 transitions. [2018-06-22 11:57:42,371 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:57:42,371 INFO ]: Found error trace [2018-06-22 11:57:42,371 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:42,371 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:42,371 INFO ]: Analyzing trace with hash -603939309, now seen corresponding path program 9 times [2018-06-22 11:57:42,371 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:42,371 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:42,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:42,372 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:42,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:42,387 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:42,756 INFO ]: Checked inductivity of 133 backedges. 42 proven. 35 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:57:42,756 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:42,756 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 11:57:42,762 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:42,800 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 11:57:42,800 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:42,802 INFO ]: Computing forward predicates... [2018-06-22 11:57:43,075 INFO ]: Checked inductivity of 133 backedges. 42 proven. 35 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:57:43,094 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:43,095 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2018-06-22 11:57:43,095 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:57:43,095 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:57:43,095 INFO ]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:57:43,095 INFO ]: Start difference. First operand 92 states and 136 transitions. Second operand 32 states. [2018-06-22 11:57:43,908 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:43,908 INFO ]: Finished difference Result 194 states and 258 transitions. [2018-06-22 11:57:43,908 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:57:43,908 INFO ]: Start accepts. Automaton has 32 states. Word has length 57 [2018-06-22 11:57:43,908 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:43,909 INFO ]: With dead ends: 194 [2018-06-22 11:57:43,909 INFO ]: Without dead ends: 110 [2018-06-22 11:57:43,910 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=327, Invalid=1929, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:57:43,910 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 11:57:43,916 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 104. [2018-06-22 11:57:43,916 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-22 11:57:43,917 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2018-06-22 11:57:43,917 INFO ]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 57 [2018-06-22 11:57:43,917 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:43,917 INFO ]: Abstraction has 104 states and 149 transitions. [2018-06-22 11:57:43,917 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:57:43,917 INFO ]: Start isEmpty. Operand 104 states and 149 transitions. [2018-06-22 11:57:43,918 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:57:43,918 INFO ]: Found error trace [2018-06-22 11:57:43,918 INFO ]: trace histogram [8, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:43,918 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:43,919 INFO ]: Analyzing trace with hash 930463693, now seen corresponding path program 11 times [2018-06-22 11:57:43,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:43,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:43,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:43,919 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:43,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:43,933 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:44,153 INFO ]: Checked inductivity of 150 backedges. 56 proven. 31 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-22 11:57:44,153 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:44,153 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 11:57:44,159 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:57:44,205 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 11:57:44,205 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:44,208 INFO ]: Computing forward predicates... [2018-06-22 11:57:44,640 INFO ]: Checked inductivity of 150 backedges. 56 proven. 31 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-22 11:57:44,659 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:44,659 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-06-22 11:57:44,660 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:57:44,660 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:57:44,660 INFO ]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:57:44,660 INFO ]: Start difference. First operand 104 states and 149 transitions. Second operand 28 states. [2018-06-22 11:57:45,251 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:45,251 INFO ]: Finished difference Result 150 states and 217 transitions. [2018-06-22 11:57:45,252 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 11:57:45,252 INFO ]: Start accepts. Automaton has 28 states. Word has length 61 [2018-06-22 11:57:45,252 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:45,252 INFO ]: With dead ends: 150 [2018-06-22 11:57:45,252 INFO ]: Without dead ends: 136 [2018-06-22 11:57:45,253 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=553, Invalid=2417, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 11:57:45,254 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-22 11:57:45,259 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 94. [2018-06-22 11:57:45,259 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-22 11:57:45,260 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2018-06-22 11:57:45,260 INFO ]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 61 [2018-06-22 11:57:45,260 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:45,260 INFO ]: Abstraction has 94 states and 138 transitions. [2018-06-22 11:57:45,260 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:57:45,260 INFO ]: Start isEmpty. Operand 94 states and 138 transitions. [2018-06-22 11:57:45,261 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:57:45,261 INFO ]: Found error trace [2018-06-22 11:57:45,261 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:45,261 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:45,261 INFO ]: Analyzing trace with hash 1331489976, now seen corresponding path program 10 times [2018-06-22 11:57:45,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:45,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:45,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:45,262 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:45,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:45,275 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:45,444 INFO ]: Checked inductivity of 156 backedges. 30 proven. 59 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 11:57:45,444 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:45,444 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 11:57:45,449 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:57:45,483 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:57:45,483 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:45,486 INFO ]: Computing forward predicates... [2018-06-22 11:57:45,628 INFO ]: Checked inductivity of 156 backedges. 30 proven. 59 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 11:57:45,647 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:45,647 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 28 [2018-06-22 11:57:45,647 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:57:45,648 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:57:45,648 INFO ]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:57:45,648 INFO ]: Start difference. First operand 94 states and 138 transitions. Second operand 28 states. [2018-06-22 11:57:45,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:45,973 INFO ]: Finished difference Result 116 states and 173 transitions. [2018-06-22 11:57:45,973 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:57:45,973 INFO ]: Start accepts. Automaton has 28 states. Word has length 61 [2018-06-22 11:57:45,973 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:45,974 INFO ]: With dead ends: 116 [2018-06-22 11:57:45,974 INFO ]: Without dead ends: 112 [2018-06-22 11:57:45,975 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=1350, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:57:45,975 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:57:45,980 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-06-22 11:57:45,980 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 11:57:45,981 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2018-06-22 11:57:45,981 INFO ]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 61 [2018-06-22 11:57:45,981 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:45,981 INFO ]: Abstraction has 102 states and 151 transitions. [2018-06-22 11:57:45,981 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:57:45,981 INFO ]: Start isEmpty. Operand 102 states and 151 transitions. [2018-06-22 11:57:45,982 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:57:45,982 INFO ]: Found error trace [2018-06-22 11:57:45,982 INFO ]: trace histogram [8, 7, 6, 6, 6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:45,982 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:45,982 INFO ]: Analyzing trace with hash 1120395698, now seen corresponding path program 12 times [2018-06-22 11:57:45,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:45,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:45,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:45,983 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:45,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:45,997 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:46,193 INFO ]: Checked inductivity of 173 backedges. 55 proven. 47 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-22 11:57:46,193 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:46,193 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 11:57:46,200 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:57:46,241 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:57:46,241 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:46,244 INFO ]: Computing forward predicates... [2018-06-22 11:57:46,361 INFO ]: Checked inductivity of 173 backedges. 30 proven. 67 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-22 11:57:46,382 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:46,382 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 27 [2018-06-22 11:57:46,382 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:57:46,382 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:57:46,382 INFO ]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:57:46,382 INFO ]: Start difference. First operand 102 states and 151 transitions. Second operand 27 states. [2018-06-22 11:57:47,293 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:47,293 INFO ]: Finished difference Result 182 states and 270 transitions. [2018-06-22 11:57:47,294 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:57:47,294 INFO ]: Start accepts. Automaton has 27 states. Word has length 65 [2018-06-22 11:57:47,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:47,295 INFO ]: With dead ends: 182 [2018-06-22 11:57:47,295 INFO ]: Without dead ends: 182 [2018-06-22 11:57:47,295 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=1307, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:57:47,296 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-22 11:57:47,303 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 102. [2018-06-22 11:57:47,303 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 11:57:47,305 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2018-06-22 11:57:47,305 INFO ]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 65 [2018-06-22 11:57:47,305 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:47,305 INFO ]: Abstraction has 102 states and 150 transitions. [2018-06-22 11:57:47,305 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:57:47,305 INFO ]: Start isEmpty. Operand 102 states and 150 transitions. [2018-06-22 11:57:47,306 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:57:47,306 INFO ]: Found error trace [2018-06-22 11:57:47,306 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:47,306 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:47,307 INFO ]: Analyzing trace with hash -1649393982, now seen corresponding path program 11 times [2018-06-22 11:57:47,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:47,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:47,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:47,307 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:47,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:47,321 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:47,572 INFO ]: Checked inductivity of 183 backedges. 56 proven. 48 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:57:47,572 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:47,572 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 11:57:47,577 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:57:47,618 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 11:57:47,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:47,620 INFO ]: Computing forward predicates... [2018-06-22 11:57:47,753 INFO ]: Checked inductivity of 183 backedges. 56 proven. 48 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:57:47,772 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:47,772 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-06-22 11:57:47,772 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:57:47,772 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:57:47,772 INFO ]: CoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:57:47,772 INFO ]: Start difference. First operand 102 states and 150 transitions. Second operand 28 states. [2018-06-22 11:57:48,100 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:48,101 INFO ]: Finished difference Result 240 states and 320 transitions. [2018-06-22 11:57:48,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:57:48,104 INFO ]: Start accepts. Automaton has 28 states. Word has length 65 [2018-06-22 11:57:48,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:48,105 INFO ]: With dead ends: 240 [2018-06-22 11:57:48,105 INFO ]: Without dead ends: 122 [2018-06-22 11:57:48,106 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=321, Invalid=1485, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:57:48,106 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-22 11:57:48,111 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 116. [2018-06-22 11:57:48,111 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 11:57:48,112 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2018-06-22 11:57:48,112 INFO ]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 65 [2018-06-22 11:57:48,112 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:48,112 INFO ]: Abstraction has 116 states and 165 transitions. [2018-06-22 11:57:48,112 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:57:48,112 INFO ]: Start isEmpty. Operand 116 states and 165 transitions. [2018-06-22 11:57:48,114 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:57:48,114 INFO ]: Found error trace [2018-06-22 11:57:48,114 INFO ]: trace histogram [9, 7, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:48,114 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:48,114 INFO ]: Analyzing trace with hash 2092270012, now seen corresponding path program 13 times [2018-06-22 11:57:48,114 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:48,114 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:48,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:48,114 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:48,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:48,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:48,535 INFO ]: Checked inductivity of 202 backedges. 72 proven. 43 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-22 11:57:48,535 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:48,535 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 11:57:48,540 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:48,576 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:48,579 INFO ]: Computing forward predicates... [2018-06-22 11:57:48,946 INFO ]: Checked inductivity of 202 backedges. 72 proven. 43 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-22 11:57:48,965 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:48,965 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 31 [2018-06-22 11:57:48,965 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:57:48,965 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:57:48,966 INFO ]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:57:48,966 INFO ]: Start difference. First operand 116 states and 165 transitions. Second operand 31 states. [2018-06-22 11:57:49,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:49,676 INFO ]: Finished difference Result 168 states and 242 transitions. [2018-06-22 11:57:49,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 11:57:49,676 INFO ]: Start accepts. Automaton has 31 states. Word has length 69 [2018-06-22 11:57:49,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:49,676 INFO ]: With dead ends: 168 [2018-06-22 11:57:49,676 INFO ]: Without dead ends: 152 [2018-06-22 11:57:49,677 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=705, Invalid=3077, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 11:57:49,677 INFO ]: Start minimizeSevpa. Operand 152 states. [2018-06-22 11:57:49,683 INFO ]: Finished minimizeSevpa. Reduced states from 152 to 104. [2018-06-22 11:57:49,683 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-22 11:57:49,684 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2018-06-22 11:57:49,684 INFO ]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 69 [2018-06-22 11:57:49,684 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:49,684 INFO ]: Abstraction has 104 states and 152 transitions. [2018-06-22 11:57:49,684 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:57:49,684 INFO ]: Start isEmpty. Operand 104 states and 152 transitions. [2018-06-22 11:57:49,687 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:57:49,687 INFO ]: Found error trace [2018-06-22 11:57:49,687 INFO ]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:49,687 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:49,687 INFO ]: Analyzing trace with hash -554636441, now seen corresponding path program 12 times [2018-06-22 11:57:49,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:49,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:49,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:49,688 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:49,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:49,702 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:50,122 INFO ]: Checked inductivity of 210 backedges. 42 proven. 76 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-22 11:57:50,122 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:50,122 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 11:57:50,128 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:57:50,193 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:57:50,193 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:50,197 INFO ]: Computing forward predicates... [2018-06-22 11:57:50,564 INFO ]: Checked inductivity of 210 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-06-22 11:57:50,583 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:50,583 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 35 [2018-06-22 11:57:50,583 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:57:50,583 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:57:50,584 INFO ]: CoverageRelationStatistics Valid=122, Invalid=1068, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:57:50,584 INFO ]: Start difference. First operand 104 states and 152 transitions. Second operand 35 states. [2018-06-22 11:57:51,752 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:51,752 INFO ]: Finished difference Result 156 states and 231 transitions. [2018-06-22 11:57:51,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 11:57:51,752 INFO ]: Start accepts. Automaton has 35 states. Word has length 69 [2018-06-22 11:57:51,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:51,753 INFO ]: With dead ends: 156 [2018-06-22 11:57:51,753 INFO ]: Without dead ends: 148 [2018-06-22 11:57:51,753 INFO ]: 0 DeclaredPredicates, 134 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=576, Invalid=3846, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 11:57:51,754 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-22 11:57:51,759 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 112. [2018-06-22 11:57:51,759 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-22 11:57:51,760 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 165 transitions. [2018-06-22 11:57:51,760 INFO ]: Start accepts. Automaton has 112 states and 165 transitions. Word has length 69 [2018-06-22 11:57:51,761 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:51,761 INFO ]: Abstraction has 112 states and 165 transitions. [2018-06-22 11:57:51,761 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:57:51,761 INFO ]: Start isEmpty. Operand 112 states and 165 transitions. [2018-06-22 11:57:51,762 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:57:51,762 INFO ]: Found error trace [2018-06-22 11:57:51,762 INFO ]: trace histogram [9, 8, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:51,762 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:51,762 INFO ]: Analyzing trace with hash -417594975, now seen corresponding path program 14 times [2018-06-22 11:57:51,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:51,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:51,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:51,763 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:51,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:51,778 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:52,427 INFO ]: Checked inductivity of 229 backedges. 71 proven. 62 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-22 11:57:52,427 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:52,427 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 11:57:52,432 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:52,472 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:52,472 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:52,475 INFO ]: Computing forward predicates... [2018-06-22 11:57:52,651 INFO ]: Checked inductivity of 229 backedges. 42 proven. 86 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-22 11:57:52,670 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:52,670 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 30 [2018-06-22 11:57:52,670 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:57:52,670 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:57:52,670 INFO ]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:57:52,671 INFO ]: Start difference. First operand 112 states and 165 transitions. Second operand 30 states. [2018-06-22 11:57:53,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:53,652 INFO ]: Finished difference Result 226 states and 335 transitions. [2018-06-22 11:57:53,653 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:57:53,653 INFO ]: Start accepts. Automaton has 30 states. Word has length 73 [2018-06-22 11:57:53,653 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:53,654 INFO ]: With dead ends: 226 [2018-06-22 11:57:53,654 INFO ]: Without dead ends: 226 [2018-06-22 11:57:53,654 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=323, Invalid=1657, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:57:53,655 INFO ]: Start minimizeSevpa. Operand 226 states. [2018-06-22 11:57:53,667 INFO ]: Finished minimizeSevpa. Reduced states from 226 to 112. [2018-06-22 11:57:53,667 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-22 11:57:53,668 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2018-06-22 11:57:53,668 INFO ]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 73 [2018-06-22 11:57:53,668 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:53,668 INFO ]: Abstraction has 112 states and 164 transitions. [2018-06-22 11:57:53,668 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:57:53,668 INFO ]: Start isEmpty. Operand 112 states and 164 transitions. [2018-06-22 11:57:53,670 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:57:53,670 INFO ]: Found error trace [2018-06-22 11:57:53,670 INFO ]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:53,670 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:53,670 INFO ]: Analyzing trace with hash 1644484273, now seen corresponding path program 13 times [2018-06-22 11:57:53,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:53,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:53,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:53,671 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:53,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:53,687 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:53,894 INFO ]: Checked inductivity of 241 backedges. 72 proven. 63 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-22 11:57:53,894 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:53,894 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 11:57:53,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:53,938 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:53,942 INFO ]: Computing forward predicates... [2018-06-22 11:57:54,187 INFO ]: Checked inductivity of 241 backedges. 72 proven. 63 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-22 11:57:54,206 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:54,206 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 31 [2018-06-22 11:57:54,206 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:57:54,206 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:57:54,206 INFO ]: CoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:57:54,206 INFO ]: Start difference. First operand 112 states and 164 transitions. Second operand 31 states. [2018-06-22 11:57:54,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:54,609 INFO ]: Finished difference Result 292 states and 391 transitions. [2018-06-22 11:57:54,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:57:54,609 INFO ]: Start accepts. Automaton has 31 states. Word has length 73 [2018-06-22 11:57:54,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:54,610 INFO ]: With dead ends: 292 [2018-06-22 11:57:54,610 INFO ]: Without dead ends: 134 [2018-06-22 11:57:54,610 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=400, Invalid=1856, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:57:54,611 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-22 11:57:54,616 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 128. [2018-06-22 11:57:54,616 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-22 11:57:54,617 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 181 transitions. [2018-06-22 11:57:54,617 INFO ]: Start accepts. Automaton has 128 states and 181 transitions. Word has length 73 [2018-06-22 11:57:54,617 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:54,617 INFO ]: Abstraction has 128 states and 181 transitions. [2018-06-22 11:57:54,617 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:57:54,617 INFO ]: Start isEmpty. Operand 128 states and 181 transitions. [2018-06-22 11:57:54,618 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:57:54,618 INFO ]: Found error trace [2018-06-22 11:57:54,618 INFO ]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:54,619 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:54,619 INFO ]: Analyzing trace with hash 771244374, now seen corresponding path program 14 times [2018-06-22 11:57:54,619 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:54,619 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:54,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:54,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:54,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:54,637 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:55,127 INFO ]: Checked inductivity of 272 backedges. 56 proven. 95 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-06-22 11:57:55,127 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:55,127 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 11:57:55,133 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:55,176 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:55,176 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:55,180 INFO ]: Computing forward predicates... [2018-06-22 11:57:55,419 INFO ]: Checked inductivity of 272 backedges. 56 proven. 95 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-06-22 11:57:55,438 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:55,438 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 34 [2018-06-22 11:57:55,438 INFO ]: Interpolant automaton has 34 states [2018-06-22 11:57:55,438 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 11:57:55,438 INFO ]: CoverageRelationStatistics Valid=211, Invalid=911, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:57:55,438 INFO ]: Start difference. First operand 128 states and 181 transitions. Second operand 34 states. [2018-06-22 11:57:55,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:55,866 INFO ]: Finished difference Result 150 states and 216 transitions. [2018-06-22 11:57:55,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:57:55,866 INFO ]: Start accepts. Automaton has 34 states. Word has length 77 [2018-06-22 11:57:55,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:55,867 INFO ]: With dead ends: 150 [2018-06-22 11:57:55,867 INFO ]: Without dead ends: 146 [2018-06-22 11:57:55,867 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=451, Invalid=2099, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:57:55,868 INFO ]: Start minimizeSevpa. Operand 146 states. [2018-06-22 11:57:55,871 INFO ]: Finished minimizeSevpa. Reduced states from 146 to 136. [2018-06-22 11:57:55,871 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-22 11:57:55,872 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2018-06-22 11:57:55,872 INFO ]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 77 [2018-06-22 11:57:55,872 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:55,872 INFO ]: Abstraction has 136 states and 194 transitions. [2018-06-22 11:57:55,872 INFO ]: Interpolant automaton has 34 states. [2018-06-22 11:57:55,872 INFO ]: Start isEmpty. Operand 136 states and 194 transitions. [2018-06-22 11:57:55,874 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:57:55,874 INFO ]: Found error trace [2018-06-22 11:57:55,874 INFO ]: trace histogram [10, 8, 7, 7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:55,874 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:55,874 INFO ]: Analyzing trace with hash -1390908693, now seen corresponding path program 15 times [2018-06-22 11:57:55,874 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:55,874 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:55,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:55,875 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:55,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:55,891 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:56,294 INFO ]: Checked inductivity of 262 backedges. 90 proven. 57 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-06-22 11:57:56,294 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:56,294 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 11:57:56,300 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:56,349 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 11:57:56,349 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:56,353 INFO ]: Computing forward predicates... [2018-06-22 11:57:57,284 INFO ]: Checked inductivity of 262 backedges. 90 proven. 57 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-06-22 11:57:57,303 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:57,303 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 34 [2018-06-22 11:57:57,303 INFO ]: Interpolant automaton has 34 states [2018-06-22 11:57:57,303 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 11:57:57,303 INFO ]: CoverageRelationStatistics Valid=211, Invalid=911, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:57:57,304 INFO ]: Start difference. First operand 136 states and 194 transitions. Second operand 34 states. [2018-06-22 11:57:58,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:58,215 INFO ]: Finished difference Result 198 states and 285 transitions. [2018-06-22 11:57:58,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 11:57:58,216 INFO ]: Start accepts. Automaton has 34 states. Word has length 77 [2018-06-22 11:57:58,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:58,216 INFO ]: With dead ends: 198 [2018-06-22 11:57:58,216 INFO ]: Without dead ends: 180 [2018-06-22 11:57:58,217 INFO ]: 0 DeclaredPredicates, 147 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=876, Invalid=3816, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 11:57:58,217 INFO ]: Start minimizeSevpa. Operand 180 states. [2018-06-22 11:57:58,224 INFO ]: Finished minimizeSevpa. Reduced states from 180 to 122. [2018-06-22 11:57:58,224 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-22 11:57:58,225 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 179 transitions. [2018-06-22 11:57:58,225 INFO ]: Start accepts. Automaton has 122 states and 179 transitions. Word has length 77 [2018-06-22 11:57:58,225 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:58,225 INFO ]: Abstraction has 122 states and 179 transitions. [2018-06-22 11:57:58,225 INFO ]: Interpolant automaton has 34 states. [2018-06-22 11:57:58,225 INFO ]: Start isEmpty. Operand 122 states and 179 transitions. [2018-06-22 11:57:58,226 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:57:58,226 INFO ]: Found error trace [2018-06-22 11:57:58,226 INFO ]: trace histogram [10, 9, 8, 8, 8, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:58,226 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:58,226 INFO ]: Analyzing trace with hash 835299536, now seen corresponding path program 16 times [2018-06-22 11:57:58,226 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:58,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:58,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:58,227 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:58,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:58,244 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:58,487 INFO ]: Checked inductivity of 293 backedges. 89 proven. 79 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-06-22 11:57:58,487 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:58,487 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:58,500 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:57:58,545 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:57:58,545 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:58,548 INFO ]: Computing forward predicates... [2018-06-22 11:57:58,917 INFO ]: Checked inductivity of 293 backedges. 56 proven. 107 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-06-22 11:57:58,935 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:58,935 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 33 [2018-06-22 11:57:58,936 INFO ]: Interpolant automaton has 33 states [2018-06-22 11:57:58,936 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 11:57:58,936 INFO ]: CoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:57:58,936 INFO ]: Start difference. First operand 122 states and 179 transitions. Second operand 33 states. [2018-06-22 11:57:59,373 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:59,373 INFO ]: Finished difference Result 276 states and 409 transitions. [2018-06-22 11:57:59,373 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:57:59,373 INFO ]: Start accepts. Automaton has 33 states. Word has length 81 [2018-06-22 11:57:59,373 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:59,374 INFO ]: With dead ends: 276 [2018-06-22 11:57:59,374 INFO ]: Without dead ends: 276 [2018-06-22 11:57:59,374 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=402, Invalid=2048, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:57:59,374 INFO ]: Start minimizeSevpa. Operand 276 states. [2018-06-22 11:57:59,383 INFO ]: Finished minimizeSevpa. Reduced states from 276 to 122. [2018-06-22 11:57:59,383 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-22 11:57:59,384 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2018-06-22 11:57:59,384 INFO ]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 81 [2018-06-22 11:57:59,384 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:59,384 INFO ]: Abstraction has 122 states and 178 transitions. [2018-06-22 11:57:59,384 INFO ]: Interpolant automaton has 33 states. [2018-06-22 11:57:59,384 INFO ]: Start isEmpty. Operand 122 states and 178 transitions. [2018-06-22 11:57:59,385 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:57:59,385 INFO ]: Found error trace [2018-06-22 11:57:59,385 INFO ]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:59,385 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:59,385 INFO ]: Analyzing trace with hash -524618272, now seen corresponding path program 15 times [2018-06-22 11:57:59,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:59,385 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:59,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:59,386 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:59,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:59,401 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:59,771 INFO ]: Checked inductivity of 307 backedges. 90 proven. 80 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-06-22 11:57:59,771 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:59,771 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:59,777 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:59,887 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 11:57:59,887 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:59,891 INFO ]: Computing forward predicates... [2018-06-22 11:58:00,331 INFO ]: Checked inductivity of 307 backedges. 90 proven. 80 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-06-22 11:58:00,349 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:00,349 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2018-06-22 11:58:00,350 INFO ]: Interpolant automaton has 44 states [2018-06-22 11:58:00,350 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 11:58:00,350 INFO ]: CoverageRelationStatistics Valid=274, Invalid=1618, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:58:00,350 INFO ]: Start difference. First operand 122 states and 178 transitions. Second operand 44 states. [2018-06-22 11:58:01,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:01,207 INFO ]: Finished difference Result 350 states and 471 transitions. [2018-06-22 11:58:01,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:58:01,207 INFO ]: Start accepts. Automaton has 44 states. Word has length 81 [2018-06-22 11:58:01,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:01,208 INFO ]: With dead ends: 350 [2018-06-22 11:58:01,208 INFO ]: Without dead ends: 146 [2018-06-22 11:58:01,208 INFO ]: 0 DeclaredPredicates, 140 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=624, Invalid=3666, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 11:58:01,208 INFO ]: Start minimizeSevpa. Operand 146 states. [2018-06-22 11:58:01,214 INFO ]: Finished minimizeSevpa. Reduced states from 146 to 140. [2018-06-22 11:58:01,215 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-22 11:58:01,215 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 197 transitions. [2018-06-22 11:58:01,215 INFO ]: Start accepts. Automaton has 140 states and 197 transitions. Word has length 81 [2018-06-22 11:58:01,215 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:01,215 INFO ]: Abstraction has 140 states and 197 transitions. [2018-06-22 11:58:01,215 INFO ]: Interpolant automaton has 44 states. [2018-06-22 11:58:01,215 INFO ]: Start isEmpty. Operand 140 states and 197 transitions. [2018-06-22 11:58:01,216 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:58:01,216 INFO ]: Found error trace [2018-06-22 11:58:01,216 INFO ]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:01,216 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:01,217 INFO ]: Analyzing trace with hash 280460933, now seen corresponding path program 16 times [2018-06-22 11:58:01,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:01,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:01,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:01,217 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:01,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:01,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:01,568 INFO ]: Checked inductivity of 342 backedges. 72 proven. 116 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-06-22 11:58:01,569 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:01,569 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:01,575 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:58:01,626 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:58:01,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:01,630 INFO ]: Computing forward predicates... [2018-06-22 11:58:02,169 INFO ]: Checked inductivity of 342 backedges. 72 proven. 116 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-06-22 11:58:02,188 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:02,188 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 37 [2018-06-22 11:58:02,188 INFO ]: Interpolant automaton has 37 states [2018-06-22 11:58:02,188 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 11:58:02,188 INFO ]: CoverageRelationStatistics Valid=253, Invalid=1079, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:58:02,188 INFO ]: Start difference. First operand 140 states and 197 transitions. Second operand 37 states. [2018-06-22 11:58:02,541 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:02,541 INFO ]: Finished difference Result 162 states and 232 transitions. [2018-06-22 11:58:02,541 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 11:58:02,541 INFO ]: Start accepts. Automaton has 37 states. Word has length 85 [2018-06-22 11:58:02,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:02,542 INFO ]: With dead ends: 162 [2018-06-22 11:58:02,542 INFO ]: Without dead ends: 158 [2018-06-22 11:58:02,543 INFO ]: 0 DeclaredPredicates, 145 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=545, Invalid=2535, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 11:58:02,543 INFO ]: Start minimizeSevpa. Operand 158 states. [2018-06-22 11:58:02,549 INFO ]: Finished minimizeSevpa. Reduced states from 158 to 148. [2018-06-22 11:58:02,549 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 11:58:02,550 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 210 transitions. [2018-06-22 11:58:02,551 INFO ]: Start accepts. Automaton has 148 states and 210 transitions. Word has length 85 [2018-06-22 11:58:02,551 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:02,551 INFO ]: Abstraction has 148 states and 210 transitions. [2018-06-22 11:58:02,551 INFO ]: Interpolant automaton has 37 states. [2018-06-22 11:58:02,551 INFO ]: Start isEmpty. Operand 148 states and 210 transitions. [2018-06-22 11:58:02,552 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:58:02,552 INFO ]: Found error trace [2018-06-22 11:58:02,552 INFO ]: trace histogram [11, 9, 8, 8, 8, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:02,552 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:02,552 INFO ]: Analyzing trace with hash 880216922, now seen corresponding path program 17 times [2018-06-22 11:58:02,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:02,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:02,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:02,555 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:02,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:02,570 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:02,972 INFO ]: Checked inductivity of 330 backedges. 110 proven. 73 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-06-22 11:58:02,972 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:02,972 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:02,977 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:58:03,033 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-06-22 11:58:03,033 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:03,038 INFO ]: Computing forward predicates... [2018-06-22 11:58:03,454 INFO ]: Checked inductivity of 330 backedges. 20 proven. 91 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-06-22 11:58:03,472 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:03,472 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17] total 40 [2018-06-22 11:58:03,472 INFO ]: Interpolant automaton has 40 states [2018-06-22 11:58:03,473 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 11:58:03,473 INFO ]: CoverageRelationStatistics Valid=171, Invalid=1389, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:58:03,473 INFO ]: Start difference. First operand 148 states and 210 transitions. Second operand 40 states. [2018-06-22 11:58:05,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:05,407 INFO ]: Finished difference Result 174 states and 235 transitions. [2018-06-22 11:58:05,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 11:58:05,407 INFO ]: Start accepts. Automaton has 40 states. Word has length 85 [2018-06-22 11:58:05,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:05,408 INFO ]: With dead ends: 174 [2018-06-22 11:58:05,408 INFO ]: Without dead ends: 152 [2018-06-22 11:58:05,408 INFO ]: 0 DeclaredPredicates, 166 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=656, Invalid=5986, Unknown=0, NotChecked=0, Total=6642 [2018-06-22 11:58:05,408 INFO ]: Start minimizeSevpa. Operand 152 states. [2018-06-22 11:58:05,415 INFO ]: Finished minimizeSevpa. Reduced states from 152 to 132. [2018-06-22 11:58:05,415 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-22 11:58:05,415 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 192 transitions. [2018-06-22 11:58:05,415 INFO ]: Start accepts. Automaton has 132 states and 192 transitions. Word has length 85 [2018-06-22 11:58:05,416 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:05,416 INFO ]: Abstraction has 132 states and 192 transitions. [2018-06-22 11:58:05,416 INFO ]: Interpolant automaton has 40 states. [2018-06-22 11:58:05,416 INFO ]: Start isEmpty. Operand 132 states and 192 transitions. [2018-06-22 11:58:05,416 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:58:05,417 INFO ]: Found error trace [2018-06-22 11:58:05,417 INFO ]: trace histogram [11, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:05,417 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:05,417 INFO ]: Analyzing trace with hash -1741476785, now seen corresponding path program 17 times [2018-06-22 11:58:05,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:05,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:05,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:05,417 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:05,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:05,435 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:05,765 INFO ]: Checked inductivity of 381 backedges. 110 proven. 99 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-06-22 11:58:05,765 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:05,765 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:05,770 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:58:05,830 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-06-22 11:58:05,830 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:05,835 INFO ]: Computing forward predicates... [2018-06-22 11:58:06,496 INFO ]: Checked inductivity of 381 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-06-22 11:58:06,516 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:06,516 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 42 [2018-06-22 11:58:06,516 INFO ]: Interpolant automaton has 42 states [2018-06-22 11:58:06,516 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 11:58:06,516 INFO ]: CoverageRelationStatistics Valid=174, Invalid=1548, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:58:06,516 INFO ]: Start difference. First operand 132 states and 192 transitions. Second operand 42 states. Received shutdown request... [2018-06-22 11:58:13,346 WARN ]: Removed 11 from assertion stack [2018-06-22 11:58:13,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-06-22 11:58:13,347 WARN ]: Verification canceled [2018-06-22 11:58:13,490 WARN ]: Timeout [2018-06-22 11:58:13,491 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:58:13 BoogieIcfgContainer [2018-06-22 11:58:13,491 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:58:13,491 INFO ]: Toolchain (without parser) took 57147.93 ms. Allocated memory was 305.7 MB in the beginning and 782.8 MB in the end (delta: 477.1 MB). Free memory was 261.0 MB in the beginning and 750.4 MB in the end (delta: -489.4 MB). Peak memory consumption was 255.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:58:13,493 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:58:13,493 INFO ]: ChcToBoogie took 48.84 ms. Allocated memory is still 305.7 MB. Free memory was 261.0 MB in the beginning and 259.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:58:13,494 INFO ]: Boogie Preprocessor took 36.36 ms. Allocated memory is still 305.7 MB. Free memory was 259.0 MB in the beginning and 258.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:58:13,494 INFO ]: RCFGBuilder took 361.34 ms. Allocated memory is still 305.7 MB. Free memory was 258.0 MB in the beginning and 248.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:58:13,494 INFO ]: TraceAbstraction took 56692.37 ms. Allocated memory was 305.7 MB in the beginning and 782.8 MB in the end (delta: 477.1 MB). Free memory was 248.0 MB in the beginning and 750.4 MB in the end (delta: -502.4 MB). Peak memory consumption was 242.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:58:13,497 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 48.84 ms. Allocated memory is still 305.7 MB. Free memory was 261.0 MB in the beginning and 259.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 36.36 ms. Allocated memory is still 305.7 MB. Free memory was 259.0 MB in the beginning and 258.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 361.34 ms. Allocated memory is still 305.7 MB. Free memory was 258.0 MB in the beginning and 248.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56692.37 ms. Allocated memory was 305.7 MB in the beginning and 782.8 MB in the end (delta: 477.1 MB). Free memory was 248.0 MB in the beginning and 750.4 MB in the end (delta: -502.4 MB). Peak memory consumption was 242.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 161 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 38. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. TIMEOUT Result, 56.6s OverallTime, 47 OverallIterations, 11 TraceHistogramMax, 29.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1358 SDtfs, 824 SDslu, 12239 SDs, 0 SdLazy, 19409 SolverSat, 2642 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3653 GetRequests, 2006 SyntacticMatches, 15 SemanticMatches, 1631 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25562 ImplicationChecksByTransitivity, 33.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=45, 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.4s AutomataMinimizationTime, 46 MinimizatonAttempts, 1068 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 23.0s InterpolantComputationTime, 4184 NumberOfCodeBlocks, 4174 NumberOfCodeBlocksAsserted, 190 NumberOfCheckSat, 4096 ConstructedInterpolants, 0 QuantifiedInterpolants, 829488 SizeOfPredicates, 463 NumberOfNonLiveVariables, 11939 ConjunctsInSsa, 1379 ConjunctsInUnsatCore, 88 InterpolantComputations, 6 PerfectInterpolantSequences, 6999/9902 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_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-58-13-512.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-58-13-512.csv Completed graceful shutdown