java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:14:50,804 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:14:50,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:14:50,822 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:14:50,822 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:14:50,823 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:14:50,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:14:50,827 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:14:50,828 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:14:50,830 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:14:50,831 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:14:50,831 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:14:50,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:14:50,833 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:14:50,836 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:14:50,837 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:14:50,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:14:50,852 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:14:50,853 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:14:50,854 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:14:50,855 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:14:50,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:14:50,857 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:14:50,857 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:14:50,858 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:14:50,862 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:14:50,863 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:14:50,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:14:50,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:14:50,864 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:14:50,871 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:14:50,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:14:50,872 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:14:50,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:14:50,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:14:50,873 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:14:50,892 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:14:50,893 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:14:50,893 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:14:50,893 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:14:50,894 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:14:50,894 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:14:50,894 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:14:50,895 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:14:50,896 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:14:50,896 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:14:50,896 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:14:50,896 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:14:50,896 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:14:50,896 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:14:50,897 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:14:50,897 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:14:50,897 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:14:50,898 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:14:50,898 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:14:50,948 INFO ]: Repository-Root is: /tmp [2018-06-22 01:14:50,961 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:14:50,965 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:14:50,967 INFO ]: Initializing SmtParser... [2018-06-22 01:14:50,967 INFO ]: SmtParser initialized [2018-06-22 01:14:50,968 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 [2018-06-22 01:14:50,969 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 01:14:51,051 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 unknown [2018-06-22 01:14:51,233 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 [2018-06-22 01:14:51,238 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:14:51,243 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:14:51,244 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:14:51,244 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:14:51,244 INFO ]: ChcToBoogie initialized [2018-06-22 01:14:51,247 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:14:51" (1/1) ... [2018-06-22 01:14:51,296 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:51 Unit [2018-06-22 01:14:51,296 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:14:51,297 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:14:51,297 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:14:51,297 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:14:51,317 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:51" (1/1) ... [2018-06-22 01:14:51,317 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:51" (1/1) ... [2018-06-22 01:14:51,323 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:51" (1/1) ... [2018-06-22 01:14:51,323 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:51" (1/1) ... [2018-06-22 01:14:51,326 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:51" (1/1) ... [2018-06-22 01:14:51,330 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:51" (1/1) ... [2018-06-22 01:14:51,331 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:51" (1/1) ... [2018-06-22 01:14:51,332 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:14:51,333 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:14:51,333 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:14:51,333 INFO ]: RCFGBuilder initialized [2018-06-22 01:14:51,341 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:51" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:14:51,356 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:14:51,356 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:14:51,356 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:14:51,356 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:14:51,356 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:14:51,356 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 01:14:51,636 INFO ]: Using library mode [2018-06-22 01:14:51,637 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:14:51 BoogieIcfgContainer [2018-06-22 01:14:51,637 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:14:51,638 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:14:51,638 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:14:51,641 INFO ]: TraceAbstraction initialized [2018-06-22 01:14:51,642 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:14:51" (1/3) ... [2018-06-22 01:14:51,643 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229f571c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:14:51, skipping insertion in model container [2018-06-22 01:14:51,643 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:51" (2/3) ... [2018-06-22 01:14:51,643 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229f571c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:14:51, skipping insertion in model container [2018-06-22 01:14:51,643 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:14:51" (3/3) ... [2018-06-22 01:14:51,645 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:14:51,654 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:14:51,665 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:14:51,721 INFO ]: Using default assertion order modulation [2018-06-22 01:14:51,722 INFO ]: Interprodecural is true [2018-06-22 01:14:51,722 INFO ]: Hoare is false [2018-06-22 01:14:51,722 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:14:51,722 INFO ]: Backedges is TWOTRACK [2018-06-22 01:14:51,722 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:14:51,722 INFO ]: Difference is false [2018-06-22 01:14:51,722 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:14:51,722 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:14:51,741 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 01:14:51,756 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 01:14:51,756 INFO ]: Found error trace [2018-06-22 01:14:51,757 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 01:14:51,758 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:51,763 INFO ]: Analyzing trace with hash 2118773842, now seen corresponding path program 1 times [2018-06-22 01:14:51,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:51,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:51,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:51,804 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:51,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:51,829 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:51,860 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:51,862 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:51,862 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:14:51,864 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:14:51,881 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:14:51,881 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:14:51,884 INFO ]: Start difference. First operand 13 states. Second operand 2 states. [2018-06-22 01:14:51,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:51,903 INFO ]: Finished difference Result 11 states and 16 transitions. [2018-06-22 01:14:51,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:14:51,913 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 01:14:51,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:51,929 INFO ]: With dead ends: 11 [2018-06-22 01:14:51,929 INFO ]: Without dead ends: 11 [2018-06-22 01:14:51,931 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:14:51,945 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:14:51,960 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:14:51,961 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:14:51,961 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-06-22 01:14:51,962 INFO ]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 6 [2018-06-22 01:14:51,963 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:51,963 INFO ]: Abstraction has 11 states and 16 transitions. [2018-06-22 01:14:51,963 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:14:51,963 INFO ]: Start isEmpty. Operand 11 states and 16 transitions. [2018-06-22 01:14:51,963 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:14:51,963 INFO ]: Found error trace [2018-06-22 01:14:51,963 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:51,963 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:51,964 INFO ]: Analyzing trace with hash 242318572, now seen corresponding path program 1 times [2018-06-22 01:14:51,964 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:51,964 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:51,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:51,964 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:51,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:51,984 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:52,017 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:52,017 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:52,017 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:14:52,019 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:14:52,019 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:14:52,019 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:52,019 INFO ]: Start difference. First operand 11 states and 16 transitions. Second operand 3 states. [2018-06-22 01:14:52,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:52,052 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-22 01:14:52,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:14:52,053 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:14:52,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:52,054 INFO ]: With dead ends: 11 [2018-06-22 01:14:52,054 INFO ]: Without dead ends: 11 [2018-06-22 01:14:52,055 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:52,055 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:14:52,056 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:14:52,056 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:14:52,056 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-06-22 01:14:52,056 INFO ]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 8 [2018-06-22 01:14:52,056 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:52,056 INFO ]: Abstraction has 11 states and 15 transitions. [2018-06-22 01:14:52,056 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:14:52,056 INFO ]: Start isEmpty. Operand 11 states and 15 transitions. [2018-06-22 01:14:52,057 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:14:52,057 INFO ]: Found error trace [2018-06-22 01:14:52,057 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:52,057 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:52,057 INFO ]: Analyzing trace with hash -961402906, now seen corresponding path program 1 times [2018-06-22 01:14:52,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:52,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:52,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:52,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:52,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:52,074 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:52,115 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:52,115 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:52,115 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:14:52,115 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:14:52,115 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:14:52,115 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:52,116 INFO ]: Start difference. First operand 11 states and 15 transitions. Second operand 3 states. [2018-06-22 01:14:52,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:52,162 INFO ]: Finished difference Result 12 states and 17 transitions. [2018-06-22 01:14:52,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:14:52,163 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:14:52,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:52,163 INFO ]: With dead ends: 12 [2018-06-22 01:14:52,163 INFO ]: Without dead ends: 11 [2018-06-22 01:14:52,163 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:52,164 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:14:52,165 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:14:52,165 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:14:52,166 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-06-22 01:14:52,166 INFO ]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 9 [2018-06-22 01:14:52,166 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:52,166 INFO ]: Abstraction has 11 states and 14 transitions. [2018-06-22 01:14:52,166 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:14:52,166 INFO ]: Start isEmpty. Operand 11 states and 14 transitions. [2018-06-22 01:14:52,166 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:14:52,166 INFO ]: Found error trace [2018-06-22 01:14:52,166 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:52,166 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:52,166 INFO ]: Analyzing trace with hash -1855731484, now seen corresponding path program 1 times [2018-06-22 01:14:52,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:52,167 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:52,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:52,167 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:52,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:52,183 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:52,308 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:52,308 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:52,308 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:14:52,308 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:14:52,308 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:14:52,309 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:14:52,309 INFO ]: Start difference. First operand 11 states and 14 transitions. Second operand 5 states. [2018-06-22 01:14:52,501 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:52,501 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-22 01:14:52,502 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:14:52,502 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:14:52,502 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:52,505 INFO ]: With dead ends: 17 [2018-06-22 01:14:52,505 INFO ]: Without dead ends: 17 [2018-06-22 01:14:52,505 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:14:52,505 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:14:52,509 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-22 01:14:52,509 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:14:52,510 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-22 01:14:52,510 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 10 [2018-06-22 01:14:52,510 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:52,510 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-22 01:14:52,510 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:14:52,510 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-22 01:14:52,510 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:14:52,510 INFO ]: Found error trace [2018-06-22 01:14:52,510 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:52,511 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:52,513 INFO ]: Analyzing trace with hash -1576445202, now seen corresponding path program 1 times [2018-06-22 01:14:52,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:52,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:52,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:52,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:52,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:52,547 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:52,720 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:52,720 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:52,720 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 01:14:52,730 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:52,772 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:52,781 INFO ]: Computing forward predicates... [2018-06-22 01:14:52,864 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:52,889 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:14:52,889 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-06-22 01:14:52,889 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:14:52,889 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:14:52,889 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:14:52,890 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 7 states. [2018-06-22 01:14:53,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:53,069 INFO ]: Finished difference Result 19 states and 29 transitions. [2018-06-22 01:14:53,070 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:14:53,070 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-22 01:14:53,070 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:53,070 INFO ]: With dead ends: 19 [2018-06-22 01:14:53,070 INFO ]: Without dead ends: 18 [2018-06-22 01:14:53,071 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:14:53,071 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:14:53,073 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-06-22 01:14:53,073 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:14:53,073 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2018-06-22 01:14:53,073 INFO ]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 11 [2018-06-22 01:14:53,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:53,074 INFO ]: Abstraction has 15 states and 23 transitions. [2018-06-22 01:14:53,074 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:14:53,074 INFO ]: Start isEmpty. Operand 15 states and 23 transitions. [2018-06-22 01:14:53,074 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:14:53,074 INFO ]: Found error trace [2018-06-22 01:14:53,074 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:53,074 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:53,074 INFO ]: Analyzing trace with hash -1519186900, now seen corresponding path program 1 times [2018-06-22 01:14:53,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:53,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:53,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:53,075 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:53,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:53,090 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:53,122 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:53,122 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:53,122 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:14:53,123 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:14:53,123 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:14:53,123 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:53,123 INFO ]: Start difference. First operand 15 states and 23 transitions. Second operand 3 states. [2018-06-22 01:14:53,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:53,139 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-22 01:14:53,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:14:53,140 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-22 01:14:53,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:53,140 INFO ]: With dead ends: 17 [2018-06-22 01:14:53,140 INFO ]: Without dead ends: 14 [2018-06-22 01:14:53,140 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:53,141 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:14:53,144 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:14:53,144 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:14:53,145 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-06-22 01:14:53,145 INFO ]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-06-22 01:14:53,145 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:53,145 INFO ]: Abstraction has 14 states and 19 transitions. [2018-06-22 01:14:53,145 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:14:53,145 INFO ]: Start isEmpty. Operand 14 states and 19 transitions. [2018-06-22 01:14:53,145 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:14:53,146 INFO ]: Found error trace [2018-06-22 01:14:53,146 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:53,146 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:53,146 INFO ]: Analyzing trace with hash 484853670, now seen corresponding path program 1 times [2018-06-22 01:14:53,146 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:53,146 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:53,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:53,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:53,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:53,159 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:53,205 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:53,206 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:53,206 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:14:53,206 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:14:53,206 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:14:53,206 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:14:53,206 INFO ]: Start difference. First operand 14 states and 19 transitions. Second operand 4 states. [2018-06-22 01:14:53,270 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:53,270 INFO ]: Finished difference Result 18 states and 23 transitions. [2018-06-22 01:14:53,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:14:53,270 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 01:14:53,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:53,271 INFO ]: With dead ends: 18 [2018-06-22 01:14:53,271 INFO ]: Without dead ends: 18 [2018-06-22 01:14:53,271 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:14:53,271 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:14:53,273 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-06-22 01:14:53,273 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:14:53,273 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-06-22 01:14:53,274 INFO ]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 11 [2018-06-22 01:14:53,274 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:53,274 INFO ]: Abstraction has 15 states and 20 transitions. [2018-06-22 01:14:53,274 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:14:53,274 INFO ]: Start isEmpty. Operand 15 states and 20 transitions. [2018-06-22 01:14:53,274 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:14:53,274 INFO ]: Found error trace [2018-06-22 01:14:53,274 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:53,274 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:53,274 INFO ]: Analyzing trace with hash -545201120, now seen corresponding path program 1 times [2018-06-22 01:14:53,274 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:53,274 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:53,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:53,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:53,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:53,297 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:53,364 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:53,364 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:53,364 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:14:53,364 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:14:53,364 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:14:53,364 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:53,365 INFO ]: Start difference. First operand 15 states and 20 transitions. Second operand 3 states. [2018-06-22 01:14:53,455 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:53,455 INFO ]: Finished difference Result 15 states and 20 transitions. [2018-06-22 01:14:53,457 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:14:53,457 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-22 01:14:53,457 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:53,458 INFO ]: With dead ends: 15 [2018-06-22 01:14:53,458 INFO ]: Without dead ends: 13 [2018-06-22 01:14:53,458 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:53,458 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:14:53,459 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:14:53,459 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:14:53,459 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-22 01:14:53,459 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-06-22 01:14:53,459 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:53,459 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-22 01:14:53,459 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:14:53,459 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-22 01:14:53,459 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:14:53,459 INFO ]: Found error trace [2018-06-22 01:14:53,459 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:53,460 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:53,460 INFO ]: Analyzing trace with hash -2032749460, now seen corresponding path program 1 times [2018-06-22 01:14:53,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:53,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:53,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:53,460 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:53,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:53,473 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:53,599 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:53,599 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:53,599 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 01:14:53,618 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:53,654 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:53,656 INFO ]: Computing forward predicates... [2018-06-22 01:14:53,856 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:53,877 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:53,877 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 01:14:53,878 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:14:53,878 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:14:53,878 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:14:53,878 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 8 states. [2018-06-22 01:14:54,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:54,441 INFO ]: Finished difference Result 20 states and 23 transitions. [2018-06-22 01:14:54,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:14:54,441 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-22 01:14:54,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:54,442 INFO ]: With dead ends: 20 [2018-06-22 01:14:54,442 INFO ]: Without dead ends: 20 [2018-06-22 01:14:54,442 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:14:54,442 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:14:54,444 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-22 01:14:54,444 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:14:54,444 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-22 01:14:54,444 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-06-22 01:14:54,444 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:54,444 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-22 01:14:54,444 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:14:54,444 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-22 01:14:54,445 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:14:54,445 INFO ]: Found error trace [2018-06-22 01:14:54,445 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:54,445 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:54,445 INFO ]: Analyzing trace with hash 1525932134, now seen corresponding path program 2 times [2018-06-22 01:14:54,445 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:54,445 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:54,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:54,446 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:54,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:54,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:54,585 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:54,585 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:54,585 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 01:14:54,590 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:14:54,627 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:14:54,627 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:54,631 INFO ]: Computing forward predicates... [2018-06-22 01:14:54,672 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:54,694 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:54,694 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 01:14:54,694 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:14:54,694 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:14:54,694 INFO ]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:14:54,694 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 10 states. [2018-06-22 01:14:54,788 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:54,788 INFO ]: Finished difference Result 17 states and 19 transitions. [2018-06-22 01:14:54,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:14:54,788 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 01:14:54,788 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:54,788 INFO ]: With dead ends: 17 [2018-06-22 01:14:54,788 INFO ]: Without dead ends: 14 [2018-06-22 01:14:54,789 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:14:54,789 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:14:54,790 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:14:54,790 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:14:54,791 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-22 01:14:54,791 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 13 [2018-06-22 01:14:54,791 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:54,791 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-22 01:14:54,791 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:14:54,791 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-22 01:14:54,791 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:14:54,791 INFO ]: Found error trace [2018-06-22 01:14:54,791 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:54,791 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:54,791 INFO ]: Analyzing trace with hash 1001687726, now seen corresponding path program 3 times [2018-06-22 01:14:54,791 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:54,791 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:54,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:54,792 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:54,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:54,802 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:54,856 INFO ]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:54,856 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:54,856 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 01:14:54,863 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:14:54,887 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 01:14:54,887 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:54,892 INFO ]: Computing forward predicates... [2018-06-22 01:14:54,949 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:54,969 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:54,969 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 01:14:54,969 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:14:54,969 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:14:54,969 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:14:54,970 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2018-06-22 01:14:55,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:55,021 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-22 01:14:55,022 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:14:55,022 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 01:14:55,022 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:55,022 INFO ]: With dead ends: 15 [2018-06-22 01:14:55,022 INFO ]: Without dead ends: 15 [2018-06-22 01:14:55,023 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:14:55,023 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:14:55,024 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:14:55,024 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:14:55,025 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-22 01:14:55,025 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-22 01:14:55,025 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:55,025 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-22 01:14:55,025 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:14:55,025 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-22 01:14:55,025 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:14:55,025 INFO ]: Found error trace [2018-06-22 01:14:55,025 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:55,025 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:55,025 INFO ]: Analyzing trace with hash 1104204388, now seen corresponding path program 4 times [2018-06-22 01:14:55,025 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:55,025 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:55,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:55,033 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:55,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:55,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:55,213 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:55,214 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:55,214 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 01:14:55,220 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:14:55,252 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:14:55,252 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:55,254 INFO ]: Computing forward predicates... [2018-06-22 01:14:55,582 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:55,610 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:55,610 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 01:14:55,610 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:14:55,610 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:14:55,610 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:14:55,610 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2018-06-22 01:14:55,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:55,791 INFO ]: Finished difference Result 23 states and 26 transitions. [2018-06-22 01:14:55,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:14:55,791 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-22 01:14:55,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:55,791 INFO ]: With dead ends: 23 [2018-06-22 01:14:55,791 INFO ]: Without dead ends: 23 [2018-06-22 01:14:55,792 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:14:55,792 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:14:55,793 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-06-22 01:14:55,793 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:14:55,794 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-06-22 01:14:55,794 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2018-06-22 01:14:55,794 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:55,794 INFO ]: Abstraction has 17 states and 19 transitions. [2018-06-22 01:14:55,794 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:14:55,794 INFO ]: Start isEmpty. Operand 17 states and 19 transitions. [2018-06-22 01:14:55,794 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:14:55,794 INFO ]: Found error trace [2018-06-22 01:14:55,794 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:55,794 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:55,795 INFO ]: Analyzing trace with hash -12746386, now seen corresponding path program 5 times [2018-06-22 01:14:55,795 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:55,795 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:55,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:55,795 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:55,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:55,806 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:55,879 INFO ]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:55,879 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:55,879 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 01:14:55,894 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:14:55,917 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:14:55,917 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:55,919 INFO ]: Computing forward predicates... [2018-06-22 01:14:55,978 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:55,998 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:55,998 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-22 01:14:55,998 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:14:55,998 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:14:55,998 INFO ]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:14:55,998 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 13 states. [2018-06-22 01:14:56,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:56,073 INFO ]: Finished difference Result 20 states and 22 transitions. [2018-06-22 01:14:56,074 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:14:56,074 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-22 01:14:56,075 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:56,075 INFO ]: With dead ends: 20 [2018-06-22 01:14:56,075 INFO ]: Without dead ends: 16 [2018-06-22 01:14:56,075 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:14:56,075 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:14:56,076 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 01:14:56,076 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:14:56,077 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-22 01:14:56,077 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2018-06-22 01:14:56,077 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:56,077 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-22 01:14:56,077 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:14:56,077 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-22 01:14:56,077 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:14:56,077 INFO ]: Found error trace [2018-06-22 01:14:56,077 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:56,077 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:56,078 INFO ]: Analyzing trace with hash 915546150, now seen corresponding path program 6 times [2018-06-22 01:14:56,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:56,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:56,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:56,081 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:56,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:56,096 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:56,156 INFO ]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:56,156 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:56,156 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:56,168 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:14:56,209 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-22 01:14:56,209 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:56,211 INFO ]: Computing forward predicates... [2018-06-22 01:14:56,316 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:56,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:56,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 01:14:56,336 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:14:56,337 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:14:56,337 INFO ]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:14:56,337 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 12 states. [2018-06-22 01:14:56,375 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:56,375 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-22 01:14:56,376 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:14:56,376 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-22 01:14:56,376 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:56,376 INFO ]: With dead ends: 17 [2018-06-22 01:14:56,376 INFO ]: Without dead ends: 17 [2018-06-22 01:14:56,377 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:14:56,377 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:14:56,378 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 01:14:56,378 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:14:56,378 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-22 01:14:56,378 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-06-22 01:14:56,378 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:56,378 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-22 01:14:56,378 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:14:56,378 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-22 01:14:56,379 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:14:56,379 INFO ]: Found error trace [2018-06-22 01:14:56,379 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:56,379 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:56,379 INFO ]: Analyzing trace with hash -1566184468, now seen corresponding path program 7 times [2018-06-22 01:14:56,379 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:56,379 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:56,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:56,380 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:56,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:56,394 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:56,592 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:56,592 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:56,592 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 01:14:56,598 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:56,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:56,620 INFO ]: Computing forward predicates... [2018-06-22 01:14:56,651 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:56,670 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:56,670 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-22 01:14:56,671 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:14:56,671 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:14:56,671 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:14:56,671 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 12 states. [2018-06-22 01:14:56,926 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:56,926 INFO ]: Finished difference Result 26 states and 29 transitions. [2018-06-22 01:14:56,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:14:56,926 INFO ]: Start accepts. Automaton has 12 states. Word has length 16 [2018-06-22 01:14:56,926 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:56,927 INFO ]: With dead ends: 26 [2018-06-22 01:14:56,927 INFO ]: Without dead ends: 26 [2018-06-22 01:14:56,927 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:14:56,927 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:14:56,929 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-06-22 01:14:56,929 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:14:56,929 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-06-22 01:14:56,929 INFO ]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-06-22 01:14:56,929 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:56,930 INFO ]: Abstraction has 19 states and 21 transitions. [2018-06-22 01:14:56,930 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:14:56,930 INFO ]: Start isEmpty. Operand 19 states and 21 transitions. [2018-06-22 01:14:56,930 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:14:56,930 INFO ]: Found error trace [2018-06-22 01:14:56,930 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:56,930 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:56,930 INFO ]: Analyzing trace with hash -1190422298, now seen corresponding path program 8 times [2018-06-22 01:14:56,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:56,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:56,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:56,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:56,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:56,942 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:57,064 INFO ]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:57,064 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:57,064 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 01:14:57,070 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:14:57,093 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:14:57,093 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:57,095 INFO ]: Computing forward predicates... [2018-06-22 01:14:57,270 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:57,289 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:57,289 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-22 01:14:57,289 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:14:57,289 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:14:57,290 INFO ]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:14:57,290 INFO ]: Start difference. First operand 19 states and 21 transitions. Second operand 16 states. [2018-06-22 01:14:57,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:57,390 INFO ]: Finished difference Result 23 states and 25 transitions. [2018-06-22 01:14:57,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:14:57,391 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-22 01:14:57,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:57,391 INFO ]: With dead ends: 23 [2018-06-22 01:14:57,391 INFO ]: Without dead ends: 18 [2018-06-22 01:14:57,392 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:14:57,392 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:14:57,393 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:14:57,393 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:14:57,394 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-22 01:14:57,394 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 17 [2018-06-22 01:14:57,394 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:57,394 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-22 01:14:57,394 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:14:57,394 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-22 01:14:57,394 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:14:57,394 INFO ]: Found error trace [2018-06-22 01:14:57,394 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:57,394 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:57,394 INFO ]: Analyzing trace with hash 1816842542, now seen corresponding path program 9 times [2018-06-22 01:14:57,394 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:57,394 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:57,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:57,397 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:57,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:57,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:57,620 INFO ]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:57,620 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:57,620 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 01:14:57,626 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:14:57,670 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:14:57,670 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:57,672 INFO ]: Computing forward predicates... [2018-06-22 01:14:57,861 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:57,881 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:57,881 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2018-06-22 01:14:57,882 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:14:57,882 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:14:57,882 INFO ]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:14:57,882 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 16 states. [2018-06-22 01:14:58,220 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:58,221 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-22 01:14:58,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:14:58,221 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-22 01:14:58,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:58,221 INFO ]: With dead ends: 19 [2018-06-22 01:14:58,221 INFO ]: Without dead ends: 19 [2018-06-22 01:14:58,221 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:14:58,221 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:14:58,223 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 01:14:58,223 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:14:58,223 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-22 01:14:58,223 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-06-22 01:14:58,223 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:58,223 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-22 01:14:58,223 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:14:58,223 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-22 01:14:58,224 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:14:58,224 INFO ]: Found error trace [2018-06-22 01:14:58,224 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:58,224 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:58,224 INFO ]: Analyzing trace with hash 604199908, now seen corresponding path program 10 times [2018-06-22 01:14:58,224 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:58,224 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:58,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:58,225 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:58,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:58,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:58,622 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:58,622 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:58,622 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 01:14:58,627 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:14:58,655 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:14:58,655 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:58,658 INFO ]: Computing forward predicates... [2018-06-22 01:14:58,690 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:58,709 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:58,709 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-22 01:14:58,709 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:14:58,709 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:14:58,709 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:14:58,709 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 14 states. [2018-06-22 01:14:58,953 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:58,953 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-22 01:14:58,953 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:14:58,953 INFO ]: Start accepts. Automaton has 14 states. Word has length 18 [2018-06-22 01:14:58,953 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:58,954 INFO ]: With dead ends: 29 [2018-06-22 01:14:58,954 INFO ]: Without dead ends: 29 [2018-06-22 01:14:58,954 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:14:58,954 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:14:58,956 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-06-22 01:14:58,956 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:14:58,956 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-22 01:14:58,956 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-06-22 01:14:58,957 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:58,957 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-22 01:14:58,957 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:14:58,957 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-22 01:14:58,957 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:14:58,957 INFO ]: Found error trace [2018-06-22 01:14:58,957 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:58,957 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:58,957 INFO ]: Analyzing trace with hash 1666983918, now seen corresponding path program 11 times [2018-06-22 01:14:58,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:58,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:58,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:58,958 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:58,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:58,968 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:59,362 INFO ]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:59,362 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:59,362 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 01:14:59,368 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:14:59,418 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:14:59,419 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:59,421 INFO ]: Computing forward predicates... [2018-06-22 01:14:59,521 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:59,540 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:59,540 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-22 01:14:59,540 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:14:59,540 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:14:59,540 INFO ]: CoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:14:59,540 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 19 states. [2018-06-22 01:14:59,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:59,616 INFO ]: Finished difference Result 26 states and 28 transitions. [2018-06-22 01:14:59,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:14:59,616 INFO ]: Start accepts. Automaton has 19 states. Word has length 19 [2018-06-22 01:14:59,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:59,616 INFO ]: With dead ends: 26 [2018-06-22 01:14:59,616 INFO ]: Without dead ends: 20 [2018-06-22 01:14:59,617 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:14:59,617 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:14:59,618 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 01:14:59,618 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:14:59,619 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-22 01:14:59,619 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 19 [2018-06-22 01:14:59,619 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:59,619 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-22 01:14:59,619 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:14:59,619 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-22 01:14:59,619 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:14:59,619 INFO ]: Found error trace [2018-06-22 01:14:59,619 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:59,619 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:59,619 INFO ]: Analyzing trace with hash 402913446, now seen corresponding path program 12 times [2018-06-22 01:14:59,619 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:59,619 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:59,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:59,620 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:59,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:59,630 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:00,380 INFO ]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:00,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:00,380 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) [2018-06-22 01:15:00,395 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:00,425 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:15:00,425 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:00,428 INFO ]: Computing forward predicates... [2018-06-22 01:15:00,531 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:00,552 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:00,552 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2018-06-22 01:15:00,552 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:15:00,552 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:15:00,552 INFO ]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:15:00,552 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 19 states. [2018-06-22 01:15:00,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:00,637 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-22 01:15:00,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:15:00,638 INFO ]: Start accepts. Automaton has 19 states. Word has length 19 [2018-06-22 01:15:00,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:00,638 INFO ]: With dead ends: 21 [2018-06-22 01:15:00,638 INFO ]: Without dead ends: 21 [2018-06-22 01:15:00,638 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:15:00,638 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:15:00,639 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 01:15:00,639 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:15:00,640 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-22 01:15:00,640 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-06-22 01:15:00,640 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:00,640 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-22 01:15:00,640 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:15:00,640 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-22 01:15:00,640 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:15:00,640 INFO ]: Found error trace [2018-06-22 01:15:00,640 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:00,640 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:00,640 INFO ]: Analyzing trace with hash -277929108, now seen corresponding path program 13 times [2018-06-22 01:15:00,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:00,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:00,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:00,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:00,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:00,652 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:00,880 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:00,880 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:00,880 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 01:15:00,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:00,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:00,930 INFO ]: Computing forward predicates... [2018-06-22 01:15:01,031 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:01,052 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:01,052 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-22 01:15:01,052 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:15:01,052 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:15:01,052 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:15:01,052 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 16 states. [2018-06-22 01:15:01,445 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:01,445 INFO ]: Finished difference Result 32 states and 35 transitions. [2018-06-22 01:15:01,445 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:15:01,445 INFO ]: Start accepts. Automaton has 16 states. Word has length 20 [2018-06-22 01:15:01,445 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:01,446 INFO ]: With dead ends: 32 [2018-06-22 01:15:01,446 INFO ]: Without dead ends: 32 [2018-06-22 01:15:01,446 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:15:01,446 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:15:01,448 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 23. [2018-06-22 01:15:01,448 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:15:01,448 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-22 01:15:01,448 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-06-22 01:15:01,448 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:01,448 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-22 01:15:01,448 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:15:01,448 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-22 01:15:01,448 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:15:01,448 INFO ]: Found error trace [2018-06-22 01:15:01,448 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:01,448 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:01,449 INFO ]: Analyzing trace with hash 90788198, now seen corresponding path program 14 times [2018-06-22 01:15:01,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:01,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:01,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:01,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:01,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:01,461 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:01,623 INFO ]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:01,623 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:01,623 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 01:15:01,629 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:01,668 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:01,668 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:01,671 INFO ]: Computing forward predicates... [2018-06-22 01:15:02,157 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:02,177 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:02,177 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-06-22 01:15:02,177 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:15:02,178 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:15:02,178 INFO ]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:15:02,178 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 22 states. [2018-06-22 01:15:02,291 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:02,291 INFO ]: Finished difference Result 29 states and 31 transitions. [2018-06-22 01:15:02,292 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:15:02,292 INFO ]: Start accepts. Automaton has 22 states. Word has length 21 [2018-06-22 01:15:02,292 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:02,292 INFO ]: With dead ends: 29 [2018-06-22 01:15:02,292 INFO ]: Without dead ends: 22 [2018-06-22 01:15:02,293 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:15:02,293 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:15:02,294 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 01:15:02,294 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:15:02,294 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-06-22 01:15:02,295 INFO ]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2018-06-22 01:15:02,295 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:02,295 INFO ]: Abstraction has 22 states and 23 transitions. [2018-06-22 01:15:02,295 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:15:02,295 INFO ]: Start isEmpty. Operand 22 states and 23 transitions. [2018-06-22 01:15:02,295 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:15:02,295 INFO ]: Found error trace [2018-06-22 01:15:02,295 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:02,295 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:02,295 INFO ]: Analyzing trace with hash -440690770, now seen corresponding path program 15 times [2018-06-22 01:15:02,295 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:02,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:02,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:02,296 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:02,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:02,306 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:02,494 INFO ]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:02,495 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:02,495 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 01:15:02,500 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:15:02,531 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:15:02,531 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:02,534 INFO ]: Computing forward predicates... [2018-06-22 01:15:02,655 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:02,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:02,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 22 [2018-06-22 01:15:02,674 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:15:02,675 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:15:02,675 INFO ]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:15:02,675 INFO ]: Start difference. First operand 22 states and 23 transitions. Second operand 22 states. [2018-06-22 01:15:02,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:02,820 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-22 01:15:02,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:15:02,823 INFO ]: Start accepts. Automaton has 22 states. Word has length 21 [2018-06-22 01:15:02,823 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:02,823 INFO ]: With dead ends: 23 [2018-06-22 01:15:02,823 INFO ]: Without dead ends: 23 [2018-06-22 01:15:02,825 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=525, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:15:02,825 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:15:02,826 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 01:15:02,826 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:15:02,826 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-22 01:15:02,827 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2018-06-22 01:15:02,827 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:02,827 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-22 01:15:02,827 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:15:02,827 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-22 01:15:02,827 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:15:02,827 INFO ]: Found error trace [2018-06-22 01:15:02,827 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:02,827 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:02,827 INFO ]: Analyzing trace with hash -659856028, now seen corresponding path program 16 times [2018-06-22 01:15:02,827 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:02,827 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:02,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:02,828 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:02,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:02,840 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:03,127 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:03,127 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:03,127 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 01:15:03,133 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:15:03,176 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:03,176 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:03,180 INFO ]: Computing forward predicates... [2018-06-22 01:15:03,299 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:03,319 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:03,319 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-22 01:15:03,319 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:15:03,319 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:15:03,319 INFO ]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:15:03,319 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 18 states. [2018-06-22 01:15:03,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:03,705 INFO ]: Finished difference Result 35 states and 38 transitions. [2018-06-22 01:15:03,705 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:15:03,705 INFO ]: Start accepts. Automaton has 18 states. Word has length 22 [2018-06-22 01:15:03,705 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:03,706 INFO ]: With dead ends: 35 [2018-06-22 01:15:03,706 INFO ]: Without dead ends: 35 [2018-06-22 01:15:03,706 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:15:03,706 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:15:03,712 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 25. [2018-06-22 01:15:03,712 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:15:03,713 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-06-22 01:15:03,713 INFO ]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2018-06-22 01:15:03,713 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:03,713 INFO ]: Abstraction has 25 states and 27 transitions. [2018-06-22 01:15:03,713 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:15:03,713 INFO ]: Start isEmpty. Operand 25 states and 27 transitions. [2018-06-22 01:15:03,713 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:15:03,713 INFO ]: Found error trace [2018-06-22 01:15:03,713 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:03,713 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:03,713 INFO ]: Analyzing trace with hash 1135955566, now seen corresponding path program 17 times [2018-06-22 01:15:03,713 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:03,713 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:03,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:03,714 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:03,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:03,726 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:03,904 INFO ]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:03,904 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:03,904 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 01:15:03,912 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:15:03,965 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:15:03,965 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:03,967 INFO ]: Computing forward predicates... [2018-06-22 01:15:04,098 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:04,117 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:04,117 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-22 01:15:04,117 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:15:04,118 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:15:04,118 INFO ]: CoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:15:04,118 INFO ]: Start difference. First operand 25 states and 27 transitions. Second operand 25 states. [2018-06-22 01:15:04,322 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:04,322 INFO ]: Finished difference Result 32 states and 34 transitions. [2018-06-22 01:15:04,322 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:15:04,322 INFO ]: Start accepts. Automaton has 25 states. Word has length 23 [2018-06-22 01:15:04,322 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:04,322 INFO ]: With dead ends: 32 [2018-06-22 01:15:04,322 INFO ]: Without dead ends: 24 [2018-06-22 01:15:04,323 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=780, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:15:04,323 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:15:04,324 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 01:15:04,324 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:15:04,324 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-22 01:15:04,324 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 23 [2018-06-22 01:15:04,324 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:04,324 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-22 01:15:04,324 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:15:04,324 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-22 01:15:04,325 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:15:04,325 INFO ]: Found error trace [2018-06-22 01:15:04,326 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:04,326 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:04,326 INFO ]: Analyzing trace with hash 1839976742, now seen corresponding path program 18 times [2018-06-22 01:15:04,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:04,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:04,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:04,327 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:04,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:04,338 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:04,523 INFO ]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:04,523 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:04,523 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:04,529 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:15:04,562 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:15:04,562 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:04,565 INFO ]: Computing forward predicates... [2018-06-22 01:15:04,681 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:04,701 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:04,701 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 25 [2018-06-22 01:15:04,701 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:15:04,701 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:15:04,702 INFO ]: CoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:15:04,702 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 25 states. [2018-06-22 01:15:05,022 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:15:05,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:05,477 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-22 01:15:05,497 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:15:05,497 INFO ]: Start accepts. Automaton has 25 states. Word has length 23 [2018-06-22 01:15:05,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:05,497 INFO ]: With dead ends: 25 [2018-06-22 01:15:05,497 INFO ]: Without dead ends: 25 [2018-06-22 01:15:05,497 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=692, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:15:05,497 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:15:05,499 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 01:15:05,499 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:15:05,499 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-22 01:15:05,499 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-06-22 01:15:05,499 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:05,499 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-22 01:15:05,499 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:15:05,499 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-22 01:15:05,500 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:15:05,500 INFO ]: Found error trace [2018-06-22 01:15:05,500 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:05,500 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:05,500 INFO ]: Analyzing trace with hash 1321360108, now seen corresponding path program 19 times [2018-06-22 01:15:05,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:05,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:05,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:05,501 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:05,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:05,512 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:05,790 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:05,790 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:05,790 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 01:15:05,798 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:05,831 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:05,835 INFO ]: Computing forward predicates... [2018-06-22 01:15:05,925 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:05,954 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:05,954 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-22 01:15:05,955 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:15:05,955 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:15:05,955 INFO ]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:15:05,955 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 20 states. [2018-06-22 01:15:06,455 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:06,455 INFO ]: Finished difference Result 38 states and 41 transitions. [2018-06-22 01:15:06,455 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:15:06,455 INFO ]: Start accepts. Automaton has 20 states. Word has length 24 [2018-06-22 01:15:06,455 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:06,456 INFO ]: With dead ends: 38 [2018-06-22 01:15:06,456 INFO ]: Without dead ends: 38 [2018-06-22 01:15:06,456 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:15:06,456 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:15:06,458 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-06-22 01:15:06,458 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:15:06,459 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-22 01:15:06,459 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2018-06-22 01:15:06,459 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:06,459 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-22 01:15:06,459 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:15:06,459 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-22 01:15:06,460 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:15:06,460 INFO ]: Found error trace [2018-06-22 01:15:06,460 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:06,460 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:06,460 INFO ]: Analyzing trace with hash -1870853658, now seen corresponding path program 20 times [2018-06-22 01:15:06,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:06,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:06,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:06,460 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:06,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:06,473 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:07,104 INFO ]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:07,104 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:07,104 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 01:15:07,110 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:07,143 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:07,143 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:07,146 INFO ]: Computing forward predicates... [2018-06-22 01:15:07,311 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:07,331 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:07,331 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-22 01:15:07,331 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:15:07,331 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:15:07,331 INFO ]: CoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:15:07,332 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 28 states. [2018-06-22 01:15:07,485 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:07,485 INFO ]: Finished difference Result 35 states and 37 transitions. [2018-06-22 01:15:07,485 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:15:07,485 INFO ]: Start accepts. Automaton has 28 states. Word has length 25 [2018-06-22 01:15:07,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:07,485 INFO ]: With dead ends: 35 [2018-06-22 01:15:07,485 INFO ]: Without dead ends: 26 [2018-06-22 01:15:07,486 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=342, Invalid=990, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:15:07,486 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:15:07,487 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 01:15:07,487 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:15:07,487 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-22 01:15:07,487 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 25 [2018-06-22 01:15:07,487 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:07,487 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-22 01:15:07,487 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:15:07,487 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-22 01:15:07,487 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:15:07,487 INFO ]: Found error trace [2018-06-22 01:15:07,487 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:07,488 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:07,488 INFO ]: Analyzing trace with hash -1521033682, now seen corresponding path program 21 times [2018-06-22 01:15:07,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:07,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:07,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:07,488 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:07,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:07,502 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:07,712 INFO ]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:07,712 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:07,712 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 01:15:07,719 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:15:07,757 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:15:07,757 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:07,759 INFO ]: Computing forward predicates... [2018-06-22 01:15:07,964 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:07,984 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:07,985 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2018-06-22 01:15:07,985 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:15:07,985 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:15:07,985 INFO ]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:15:07,985 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 28 states. [2018-06-22 01:15:08,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:08,135 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-22 01:15:08,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:15:08,136 INFO ]: Start accepts. Automaton has 28 states. Word has length 25 [2018-06-22 01:15:08,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:08,136 INFO ]: With dead ends: 27 [2018-06-22 01:15:08,136 INFO ]: Without dead ends: 27 [2018-06-22 01:15:08,136 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=882, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:15:08,136 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:15:08,138 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 01:15:08,138 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:15:08,139 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-22 01:15:08,139 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2018-06-22 01:15:08,139 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:08,139 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-22 01:15:08,139 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:15:08,139 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-22 01:15:08,139 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:15:08,139 INFO ]: Found error trace [2018-06-22 01:15:08,139 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:08,139 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:08,140 INFO ]: Analyzing trace with hash 209252068, now seen corresponding path program 22 times [2018-06-22 01:15:08,140 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:08,140 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:08,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:08,140 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:08,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:08,164 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:08,462 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:08,462 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:08,462 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 01:15:08,469 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:15:08,503 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:08,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:08,506 INFO ]: Computing forward predicates... [2018-06-22 01:15:08,677 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:08,696 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:08,696 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-22 01:15:08,696 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:15:08,696 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:15:08,696 INFO ]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:15:08,696 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 22 states. [2018-06-22 01:15:09,178 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:09,178 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-22 01:15:09,178 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:15:09,178 INFO ]: Start accepts. Automaton has 22 states. Word has length 26 [2018-06-22 01:15:09,179 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:09,179 INFO ]: With dead ends: 41 [2018-06-22 01:15:09,179 INFO ]: Without dead ends: 41 [2018-06-22 01:15:09,179 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1546, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:15:09,180 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:15:09,180 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-06-22 01:15:09,181 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:15:09,181 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-22 01:15:09,181 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2018-06-22 01:15:09,181 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:09,181 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-22 01:15:09,181 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:15:09,181 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-22 01:15:09,181 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:15:09,181 INFO ]: Found error trace [2018-06-22 01:15:09,181 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:09,181 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:09,182 INFO ]: Analyzing trace with hash -1986464530, now seen corresponding path program 23 times [2018-06-22 01:15:09,182 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:09,182 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:09,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:09,182 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:09,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:09,193 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:09,502 INFO ]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:09,502 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:09,502 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 01:15:09,508 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:15:09,632 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:15:09,632 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:09,636 INFO ]: Computing forward predicates... [2018-06-22 01:15:10,111 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:10,130 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:10,130 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-22 01:15:10,130 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:15:10,130 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:15:10,131 INFO ]: CoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:15:10,131 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 31 states. [2018-06-22 01:15:10,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:10,670 INFO ]: Finished difference Result 38 states and 40 transitions. [2018-06-22 01:15:10,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:15:10,671 INFO ]: Start accepts. Automaton has 31 states. Word has length 27 [2018-06-22 01:15:10,671 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:10,671 INFO ]: With dead ends: 38 [2018-06-22 01:15:10,671 INFO ]: Without dead ends: 28 [2018-06-22 01:15:10,672 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=415, Invalid=1225, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:15:10,672 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:15:10,673 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 01:15:10,673 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:15:10,673 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-22 01:15:10,673 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 27 [2018-06-22 01:15:10,673 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:10,673 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-22 01:15:10,673 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:15:10,673 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-22 01:15:10,674 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:15:10,674 INFO ]: Found error trace [2018-06-22 01:15:10,674 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:10,674 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:10,674 INFO ]: Analyzing trace with hash 268020134, now seen corresponding path program 24 times [2018-06-22 01:15:10,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:10,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:10,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:10,674 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:10,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:10,685 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:10,888 INFO ]: Checked inductivity of 81 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:10,888 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:10,888 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 01:15:10,895 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:15:10,935 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:15:10,935 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:10,938 INFO ]: Computing forward predicates... [2018-06-22 01:15:11,175 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:11,195 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:11,195 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 31 [2018-06-22 01:15:11,195 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:15:11,196 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:15:11,196 INFO ]: CoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:15:11,196 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 31 states. [2018-06-22 01:15:11,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:11,354 INFO ]: Finished difference Result 29 states and 30 transitions. [2018-06-22 01:15:11,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:15:11,354 INFO ]: Start accepts. Automaton has 31 states. Word has length 27 [2018-06-22 01:15:11,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:11,354 INFO ]: With dead ends: 29 [2018-06-22 01:15:11,354 INFO ]: Without dead ends: 29 [2018-06-22 01:15:11,355 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=1095, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:15:11,355 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:15:11,356 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-22 01:15:11,356 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:15:11,357 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-22 01:15:11,357 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2018-06-22 01:15:11,357 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:11,357 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-22 01:15:11,357 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:15:11,357 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-22 01:15:11,357 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:15:11,357 INFO ]: Found error trace [2018-06-22 01:15:11,357 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:11,357 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:11,357 INFO ]: Analyzing trace with hash -164654484, now seen corresponding path program 25 times [2018-06-22 01:15:11,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:11,357 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:11,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:11,358 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:11,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:11,372 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:12,373 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:12,373 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:12,373 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 01:15:12,385 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:12,421 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:12,424 INFO ]: Computing forward predicates... [2018-06-22 01:15:13,000 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:13,020 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:13,020 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-22 01:15:13,020 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:15:13,020 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:15:13,020 INFO ]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:15:13,021 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 24 states. [2018-06-22 01:15:14,344 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:14,344 INFO ]: Finished difference Result 44 states and 47 transitions. [2018-06-22 01:15:14,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:15:14,344 INFO ]: Start accepts. Automaton has 24 states. Word has length 28 [2018-06-22 01:15:14,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:14,344 INFO ]: With dead ends: 44 [2018-06-22 01:15:14,344 INFO ]: Without dead ends: 44 [2018-06-22 01:15:14,345 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=194, Invalid=1876, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:15:14,345 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 01:15:14,346 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-06-22 01:15:14,346 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:15:14,347 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-22 01:15:14,347 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2018-06-22 01:15:14,347 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:14,347 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-22 01:15:14,347 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:15:14,347 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-22 01:15:14,347 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:15:14,347 INFO ]: Found error trace [2018-06-22 01:15:14,347 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:14,347 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:14,348 INFO ]: Analyzing trace with hash -692665754, now seen corresponding path program 26 times [2018-06-22 01:15:14,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:14,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:14,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:14,348 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:14,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:14,360 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:14,686 INFO ]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:14,686 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:14,686 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 01:15:14,694 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:14,741 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:14,742 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:14,745 INFO ]: Computing forward predicates... [2018-06-22 01:15:14,976 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:14,996 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:14,996 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2018-06-22 01:15:14,996 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:15:14,996 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:15:14,997 INFO ]: CoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:15:14,997 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 34 states. [2018-06-22 01:15:15,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:15,974 INFO ]: Finished difference Result 41 states and 43 transitions. [2018-06-22 01:15:15,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:15:15,975 INFO ]: Start accepts. Automaton has 34 states. Word has length 29 [2018-06-22 01:15:15,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:15,975 INFO ]: With dead ends: 41 [2018-06-22 01:15:15,975 INFO ]: Without dead ends: 30 [2018-06-22 01:15:15,975 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=495, Invalid=1485, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 01:15:15,975 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:15:15,976 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 01:15:15,976 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:15:15,976 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-22 01:15:15,976 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 29 [2018-06-22 01:15:15,976 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:15,976 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-22 01:15:15,976 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:15:15,976 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-22 01:15:15,977 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:15:15,977 INFO ]: Found error trace [2018-06-22 01:15:15,977 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:15,977 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:15,977 INFO ]: Analyzing trace with hash 476882094, now seen corresponding path program 27 times [2018-06-22 01:15:15,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:15,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:15,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:15,977 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:15,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:15,991 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:16,285 INFO ]: Checked inductivity of 100 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:16,285 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:16,285 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 01:15:16,291 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:15:16,332 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:15:16,332 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:16,335 INFO ]: Computing forward predicates... [2018-06-22 01:15:16,494 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:16,513 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:16,513 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 34 [2018-06-22 01:15:16,513 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:15:16,514 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:15:16,514 INFO ]: CoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:15:16,514 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 34 states. [2018-06-22 01:15:16,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:16,718 INFO ]: Finished difference Result 31 states and 32 transitions. [2018-06-22 01:15:16,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:15:16,723 INFO ]: Start accepts. Automaton has 34 states. Word has length 29 [2018-06-22 01:15:16,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:16,723 INFO ]: With dead ends: 31 [2018-06-22 01:15:16,723 INFO ]: Without dead ends: 31 [2018-06-22 01:15:16,724 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=1331, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:15:16,724 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:15:16,725 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-22 01:15:16,725 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:15:16,725 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-22 01:15:16,725 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-06-22 01:15:16,725 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:16,725 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-22 01:15:16,725 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:15:16,725 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-22 01:15:16,726 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:15:16,726 INFO ]: Found error trace [2018-06-22 01:15:16,726 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:16,726 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:16,726 INFO ]: Analyzing trace with hash 2015098980, now seen corresponding path program 28 times [2018-06-22 01:15:16,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:16,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:16,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:16,726 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:16,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:16,737 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:17,190 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:17,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:17,190 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 01:15:17,196 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:15:17,235 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:17,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:17,238 INFO ]: Computing forward predicates... [2018-06-22 01:15:17,322 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:17,342 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:17,342 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-06-22 01:15:17,342 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:15:17,342 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:15:17,342 INFO ]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:15:17,342 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 26 states. [2018-06-22 01:15:17,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:17,992 INFO ]: Finished difference Result 47 states and 50 transitions. [2018-06-22 01:15:17,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:15:17,992 INFO ]: Start accepts. Automaton has 26 states. Word has length 30 [2018-06-22 01:15:17,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:17,993 INFO ]: With dead ends: 47 [2018-06-22 01:15:17,993 INFO ]: Without dead ends: 47 [2018-06-22 01:15:17,993 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=2238, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:15:17,993 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 01:15:17,994 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 33. [2018-06-22 01:15:17,994 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:15:17,994 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-22 01:15:17,994 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2018-06-22 01:15:17,994 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:17,994 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-22 01:15:17,994 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:15:17,994 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-22 01:15:17,995 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:15:17,995 INFO ]: Found error trace [2018-06-22 01:15:17,995 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:17,995 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:17,995 INFO ]: Analyzing trace with hash -1839785106, now seen corresponding path program 29 times [2018-06-22 01:15:17,995 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:17,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:17,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:17,995 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:17,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:18,007 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:18,328 INFO ]: Checked inductivity of 121 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:18,329 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:18,329 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 01:15:18,334 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:15:18,379 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:15:18,379 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:18,382 INFO ]: Computing forward predicates... [2018-06-22 01:15:18,640 INFO ]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:18,660 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:18,660 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2018-06-22 01:15:18,660 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:15:18,660 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:15:18,660 INFO ]: CoverageRelationStatistics Valid=324, Invalid=1008, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:15:18,660 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 37 states. [2018-06-22 01:15:18,832 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:18,832 INFO ]: Finished difference Result 44 states and 46 transitions. [2018-06-22 01:15:18,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:15:18,832 INFO ]: Start accepts. Automaton has 37 states. Word has length 31 [2018-06-22 01:15:18,833 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:18,833 INFO ]: With dead ends: 44 [2018-06-22 01:15:18,833 INFO ]: Without dead ends: 32 [2018-06-22 01:15:18,833 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=582, Invalid=1770, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:15:18,833 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:15:18,834 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 01:15:18,834 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:15:18,834 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-22 01:15:18,834 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 31 [2018-06-22 01:15:18,834 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:18,834 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-22 01:15:18,834 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:15:18,834 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-22 01:15:18,835 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:15:18,835 INFO ]: Found error trace [2018-06-22 01:15:18,835 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:18,835 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:18,835 INFO ]: Analyzing trace with hash 56459814, now seen corresponding path program 30 times [2018-06-22 01:15:18,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:18,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:18,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:18,835 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:18,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:18,846 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:19,164 INFO ]: Checked inductivity of 121 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:19,164 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:19,164 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 01:15:19,170 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:15:19,217 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:15:19,217 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:19,221 INFO ]: Computing forward predicates... [2018-06-22 01:15:19,475 INFO ]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:19,494 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:19,494 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 37 [2018-06-22 01:15:19,494 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:15:19,495 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:15:19,495 INFO ]: CoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:15:19,495 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 37 states. [2018-06-22 01:15:19,761 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:19,761 INFO ]: Finished difference Result 33 states and 34 transitions. [2018-06-22 01:15:19,761 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:15:19,761 INFO ]: Start accepts. Automaton has 37 states. Word has length 31 [2018-06-22 01:15:19,761 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:19,761 INFO ]: With dead ends: 33 [2018-06-22 01:15:19,761 INFO ]: Without dead ends: 33 [2018-06-22 01:15:19,762 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=1590, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:15:19,762 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:15:19,762 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 01:15:19,763 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:15:19,763 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-22 01:15:19,763 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-06-22 01:15:19,763 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:19,763 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-22 01:15:19,763 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:15:19,763 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-22 01:15:19,763 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:15:19,763 INFO ]: Found error trace [2018-06-22 01:15:19,763 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:19,763 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:19,763 INFO ]: Analyzing trace with hash 1866910188, now seen corresponding path program 31 times [2018-06-22 01:15:19,763 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:19,763 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:19,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:19,764 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:19,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:19,774 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:20,574 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:20,574 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:20,574 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 01:15:20,579 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:20,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:20,624 INFO ]: Computing forward predicates... [2018-06-22 01:15:20,715 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:20,734 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:20,734 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-06-22 01:15:20,734 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:15:20,735 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:15:20,735 INFO ]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:15:20,735 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 28 states. [2018-06-22 01:15:21,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:21,522 INFO ]: Finished difference Result 50 states and 53 transitions. [2018-06-22 01:15:21,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:15:21,522 INFO ]: Start accepts. Automaton has 28 states. Word has length 32 [2018-06-22 01:15:21,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:21,522 INFO ]: With dead ends: 50 [2018-06-22 01:15:21,522 INFO ]: Without dead ends: 50 [2018-06-22 01:15:21,523 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=230, Invalid=2632, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:15:21,523 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 01:15:21,524 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-06-22 01:15:21,525 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:15:21,527 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-22 01:15:21,527 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 32 [2018-06-22 01:15:21,527 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:21,527 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-22 01:15:21,527 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:15:21,527 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-22 01:15:21,527 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:15:21,527 INFO ]: Found error trace [2018-06-22 01:15:21,527 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:21,527 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:21,528 INFO ]: Analyzing trace with hash -2138670362, now seen corresponding path program 32 times [2018-06-22 01:15:21,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:21,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:21,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:21,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:21,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:21,541 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:21,898 INFO ]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:21,898 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:21,898 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 01:15:21,903 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:21,950 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:21,950 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:21,953 INFO ]: Computing forward predicates... [2018-06-22 01:15:22,502 INFO ]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:22,521 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:22,522 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2018-06-22 01:15:22,522 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:15:22,522 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:15:22,522 INFO ]: CoverageRelationStatistics Valid=377, Invalid=1183, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:15:22,522 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 40 states. [2018-06-22 01:15:22,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:22,758 INFO ]: Finished difference Result 47 states and 49 transitions. [2018-06-22 01:15:22,759 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:15:22,759 INFO ]: Start accepts. Automaton has 40 states. Word has length 33 [2018-06-22 01:15:22,759 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:22,759 INFO ]: With dead ends: 47 [2018-06-22 01:15:22,759 INFO ]: Without dead ends: 34 [2018-06-22 01:15:22,759 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=676, Invalid=2080, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:15:22,760 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:15:22,760 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 01:15:22,760 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:15:22,760 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-06-22 01:15:22,760 INFO ]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 33 [2018-06-22 01:15:22,760 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:22,761 INFO ]: Abstraction has 34 states and 35 transitions. [2018-06-22 01:15:22,761 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:15:22,761 INFO ]: Start isEmpty. Operand 34 states and 35 transitions. [2018-06-22 01:15:22,761 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:15:22,761 INFO ]: Found error trace [2018-06-22 01:15:22,761 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:22,761 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:22,761 INFO ]: Analyzing trace with hash 810347310, now seen corresponding path program 33 times [2018-06-22 01:15:22,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:22,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:22,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:22,761 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:22,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:22,770 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:23,811 INFO ]: Checked inductivity of 144 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:23,811 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:23,811 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 01:15:23,818 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:15:23,869 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:15:23,869 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:23,872 INFO ]: Computing forward predicates... [2018-06-22 01:15:24,125 INFO ]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:24,144 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:24,144 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 40 [2018-06-22 01:15:24,144 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:15:24,144 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:15:24,144 INFO ]: CoverageRelationStatistics Valid=366, Invalid=1194, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:15:24,144 INFO ]: Start difference. First operand 34 states and 35 transitions. Second operand 40 states. [2018-06-22 01:15:24,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:24,434 INFO ]: Finished difference Result 35 states and 36 transitions. [2018-06-22 01:15:24,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:15:24,437 INFO ]: Start accepts. Automaton has 40 states. Word has length 33 [2018-06-22 01:15:24,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:24,437 INFO ]: With dead ends: 35 [2018-06-22 01:15:24,437 INFO ]: Without dead ends: 35 [2018-06-22 01:15:24,437 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=1872, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:15:24,437 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:15:24,438 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 01:15:24,438 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:15:24,438 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-22 01:15:24,438 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 33 [2018-06-22 01:15:24,439 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:24,439 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-22 01:15:24,439 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:15:24,439 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-22 01:15:24,439 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:15:24,439 INFO ]: Found error trace [2018-06-22 01:15:24,439 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:24,439 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:24,439 INFO ]: Analyzing trace with hash -532381212, now seen corresponding path program 34 times [2018-06-22 01:15:24,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:24,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:24,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:24,440 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:24,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:24,450 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:24,973 INFO ]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:24,974 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:24,974 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 01:15:24,979 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:15:25,024 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:25,024 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:25,029 INFO ]: Computing forward predicates... [2018-06-22 01:15:25,133 INFO ]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:25,152 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:25,152 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-06-22 01:15:25,152 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:15:25,152 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:15:25,152 INFO ]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:15:25,152 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 30 states. [2018-06-22 01:15:26,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:26,005 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-22 01:15:26,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:15:26,005 INFO ]: Start accepts. Automaton has 30 states. Word has length 34 [2018-06-22 01:15:26,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:26,006 INFO ]: With dead ends: 53 [2018-06-22 01:15:26,006 INFO ]: Without dead ends: 53 [2018-06-22 01:15:26,007 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=248, Invalid=3058, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 01:15:26,007 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 01:15:26,007 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-06-22 01:15:26,007 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:15:26,008 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-06-22 01:15:26,008 INFO ]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2018-06-22 01:15:26,008 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:26,008 INFO ]: Abstraction has 37 states and 39 transitions. [2018-06-22 01:15:26,008 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:15:26,008 INFO ]: Start isEmpty. Operand 37 states and 39 transitions. [2018-06-22 01:15:26,008 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:15:26,008 INFO ]: Found error trace [2018-06-22 01:15:26,008 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:26,008 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:26,008 INFO ]: Analyzing trace with hash 792707566, now seen corresponding path program 35 times [2018-06-22 01:15:26,008 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:26,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:26,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:26,008 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:26,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:26,020 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:26,333 INFO ]: Checked inductivity of 169 backedges. 78 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:26,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:26,342 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 01:15:26,348 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:15:26,402 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 01:15:26,402 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:26,405 INFO ]: Computing forward predicates... [2018-06-22 01:15:26,723 INFO ]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:26,742 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:26,742 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 43 [2018-06-22 01:15:26,742 INFO ]: Interpolant automaton has 43 states [2018-06-22 01:15:26,742 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 01:15:26,742 INFO ]: CoverageRelationStatistics Valid=434, Invalid=1372, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:15:26,743 INFO ]: Start difference. First operand 37 states and 39 transitions. Second operand 43 states. [2018-06-22 01:15:27,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:27,019 INFO ]: Finished difference Result 50 states and 52 transitions. [2018-06-22 01:15:27,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:15:27,019 INFO ]: Start accepts. Automaton has 43 states. Word has length 35 [2018-06-22 01:15:27,019 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:27,019 INFO ]: With dead ends: 50 [2018-06-22 01:15:27,019 INFO ]: Without dead ends: 36 [2018-06-22 01:15:27,020 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=777, Invalid=2415, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 01:15:27,020 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:15:27,021 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 01:15:27,021 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:15:27,021 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-22 01:15:27,021 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 35 [2018-06-22 01:15:27,021 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:27,021 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-22 01:15:27,021 INFO ]: Interpolant automaton has 43 states. [2018-06-22 01:15:27,021 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-22 01:15:27,021 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:15:27,021 INFO ]: Found error trace [2018-06-22 01:15:27,021 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:27,021 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:27,022 INFO ]: Analyzing trace with hash 2017942182, now seen corresponding path program 36 times [2018-06-22 01:15:27,022 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:27,022 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:27,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:27,022 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:27,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:27,029 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:27,420 INFO ]: Checked inductivity of 169 backedges. 79 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:27,420 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:27,420 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 01:15:27,427 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:15:27,484 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 01:15:27,484 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:27,487 INFO ]: Computing forward predicates... [2018-06-22 01:15:27,764 INFO ]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:27,784 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:27,784 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 43 [2018-06-22 01:15:27,784 INFO ]: Interpolant automaton has 43 states [2018-06-22 01:15:27,784 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 01:15:27,784 INFO ]: CoverageRelationStatistics Valid=422, Invalid=1384, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:15:27,784 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 43 states. [2018-06-22 01:15:28,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:28,158 INFO ]: Finished difference Result 37 states and 38 transitions. [2018-06-22 01:15:28,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:15:28,159 INFO ]: Start accepts. Automaton has 43 states. Word has length 35 [2018-06-22 01:15:28,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:28,159 INFO ]: With dead ends: 37 [2018-06-22 01:15:28,159 INFO ]: Without dead ends: 37 [2018-06-22 01:15:28,160 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=2177, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 01:15:28,160 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:15:28,161 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-22 01:15:28,161 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:15:28,161 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-22 01:15:28,161 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-06-22 01:15:28,161 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:28,161 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-22 01:15:28,161 INFO ]: Interpolant automaton has 43 states. [2018-06-22 01:15:28,161 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-22 01:15:28,161 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:15:28,161 INFO ]: Found error trace [2018-06-22 01:15:28,161 INFO ]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:28,161 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:28,162 INFO ]: Analyzing trace with hash -1751645844, now seen corresponding path program 37 times [2018-06-22 01:15:28,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:28,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:28,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:28,162 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:28,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:28,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:28,694 INFO ]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:28,694 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:28,694 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 01:15:28,700 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:28,748 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:28,752 INFO ]: Computing forward predicates... [2018-06-22 01:15:28,863 INFO ]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:28,882 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:28,882 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-22 01:15:28,882 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:15:28,882 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:15:28,882 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:15:28,883 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 32 states. [2018-06-22 01:15:29,852 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:29,853 INFO ]: Finished difference Result 56 states and 59 transitions. [2018-06-22 01:15:29,853 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:15:29,853 INFO ]: Start accepts. Automaton has 32 states. Word has length 36 [2018-06-22 01:15:29,853 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:29,853 INFO ]: With dead ends: 56 [2018-06-22 01:15:29,853 INFO ]: Without dead ends: 56 [2018-06-22 01:15:29,853 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=266, Invalid=3516, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 01:15:29,853 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 01:15:29,855 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 39. [2018-06-22 01:15:29,855 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:15:29,855 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-06-22 01:15:29,855 INFO ]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2018-06-22 01:15:29,855 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:29,855 INFO ]: Abstraction has 39 states and 41 transitions. [2018-06-22 01:15:29,855 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:15:29,855 INFO ]: Start isEmpty. Operand 39 states and 41 transitions. [2018-06-22 01:15:29,855 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:15:29,855 INFO ]: Found error trace [2018-06-22 01:15:29,855 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:29,855 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:29,856 INFO ]: Analyzing trace with hash 1650209638, now seen corresponding path program 38 times [2018-06-22 01:15:29,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:29,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:29,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:29,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:29,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:29,869 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:30,295 INFO ]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:30,295 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:30,295 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 01:15:30,301 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:30,353 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:30,353 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:30,357 INFO ]: Computing forward predicates... [2018-06-22 01:15:30,728 INFO ]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:30,747 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:30,747 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2018-06-22 01:15:30,747 INFO ]: Interpolant automaton has 46 states [2018-06-22 01:15:30,747 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 01:15:30,748 INFO ]: CoverageRelationStatistics Valid=495, Invalid=1575, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:15:30,748 INFO ]: Start difference. First operand 39 states and 41 transitions. Second operand 46 states. [2018-06-22 01:15:31,064 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:31,065 INFO ]: Finished difference Result 53 states and 55 transitions. [2018-06-22 01:15:31,066 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:15:31,066 INFO ]: Start accepts. Automaton has 46 states. Word has length 37 [2018-06-22 01:15:31,066 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:31,066 INFO ]: With dead ends: 53 [2018-06-22 01:15:31,066 INFO ]: Without dead ends: 38 [2018-06-22 01:15:31,066 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=885, Invalid=2775, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 01:15:31,067 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:15:31,067 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 01:15:31,067 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:15:31,067 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-06-22 01:15:31,067 INFO ]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 37 [2018-06-22 01:15:31,067 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:31,067 INFO ]: Abstraction has 38 states and 39 transitions. [2018-06-22 01:15:31,067 INFO ]: Interpolant automaton has 46 states. [2018-06-22 01:15:31,067 INFO ]: Start isEmpty. Operand 38 states and 39 transitions. [2018-06-22 01:15:31,068 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:15:31,068 INFO ]: Found error trace [2018-06-22 01:15:31,068 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:31,068 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:31,068 INFO ]: Analyzing trace with hash 977777070, now seen corresponding path program 39 times [2018-06-22 01:15:31,068 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:31,068 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:31,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:31,068 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:31,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:31,080 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:31,383 INFO ]: Checked inductivity of 196 backedges. 92 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:31,383 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:31,400 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 01:15:31,406 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:15:31,497 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 01:15:31,497 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:31,501 INFO ]: Computing forward predicates... [2018-06-22 01:15:31,788 INFO ]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:31,807 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:31,807 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 46 [2018-06-22 01:15:31,807 INFO ]: Interpolant automaton has 46 states [2018-06-22 01:15:31,808 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 01:15:31,808 INFO ]: CoverageRelationStatistics Valid=482, Invalid=1588, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:15:31,808 INFO ]: Start difference. First operand 38 states and 39 transitions. Second operand 46 states. [2018-06-22 01:15:32,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:32,175 INFO ]: Finished difference Result 39 states and 40 transitions. [2018-06-22 01:15:32,175 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:15:32,175 INFO ]: Start accepts. Automaton has 46 states. Word has length 37 [2018-06-22 01:15:32,175 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:32,175 INFO ]: With dead ends: 39 [2018-06-22 01:15:32,175 INFO ]: Without dead ends: 39 [2018-06-22 01:15:32,175 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1035, Invalid=2505, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 01:15:32,175 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:15:32,176 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 01:15:32,176 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:15:32,176 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-22 01:15:32,176 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2018-06-22 01:15:32,176 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:32,176 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-22 01:15:32,176 INFO ]: Interpolant automaton has 46 states. [2018-06-22 01:15:32,176 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-22 01:15:32,177 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:15:32,177 INFO ]: Found error trace [2018-06-22 01:15:32,177 INFO ]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:32,177 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:32,177 INFO ]: Analyzing trace with hash 362974052, now seen corresponding path program 40 times [2018-06-22 01:15:32,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:32,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:32,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:32,177 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:32,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:32,190 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:32,850 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:32,850 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:32,850 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 01:15:32,857 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:15:32,909 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:32,909 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:32,914 INFO ]: Computing forward predicates... [2018-06-22 01:15:33,018 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:33,037 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:33,037 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-22 01:15:33,037 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:15:33,037 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:15:33,038 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:15:33,038 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 34 states. [2018-06-22 01:15:34,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:34,216 INFO ]: Finished difference Result 59 states and 62 transitions. [2018-06-22 01:15:34,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:15:34,216 INFO ]: Start accepts. Automaton has 34 states. Word has length 38 [2018-06-22 01:15:34,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:34,217 INFO ]: With dead ends: 59 [2018-06-22 01:15:34,217 INFO ]: Without dead ends: 59 [2018-06-22 01:15:34,217 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=284, Invalid=4006, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 01:15:34,217 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 01:15:34,219 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 41. [2018-06-22 01:15:34,219 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:15:34,219 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-06-22 01:15:34,219 INFO ]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2018-06-22 01:15:34,219 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:34,219 INFO ]: Abstraction has 41 states and 43 transitions. [2018-06-22 01:15:34,219 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:15:34,219 INFO ]: Start isEmpty. Operand 41 states and 43 transitions. [2018-06-22 01:15:34,220 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:15:34,220 INFO ]: Found error trace [2018-06-22 01:15:34,220 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:34,220 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:34,220 INFO ]: Analyzing trace with hash -1516050322, now seen corresponding path program 41 times [2018-06-22 01:15:34,220 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:34,220 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:34,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:34,220 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:34,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:34,231 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:34,763 INFO ]: Checked inductivity of 225 backedges. 105 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:34,763 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:34,763 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:34,771 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:15:34,836 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 01:15:34,836 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:34,841 INFO ]: Computing forward predicates... [2018-06-22 01:15:35,283 INFO ]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:35,302 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:35,302 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 49 [2018-06-22 01:15:35,302 INFO ]: Interpolant automaton has 49 states [2018-06-22 01:15:35,302 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-22 01:15:35,302 INFO ]: CoverageRelationStatistics Valid=560, Invalid=1792, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:15:35,302 INFO ]: Start difference. First operand 41 states and 43 transitions. Second operand 49 states. [2018-06-22 01:15:35,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:35,666 INFO ]: Finished difference Result 56 states and 58 transitions. [2018-06-22 01:15:35,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:15:35,666 INFO ]: Start accepts. Automaton has 49 states. Word has length 39 [2018-06-22 01:15:35,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:35,666 INFO ]: With dead ends: 56 [2018-06-22 01:15:35,666 INFO ]: Without dead ends: 40 [2018-06-22 01:15:35,667 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1000, Invalid=3160, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 01:15:35,668 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 01:15:35,668 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-22 01:15:35,668 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:15:35,669 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-22 01:15:35,669 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 39 [2018-06-22 01:15:35,669 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:35,669 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-22 01:15:35,669 INFO ]: Interpolant automaton has 49 states. [2018-06-22 01:15:35,669 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-22 01:15:35,669 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:15:35,669 INFO ]: Found error trace [2018-06-22 01:15:35,669 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:35,669 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:35,669 INFO ]: Analyzing trace with hash -886623450, now seen corresponding path program 42 times [2018-06-22 01:15:35,669 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:35,669 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:35,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:35,670 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:35,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:35,681 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:36,933 INFO ]: Checked inductivity of 225 backedges. 106 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:36,933 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:36,933 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:36,939 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:15:37,001 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-22 01:15:37,001 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:37,005 INFO ]: Computing forward predicates... [2018-06-22 01:15:37,325 INFO ]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:37,344 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:37,344 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 49 [2018-06-22 01:15:37,344 INFO ]: Interpolant automaton has 49 states [2018-06-22 01:15:37,344 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-22 01:15:37,345 INFO ]: CoverageRelationStatistics Valid=546, Invalid=1806, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:15:37,345 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 49 states. [2018-06-22 01:15:37,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:37,621 INFO ]: Finished difference Result 41 states and 42 transitions. [2018-06-22 01:15:37,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:15:37,621 INFO ]: Start accepts. Automaton has 49 states. Word has length 39 [2018-06-22 01:15:37,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:37,622 INFO ]: With dead ends: 41 [2018-06-22 01:15:37,622 INFO ]: Without dead ends: 41 [2018-06-22 01:15:37,622 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1176, Invalid=2856, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:15:37,622 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:15:37,623 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-22 01:15:37,623 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:15:37,624 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-06-22 01:15:37,624 INFO ]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2018-06-22 01:15:37,624 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:37,624 INFO ]: Abstraction has 41 states and 42 transitions. [2018-06-22 01:15:37,624 INFO ]: Interpolant automaton has 49 states. [2018-06-22 01:15:37,624 INFO ]: Start isEmpty. Operand 41 states and 42 transitions. [2018-06-22 01:15:37,624 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:15:37,624 INFO ]: Found error trace [2018-06-22 01:15:37,624 INFO ]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:37,624 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:37,624 INFO ]: Analyzing trace with hash -1598867220, now seen corresponding path program 43 times [2018-06-22 01:15:37,624 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:37,624 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:37,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:37,625 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:37,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:37,638 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:38,185 INFO ]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:38,185 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:38,185 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:38,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:38,246 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:38,251 INFO ]: Computing forward predicates... [2018-06-22 01:15:38,389 INFO ]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:38,409 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:38,409 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-06-22 01:15:38,409 INFO ]: Interpolant automaton has 36 states [2018-06-22 01:15:38,409 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 01:15:38,409 INFO ]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:15:38,409 INFO ]: Start difference. First operand 41 states and 42 transitions. Second operand 36 states. [2018-06-22 01:15:39,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:39,866 INFO ]: Finished difference Result 62 states and 65 transitions. [2018-06-22 01:15:39,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:15:39,866 INFO ]: Start accepts. Automaton has 36 states. Word has length 40 [2018-06-22 01:15:39,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:39,866 INFO ]: With dead ends: 62 [2018-06-22 01:15:39,867 INFO ]: Without dead ends: 62 [2018-06-22 01:15:39,867 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 29 SyntacticMatches, 11 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=302, Invalid=4528, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:15:39,867 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 01:15:39,869 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-06-22 01:15:39,869 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:15:39,869 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-06-22 01:15:39,869 INFO ]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 40 [2018-06-22 01:15:39,869 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:39,869 INFO ]: Abstraction has 43 states and 45 transitions. [2018-06-22 01:15:39,869 INFO ]: Interpolant automaton has 36 states. [2018-06-22 01:15:39,869 INFO ]: Start isEmpty. Operand 43 states and 45 transitions. [2018-06-22 01:15:39,870 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:15:39,870 INFO ]: Found error trace [2018-06-22 01:15:39,870 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:39,870 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:39,870 INFO ]: Analyzing trace with hash 2091379686, now seen corresponding path program 44 times [2018-06-22 01:15:39,871 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:39,871 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:39,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:39,871 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:39,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:39,885 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:40,860 INFO ]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:40,860 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:40,860 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:40,866 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:40,925 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:40,925 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:40,931 INFO ]: Computing forward predicates... [2018-06-22 01:15:42,443 INFO ]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:42,463 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:42,463 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 52 [2018-06-22 01:15:42,463 INFO ]: Interpolant automaton has 52 states [2018-06-22 01:15:42,463 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-22 01:15:42,464 INFO ]: CoverageRelationStatistics Valid=629, Invalid=2023, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:15:42,464 INFO ]: Start difference. First operand 43 states and 45 transitions. Second operand 52 states. [2018-06-22 01:15:42,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:42,895 INFO ]: Finished difference Result 59 states and 61 transitions. [2018-06-22 01:15:42,895 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:15:42,895 INFO ]: Start accepts. Automaton has 52 states. Word has length 41 [2018-06-22 01:15:42,895 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:42,896 INFO ]: With dead ends: 59 [2018-06-22 01:15:42,896 INFO ]: Without dead ends: 42 [2018-06-22 01:15:42,896 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1122, Invalid=3570, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 01:15:42,896 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:15:42,897 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 01:15:42,897 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:15:42,897 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-06-22 01:15:42,897 INFO ]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2018-06-22 01:15:42,897 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:42,897 INFO ]: Abstraction has 42 states and 43 transitions. [2018-06-22 01:15:42,897 INFO ]: Interpolant automaton has 52 states. [2018-06-22 01:15:42,897 INFO ]: Start isEmpty. Operand 42 states and 43 transitions. [2018-06-22 01:15:42,898 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:15:42,898 INFO ]: Found error trace [2018-06-22 01:15:42,898 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:42,898 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:42,898 INFO ]: Analyzing trace with hash 128776238, now seen corresponding path program 45 times [2018-06-22 01:15:42,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:42,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:42,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:42,898 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:42,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:42,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:43,983 INFO ]: Checked inductivity of 256 backedges. 121 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:43,983 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:43,983 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:43,989 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:15:44,054 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 01:15:44,054 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:44,059 INFO ]: Computing forward predicates... [2018-06-22 01:15:44,507 INFO ]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:44,526 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:44,526 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 52 [2018-06-22 01:15:44,526 INFO ]: Interpolant automaton has 52 states [2018-06-22 01:15:44,527 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-22 01:15:44,527 INFO ]: CoverageRelationStatistics Valid=614, Invalid=2038, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:15:44,527 INFO ]: Start difference. First operand 42 states and 43 transitions. Second operand 52 states. [2018-06-22 01:15:44,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:44,955 INFO ]: Finished difference Result 43 states and 44 transitions. [2018-06-22 01:15:44,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:15:44,955 INFO ]: Start accepts. Automaton has 52 states. Word has length 41 [2018-06-22 01:15:44,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:44,955 INFO ]: With dead ends: 43 [2018-06-22 01:15:44,955 INFO ]: Without dead ends: 43 [2018-06-22 01:15:44,955 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=3230, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 01:15:44,955 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:15:44,956 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-22 01:15:44,956 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:15:44,956 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-06-22 01:15:44,956 INFO ]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2018-06-22 01:15:44,957 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:44,957 INFO ]: Abstraction has 43 states and 44 transitions. [2018-06-22 01:15:44,957 INFO ]: Interpolant automaton has 52 states. [2018-06-22 01:15:44,957 INFO ]: Start isEmpty. Operand 43 states and 44 transitions. [2018-06-22 01:15:44,957 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:15:44,957 INFO ]: Found error trace [2018-06-22 01:15:44,957 INFO ]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:44,957 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:44,957 INFO ]: Analyzing trace with hash -186247964, now seen corresponding path program 46 times [2018-06-22 01:15:44,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:44,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:44,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:44,958 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:44,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:44,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:46,145 INFO ]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:46,145 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:46,145 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:46,150 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:15:46,229 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:46,229 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:46,234 INFO ]: Computing forward predicates... [2018-06-22 01:15:46,331 INFO ]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:46,350 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:46,350 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-06-22 01:15:46,350 INFO ]: Interpolant automaton has 38 states [2018-06-22 01:15:46,350 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 01:15:46,350 INFO ]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:15:46,350 INFO ]: Start difference. First operand 43 states and 44 transitions. Second operand 38 states. [2018-06-22 01:15:47,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:47,827 INFO ]: Finished difference Result 65 states and 68 transitions. [2018-06-22 01:15:47,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:15:47,827 INFO ]: Start accepts. Automaton has 38 states. Word has length 42 [2018-06-22 01:15:47,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:47,827 INFO ]: With dead ends: 65 [2018-06-22 01:15:47,827 INFO ]: Without dead ends: 65 [2018-06-22 01:15:47,827 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=320, Invalid=5082, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 01:15:47,828 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 01:15:47,829 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 45. [2018-06-22 01:15:47,829 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:15:47,829 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-06-22 01:15:47,829 INFO ]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 42 [2018-06-22 01:15:47,829 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:47,829 INFO ]: Abstraction has 45 states and 47 transitions. [2018-06-22 01:15:47,829 INFO ]: Interpolant automaton has 38 states. [2018-06-22 01:15:47,829 INFO ]: Start isEmpty. Operand 45 states and 47 transitions. [2018-06-22 01:15:47,830 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:15:47,830 INFO ]: Found error trace [2018-06-22 01:15:47,830 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:47,830 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:47,830 INFO ]: Analyzing trace with hash -1362063634, now seen corresponding path program 47 times [2018-06-22 01:15:47,830 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:47,830 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:47,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:47,831 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:47,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:47,845 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 01:15:47,867 WARN ]: Unable to check validity of interpolant: cancelled [2018-06-22 01:15:47,867 WARN ]: Unable to check validity of interpolant: cancelled [2018-06-22 01:15:47,867 WARN ]: Unable to check validity of interpolant: cancelled [2018-06-22 01:15:47,867 WARN ]: Unable to check validity of interpolant: cancelled [2018-06-22 01:15:47,867 WARN ]: Unable to check validity of interpolant: cancelled [2018-06-22 01:15:47,868 WARN ]: Unable to check validity of interpolant: cancelled [2018-06-22 01:15:47,868 WARN ]: Unable to check validity of interpolant: cancelled [2018-06-22 01:15:47,868 WARN ]: Unable to check validity of interpolant: cancelled [2018-06-22 01:15:47,868 WARN ]: Unable to check validity of interpolant: cancelled [2018-06-22 01:15:47,875 WARN ]: Verification canceled [2018-06-22 01:15:47,882 WARN ]: Timeout [2018-06-22 01:15:47,882 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:15:47 BoogieIcfgContainer [2018-06-22 01:15:47,882 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:15:47,883 INFO ]: Toolchain (without parser) took 56644.58 ms. Allocated memory was 308.3 MB in the beginning and 657.5 MB in the end (delta: 349.2 MB). Free memory was 263.7 MB in the beginning and 591.2 MB in the end (delta: -327.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 3.6 GB. [2018-06-22 01:15:47,884 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:15:47,884 INFO ]: ChcToBoogie took 53.01 ms. Allocated memory is still 308.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:15:47,885 INFO ]: Boogie Preprocessor took 35.49 ms. Allocated memory is still 308.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:15:47,888 INFO ]: RCFGBuilder took 304.24 ms. Allocated memory is still 308.3 MB. Free memory was 259.7 MB in the beginning and 249.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:15:47,888 INFO ]: TraceAbstraction took 56243.83 ms. Allocated memory was 308.3 MB in the beginning and 657.5 MB in the end (delta: 349.2 MB). Free memory was 249.6 MB in the beginning and 591.2 MB in the end (delta: -341.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 3.6 GB. [2018-06-22 01:15:47,891 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 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.01 ms. Allocated memory is still 308.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.49 ms. Allocated memory is still 308.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 304.24 ms. Allocated memory is still 308.3 MB. Free memory was 259.7 MB in the beginning and 249.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56243.83 ms. Allocated memory was 308.3 MB in the beginning and 657.5 MB in the end (delta: 349.2 MB). Free memory was 249.6 MB in the beginning and 591.2 MB in the end (delta: -341.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 17, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 42 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 56.1s OverallTime, 55 OverallIterations, 17 TraceHistogramMax, 20.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 500 SDtfs, 1638 SDslu, 4896 SDs, 0 SdLazy, 12953 SolverSat, 1958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2826 GetRequests, 886 SyntacticMatches, 97 SemanticMatches, 1843 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16572 ImplicationChecksByTransitivity, 40.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 54 MinimizatonAttempts, 210 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 30.9s InterpolantComputationTime, 2572 NumberOfCodeBlocks, 2572 NumberOfCodeBlocksAsserted, 215 NumberOfCheckSat, 2471 ConstructedInterpolants, 0 QuantifiedInterpolants, 389805 SizeOfPredicates, 298 NumberOfNonLiveVariables, 16929 ConjunctsInSsa, 3980 ConjunctsInUnsatCore, 101 InterpolantComputations, 8 PerfectInterpolantSequences, 3009/9249 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/nested-while_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-15-47-904.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-15-47-904.csv Completed graceful shutdown