java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/003d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:08:39,949 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:08:39,950 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:08:39,962 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:08:39,962 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:08:39,963 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:08:39,965 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:08:39,966 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:08:39,968 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:08:39,969 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:08:39,970 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:08:39,970 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:08:39,973 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:08:39,974 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:08:39,975 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:08:39,975 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:08:39,979 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:08:39,981 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:08:39,983 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:08:39,984 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:08:39,985 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:08:39,988 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:08:39,988 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:08:39,988 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:08:39,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:08:39,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:08:39,991 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:08:39,991 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:08:39,992 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:08:39,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:08:39,993 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:08:39,994 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:08:39,994 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:08:39,995 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:08:39,996 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:08:39,996 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:08:40,019 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:08:40,019 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:08:40,019 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:08:40,020 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:08:40,021 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:08:40,021 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:08:40,021 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:08:40,021 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:08:40,021 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:08:40,022 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:08:40,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:08:40,022 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:08:40,022 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:08:40,022 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:08:40,023 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:08:40,023 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:08:40,023 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:08:40,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:08:40,023 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:08:40,025 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:08:40,025 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:08:40,070 INFO ]: Repository-Root is: /tmp [2018-06-22 11:08:40,088 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:08:40,093 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:08:40,095 INFO ]: Initializing SmtParser... [2018-06-22 11:08:40,095 INFO ]: SmtParser initialized [2018-06-22 11:08:40,095 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/003d-horn.smt2 [2018-06-22 11:08:40,097 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:08:40,225 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003d-horn.smt2 unknown [2018-06-22 11:08:40,459 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003d-horn.smt2 [2018-06-22 11:08:40,469 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:08:40,476 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:08:40,477 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:08:40,477 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:08:40,477 INFO ]: ChcToBoogie initialized [2018-06-22 11:08:40,480 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:08:40" (1/1) ... [2018-06-22 11:08:40,526 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:40 Unit [2018-06-22 11:08:40,526 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:08:40,527 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:08:40,527 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:08:40,527 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:08:40,545 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:40" (1/1) ... [2018-06-22 11:08:40,546 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:40" (1/1) ... [2018-06-22 11:08:40,553 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:40" (1/1) ... [2018-06-22 11:08:40,553 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:40" (1/1) ... [2018-06-22 11:08:40,557 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:40" (1/1) ... [2018-06-22 11:08:40,570 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:40" (1/1) ... [2018-06-22 11:08:40,571 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:40" (1/1) ... [2018-06-22 11:08:40,573 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:08:40,573 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:08:40,573 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:08:40,573 INFO ]: RCFGBuilder initialized [2018-06-22 11:08:40,574 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:40" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:08:40,599 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:08:40,599 INFO ]: Found specification of procedure False [2018-06-22 11:08:40,599 INFO ]: Found implementation of procedure False [2018-06-22 11:08:40,600 INFO ]: Specification and implementation of procedure INV1 given in one single declaration [2018-06-22 11:08:40,600 INFO ]: Found specification of procedure INV1 [2018-06-22 11:08:40,600 INFO ]: Found implementation of procedure INV1 [2018-06-22 11:08:40,600 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:08:40,600 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:08:40,600 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:08:40,894 INFO ]: Using library mode [2018-06-22 11:08:40,895 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:08:40 BoogieIcfgContainer [2018-06-22 11:08:40,895 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:08:40,896 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:08:40,896 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:08:40,903 INFO ]: TraceAbstraction initialized [2018-06-22 11:08:40,903 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:08:40" (1/3) ... [2018-06-22 11:08:40,904 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbea22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:08:40, skipping insertion in model container [2018-06-22 11:08:40,904 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:40" (2/3) ... [2018-06-22 11:08:40,908 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbea22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:08:40, skipping insertion in model container [2018-06-22 11:08:40,908 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:08:40" (3/3) ... [2018-06-22 11:08:40,910 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:08:40,916 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:08:40,923 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:08:40,957 INFO ]: Using default assertion order modulation [2018-06-22 11:08:40,958 INFO ]: Interprodecural is true [2018-06-22 11:08:40,958 INFO ]: Hoare is false [2018-06-22 11:08:40,958 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:08:40,958 INFO ]: Backedges is TWOTRACK [2018-06-22 11:08:40,958 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:08:40,958 INFO ]: Difference is false [2018-06-22 11:08:40,958 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:08:40,958 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:08:40,971 INFO ]: Start isEmpty. Operand 17 states. [2018-06-22 11:08:40,983 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:08:40,984 INFO ]: Found error trace [2018-06-22 11:08:40,985 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:40,985 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:40,991 INFO ]: Analyzing trace with hash -1145572331, now seen corresponding path program 1 times [2018-06-22 11:08:40,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:40,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:41,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:41,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:41,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:41,084 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:41,250 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:08:41,252 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:41,252 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:41,254 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:41,268 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:41,269 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:41,272 INFO ]: Start difference. First operand 17 states. Second operand 4 states. [2018-06-22 11:08:41,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:41,531 INFO ]: Finished difference Result 17 states and 30 transitions. [2018-06-22 11:08:41,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:41,533 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:08:41,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:41,542 INFO ]: With dead ends: 17 [2018-06-22 11:08:41,542 INFO ]: Without dead ends: 17 [2018-06-22 11:08:41,543 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:41,556 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 11:08:41,585 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 11:08:41,587 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:08:41,588 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2018-06-22 11:08:41,589 INFO ]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 9 [2018-06-22 11:08:41,590 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:41,590 INFO ]: Abstraction has 17 states and 30 transitions. [2018-06-22 11:08:41,590 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:41,590 INFO ]: Start isEmpty. Operand 17 states and 30 transitions. [2018-06-22 11:08:41,592 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:41,592 INFO ]: Found error trace [2018-06-22 11:08:41,592 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:41,592 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:41,592 INFO ]: Analyzing trace with hash -1610962209, now seen corresponding path program 1 times [2018-06-22 11:08:41,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:41,592 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:41,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:41,593 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:41,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:41,612 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:41,646 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:08:41,646 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:41,646 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:41,648 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:41,648 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:41,648 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:41,648 INFO ]: Start difference. First operand 17 states and 30 transitions. Second operand 4 states. [2018-06-22 11:08:41,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:41,891 INFO ]: Finished difference Result 21 states and 42 transitions. [2018-06-22 11:08:41,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:41,892 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:08:41,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:41,893 INFO ]: With dead ends: 21 [2018-06-22 11:08:41,893 INFO ]: Without dead ends: 21 [2018-06-22 11:08:41,894 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:41,894 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:08:41,907 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 11:08:41,907 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:08:41,908 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-06-22 11:08:41,908 INFO ]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 13 [2018-06-22 11:08:41,908 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:41,908 INFO ]: Abstraction has 19 states and 35 transitions. [2018-06-22 11:08:41,908 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:41,908 INFO ]: Start isEmpty. Operand 19 states and 35 transitions. [2018-06-22 11:08:41,910 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:41,910 INFO ]: Found error trace [2018-06-22 11:08:41,910 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:41,910 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:41,910 INFO ]: Analyzing trace with hash -1856213062, now seen corresponding path program 1 times [2018-06-22 11:08:41,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:41,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:41,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:41,911 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:41,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:41,938 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:42,271 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:08:42,271 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:42,271 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:42,294 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:42,352 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:42,364 INFO ]: Computing forward predicates... [2018-06-22 11:08:42,593 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:08:42,615 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:42,615 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:08:42,615 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:08:42,615 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:08:42,615 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:08:42,615 INFO ]: Start difference. First operand 19 states and 35 transitions. Second operand 8 states. [2018-06-22 11:08:43,559 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:43,560 INFO ]: Finished difference Result 23 states and 48 transitions. [2018-06-22 11:08:43,560 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:08:43,560 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:08:43,560 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:43,561 INFO ]: With dead ends: 23 [2018-06-22 11:08:43,561 INFO ]: Without dead ends: 23 [2018-06-22 11:08:43,562 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:08:43,562 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:08:43,571 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-22 11:08:43,571 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:08:43,572 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 41 transitions. [2018-06-22 11:08:43,572 INFO ]: Start accepts. Automaton has 21 states and 41 transitions. Word has length 13 [2018-06-22 11:08:43,572 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:43,572 INFO ]: Abstraction has 21 states and 41 transitions. [2018-06-22 11:08:43,572 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:08:43,572 INFO ]: Start isEmpty. Operand 21 states and 41 transitions. [2018-06-22 11:08:43,573 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:43,573 INFO ]: Found error trace [2018-06-22 11:08:43,574 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:43,574 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:43,574 INFO ]: Analyzing trace with hash -1120460503, now seen corresponding path program 1 times [2018-06-22 11:08:43,574 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:43,574 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:43,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:43,575 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:43,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:43,587 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:43,724 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:08:43,725 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:43,725 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:43,725 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:43,725 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:43,725 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:43,725 INFO ]: Start difference. First operand 21 states and 41 transitions. Second operand 4 states. [2018-06-22 11:08:44,385 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:44,385 INFO ]: Finished difference Result 25 states and 52 transitions. [2018-06-22 11:08:44,386 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:44,386 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:08:44,386 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:44,387 INFO ]: With dead ends: 25 [2018-06-22 11:08:44,387 INFO ]: Without dead ends: 25 [2018-06-22 11:08:44,388 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:44,388 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:08:44,396 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:08:44,396 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:08:44,397 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 45 transitions. [2018-06-22 11:08:44,397 INFO ]: Start accepts. Automaton has 23 states and 45 transitions. Word has length 13 [2018-06-22 11:08:44,397 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:44,397 INFO ]: Abstraction has 23 states and 45 transitions. [2018-06-22 11:08:44,397 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:44,397 INFO ]: Start isEmpty. Operand 23 states and 45 transitions. [2018-06-22 11:08:44,399 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:44,399 INFO ]: Found error trace [2018-06-22 11:08:44,399 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:44,399 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:44,399 INFO ]: Analyzing trace with hash -1708436905, now seen corresponding path program 1 times [2018-06-22 11:08:44,399 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:44,399 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:44,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:44,400 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:44,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:44,410 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:44,550 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:08:44,550 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:44,550 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:44,550 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:44,550 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:44,550 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:44,550 INFO ]: Start difference. First operand 23 states and 45 transitions. Second operand 4 states. [2018-06-22 11:08:44,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:44,701 INFO ]: Finished difference Result 23 states and 45 transitions. [2018-06-22 11:08:44,701 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:44,701 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:08:44,701 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:44,702 INFO ]: With dead ends: 23 [2018-06-22 11:08:44,702 INFO ]: Without dead ends: 23 [2018-06-22 11:08:44,702 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:44,703 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:08:44,709 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 11:08:44,709 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:08:44,710 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 45 transitions. [2018-06-22 11:08:44,710 INFO ]: Start accepts. Automaton has 23 states and 45 transitions. Word has length 13 [2018-06-22 11:08:44,711 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:44,711 INFO ]: Abstraction has 23 states and 45 transitions. [2018-06-22 11:08:44,711 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:44,711 INFO ]: Start isEmpty. Operand 23 states and 45 transitions. [2018-06-22 11:08:44,712 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:08:44,712 INFO ]: Found error trace [2018-06-22 11:08:44,712 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:44,712 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:44,712 INFO ]: Analyzing trace with hash -761358532, now seen corresponding path program 1 times [2018-06-22 11:08:44,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:44,713 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:44,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:44,713 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:44,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:44,730 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:44,801 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:08:44,801 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:44,801 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:08:44,801 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:08:44,801 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:08:44,801 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:08:44,801 INFO ]: Start difference. First operand 23 states and 45 transitions. Second operand 5 states. [2018-06-22 11:08:44,882 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:44,882 INFO ]: Finished difference Result 21 states and 37 transitions. [2018-06-22 11:08:44,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:08:44,884 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:08:44,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:44,885 INFO ]: With dead ends: 21 [2018-06-22 11:08:44,885 INFO ]: Without dead ends: 20 [2018-06-22 11:08:44,885 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:08:44,885 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:08:44,888 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:08:44,888 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:08:44,889 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2018-06-22 11:08:44,889 INFO ]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 17 [2018-06-22 11:08:44,889 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:44,889 INFO ]: Abstraction has 18 states and 29 transitions. [2018-06-22 11:08:44,889 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:08:44,889 INFO ]: Start isEmpty. Operand 18 states and 29 transitions. [2018-06-22 11:08:44,890 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:08:44,890 INFO ]: Found error trace [2018-06-22 11:08:44,890 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:44,891 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:44,891 INFO ]: Analyzing trace with hash 1284865055, now seen corresponding path program 2 times [2018-06-22 11:08:44,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:44,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:44,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:44,892 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:44,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:44,916 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:45,158 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:08:45,158 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:45,158 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:45,167 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:08:45,226 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:08:45,226 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:45,230 INFO ]: Computing forward predicates... [2018-06-22 11:08:45,561 INFO ]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:08:45,594 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:45,595 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:08:45,595 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:08:45,595 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:08:45,595 INFO ]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:08:45,595 INFO ]: Start difference. First operand 18 states and 29 transitions. Second operand 13 states. [2018-06-22 11:08:46,429 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:46,429 INFO ]: Finished difference Result 32 states and 66 transitions. [2018-06-22 11:08:46,430 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:08:46,430 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:08:46,430 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:46,431 INFO ]: With dead ends: 32 [2018-06-22 11:08:46,431 INFO ]: Without dead ends: 32 [2018-06-22 11:08:46,431 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:08:46,431 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:08:46,445 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-06-22 11:08:46,446 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:08:46,446 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2018-06-22 11:08:46,446 INFO ]: Start accepts. Automaton has 20 states and 34 transitions. Word has length 17 [2018-06-22 11:08:46,446 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:46,447 INFO ]: Abstraction has 20 states and 34 transitions. [2018-06-22 11:08:46,447 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:08:46,447 INFO ]: Start isEmpty. Operand 20 states and 34 transitions. [2018-06-22 11:08:46,447 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:08:46,447 INFO ]: Found error trace [2018-06-22 11:08:46,447 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:46,448 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:46,450 INFO ]: Analyzing trace with hash 47238596, now seen corresponding path program 1 times [2018-06-22 11:08:46,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:46,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:46,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:46,451 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:46,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:46,471 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:46,582 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:08:46,582 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:46,582 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:46,588 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:46,610 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:46,612 INFO ]: Computing forward predicates... [2018-06-22 11:08:46,635 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:08:46,659 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:46,659 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:08:46,659 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:08:46,659 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:08:46,659 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:08:46,659 INFO ]: Start difference. First operand 20 states and 34 transitions. Second operand 6 states. [2018-06-22 11:08:46,798 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:46,798 INFO ]: Finished difference Result 28 states and 54 transitions. [2018-06-22 11:08:46,798 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:08:46,798 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:08:46,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:46,799 INFO ]: With dead ends: 28 [2018-06-22 11:08:46,799 INFO ]: Without dead ends: 28 [2018-06-22 11:08:46,799 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:08:46,799 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:08:46,808 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-22 11:08:46,808 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:08:46,809 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 42 transitions. [2018-06-22 11:08:46,809 INFO ]: Start accepts. Automaton has 24 states and 42 transitions. Word has length 17 [2018-06-22 11:08:46,809 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:46,809 INFO ]: Abstraction has 24 states and 42 transitions. [2018-06-22 11:08:46,809 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:08:46,809 INFO ]: Start isEmpty. Operand 24 states and 42 transitions. [2018-06-22 11:08:46,810 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:08:46,810 INFO ]: Found error trace [2018-06-22 11:08:46,810 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:46,810 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:46,811 INFO ]: Analyzing trace with hash 1866952974, now seen corresponding path program 1 times [2018-06-22 11:08:46,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:46,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:46,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:46,811 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:46,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:46,824 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:46,888 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:08:46,888 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:46,888 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:08:46,889 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:08:46,889 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:08:46,889 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:08:46,889 INFO ]: Start difference. First operand 24 states and 42 transitions. Second operand 5 states. [2018-06-22 11:08:46,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:46,969 INFO ]: Finished difference Result 30 states and 55 transitions. [2018-06-22 11:08:46,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:08:46,970 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:08:46,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:46,972 INFO ]: With dead ends: 30 [2018-06-22 11:08:46,972 INFO ]: Without dead ends: 30 [2018-06-22 11:08:46,972 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:08:46,972 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:08:46,979 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-06-22 11:08:46,979 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:08:46,980 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. [2018-06-22 11:08:46,980 INFO ]: Start accepts. Automaton has 26 states and 43 transitions. Word has length 17 [2018-06-22 11:08:46,981 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:46,981 INFO ]: Abstraction has 26 states and 43 transitions. [2018-06-22 11:08:46,981 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:08:46,981 INFO ]: Start isEmpty. Operand 26 states and 43 transitions. [2018-06-22 11:08:46,982 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:08:46,982 INFO ]: Found error trace [2018-06-22 11:08:46,982 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:46,982 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:46,982 INFO ]: Analyzing trace with hash 210601961, now seen corresponding path program 1 times [2018-06-22 11:08:46,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:46,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:46,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:46,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:46,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:46,994 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:47,033 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:08:47,033 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:47,033 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:47,033 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:47,033 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:47,033 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:47,033 INFO ]: Start difference. First operand 26 states and 43 transitions. Second operand 4 states. [2018-06-22 11:08:47,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:47,052 INFO ]: Finished difference Result 28 states and 50 transitions. [2018-06-22 11:08:47,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:47,053 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:08:47,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:47,054 INFO ]: With dead ends: 28 [2018-06-22 11:08:47,054 INFO ]: Without dead ends: 28 [2018-06-22 11:08:47,054 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:47,054 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:08:47,061 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-22 11:08:47,061 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:08:47,061 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2018-06-22 11:08:47,061 INFO ]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 17 [2018-06-22 11:08:47,062 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:47,062 INFO ]: Abstraction has 24 states and 39 transitions. [2018-06-22 11:08:47,062 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:47,062 INFO ]: Start isEmpty. Operand 24 states and 39 transitions. [2018-06-22 11:08:47,063 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:08:47,063 INFO ]: Found error trace [2018-06-22 11:08:47,063 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:47,063 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:47,063 INFO ]: Analyzing trace with hash 101192041, now seen corresponding path program 2 times [2018-06-22 11:08:47,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:47,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:47,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:47,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:47,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:47,075 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:47,198 INFO ]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:08:47,198 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:47,198 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:47,205 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:08:47,253 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:08:47,253 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:47,256 INFO ]: Computing forward predicates... [2018-06-22 11:08:47,282 INFO ]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:08:47,314 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:47,314 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:08:47,314 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:08:47,315 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:08:47,315 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:08:47,315 INFO ]: Start difference. First operand 24 states and 39 transitions. Second operand 7 states. [2018-06-22 11:08:47,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:47,767 INFO ]: Finished difference Result 32 states and 57 transitions. [2018-06-22 11:08:47,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:08:47,768 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:08:47,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:47,768 INFO ]: With dead ends: 32 [2018-06-22 11:08:47,768 INFO ]: Without dead ends: 32 [2018-06-22 11:08:47,769 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:08:47,769 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:08:47,775 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-06-22 11:08:47,775 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:08:47,775 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2018-06-22 11:08:47,775 INFO ]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 21 [2018-06-22 11:08:47,776 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:47,776 INFO ]: Abstraction has 28 states and 45 transitions. [2018-06-22 11:08:47,776 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:08:47,776 INFO ]: Start isEmpty. Operand 28 states and 45 transitions. [2018-06-22 11:08:47,777 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:08:47,777 INFO ]: Found error trace [2018-06-22 11:08:47,777 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:47,778 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:47,778 INFO ]: Analyzing trace with hash -1426464242, now seen corresponding path program 2 times [2018-06-22 11:08:47,778 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:47,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:47,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:47,779 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:47,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:47,791 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:47,917 INFO ]: Checked inductivity of 19 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:08:47,917 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:47,917 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:47,923 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:08:47,953 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:08:47,953 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:47,957 INFO ]: Computing forward predicates... [2018-06-22 11:08:47,968 INFO ]: Checked inductivity of 19 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:08:47,988 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:47,988 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:08:47,988 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:08:47,988 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:08:47,988 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:08:47,988 INFO ]: Start difference. First operand 28 states and 45 transitions. Second operand 6 states. [2018-06-22 11:08:48,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:48,121 INFO ]: Finished difference Result 32 states and 58 transitions. [2018-06-22 11:08:48,122 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:08:48,122 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:08:48,122 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:48,122 INFO ]: With dead ends: 32 [2018-06-22 11:08:48,122 INFO ]: Without dead ends: 32 [2018-06-22 11:08:48,123 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:08:48,123 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:08:48,128 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-06-22 11:08:48,128 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:08:48,128 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 41 transitions. [2018-06-22 11:08:48,128 INFO ]: Start accepts. Automaton has 26 states and 41 transitions. Word has length 21 [2018-06-22 11:08:48,128 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:48,129 INFO ]: Abstraction has 26 states and 41 transitions. [2018-06-22 11:08:48,129 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:08:48,129 INFO ]: Start isEmpty. Operand 26 states and 41 transitions. [2018-06-22 11:08:48,129 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:08:48,129 INFO ]: Found error trace [2018-06-22 11:08:48,129 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:48,130 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:48,130 INFO ]: Analyzing trace with hash 1905224253, now seen corresponding path program 3 times [2018-06-22 11:08:48,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:48,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:48,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:48,130 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:48,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:48,141 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:48,183 INFO ]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:08:48,183 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:48,183 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:48,189 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:08:48,227 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:08:48,227 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:48,229 INFO ]: Computing forward predicates... [2018-06-22 11:08:48,238 INFO ]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:08:48,258 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:48,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 11:08:48,258 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:48,258 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:48,258 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:48,258 INFO ]: Start difference. First operand 26 states and 41 transitions. Second operand 4 states. [2018-06-22 11:08:48,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:48,323 INFO ]: Finished difference Result 32 states and 54 transitions. [2018-06-22 11:08:48,324 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:48,324 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:08:48,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:48,324 INFO ]: With dead ends: 32 [2018-06-22 11:08:48,325 INFO ]: Without dead ends: 32 [2018-06-22 11:08:48,325 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:08:48,325 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:08:48,329 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-22 11:08:48,329 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:08:48,330 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-06-22 11:08:48,330 INFO ]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 25 [2018-06-22 11:08:48,330 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:48,330 INFO ]: Abstraction has 30 states and 49 transitions. [2018-06-22 11:08:48,330 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:48,330 INFO ]: Start isEmpty. Operand 30 states and 49 transitions. [2018-06-22 11:08:48,331 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:08:48,331 INFO ]: Found error trace [2018-06-22 11:08:48,331 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:48,331 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:48,332 INFO ]: Analyzing trace with hash 289949134, now seen corresponding path program 3 times [2018-06-22 11:08:48,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:48,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:48,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:48,332 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:48,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:48,343 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:48,506 INFO ]: Checked inductivity of 33 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:08:48,506 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:48,506 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:48,522 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:08:48,564 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:08:48,564 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:48,567 INFO ]: Computing forward predicates... [2018-06-22 11:08:48,676 INFO ]: Checked inductivity of 33 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:08:48,696 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:48,696 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:08:48,696 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:08:48,696 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:08:48,696 INFO ]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:08:48,696 INFO ]: Start difference. First operand 30 states and 49 transitions. Second operand 16 states. [2018-06-22 11:08:49,361 WARN ]: Spent 236.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-06-22 11:08:49,557 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-06-22 11:08:49,893 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:49,893 INFO ]: Finished difference Result 51 states and 94 transitions. [2018-06-22 11:08:49,893 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:08:49,893 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 11:08:49,893 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:49,894 INFO ]: With dead ends: 51 [2018-06-22 11:08:49,894 INFO ]: Without dead ends: 41 [2018-06-22 11:08:49,895 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:08:49,895 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:08:49,904 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-06-22 11:08:49,904 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:08:49,905 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 68 transitions. [2018-06-22 11:08:49,905 INFO ]: Start accepts. Automaton has 37 states and 68 transitions. Word has length 25 [2018-06-22 11:08:49,905 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:49,905 INFO ]: Abstraction has 37 states and 68 transitions. [2018-06-22 11:08:49,905 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:08:49,905 INFO ]: Start isEmpty. Operand 37 states and 68 transitions. [2018-06-22 11:08:49,906 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:08:49,906 INFO ]: Found error trace [2018-06-22 11:08:49,906 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:49,906 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:49,907 INFO ]: Analyzing trace with hash -335549197, now seen corresponding path program 4 times [2018-06-22 11:08:49,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:49,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:49,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:49,907 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:49,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:49,920 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:50,151 INFO ]: Checked inductivity of 33 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:08:50,151 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:50,151 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:50,161 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:08:50,211 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:08:50,211 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:50,214 INFO ]: Computing forward predicates... [2018-06-22 11:08:50,228 INFO ]: Checked inductivity of 33 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:08:50,249 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:50,249 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:08:50,249 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:08:50,249 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:08:50,249 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:08:50,249 INFO ]: Start difference. First operand 37 states and 68 transitions. Second operand 7 states. [2018-06-22 11:08:50,386 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:50,386 INFO ]: Finished difference Result 39 states and 79 transitions. [2018-06-22 11:08:50,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:08:50,387 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 11:08:50,387 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:50,388 INFO ]: With dead ends: 39 [2018-06-22 11:08:50,388 INFO ]: Without dead ends: 39 [2018-06-22 11:08:50,388 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:08:50,388 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:08:50,393 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-06-22 11:08:50,393 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:08:50,394 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 64 transitions. [2018-06-22 11:08:50,394 INFO ]: Start accepts. Automaton has 35 states and 64 transitions. Word has length 25 [2018-06-22 11:08:50,394 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:50,394 INFO ]: Abstraction has 35 states and 64 transitions. [2018-06-22 11:08:50,394 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:08:50,394 INFO ]: Start isEmpty. Operand 35 states and 64 transitions. [2018-06-22 11:08:50,395 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:08:50,395 INFO ]: Found error trace [2018-06-22 11:08:50,395 INFO ]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:50,395 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:50,395 INFO ]: Analyzing trace with hash 581602749, now seen corresponding path program 1 times [2018-06-22 11:08:50,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:50,395 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:50,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:50,396 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:50,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:50,406 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:50,542 INFO ]: Checked inductivity of 48 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:08:50,542 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:50,542 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:50,542 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:50,543 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:50,543 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:50,543 INFO ]: Start difference. First operand 35 states and 64 transitions. Second operand 4 states. [2018-06-22 11:08:51,001 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:51,001 INFO ]: Finished difference Result 37 states and 67 transitions. [2018-06-22 11:08:51,001 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:51,001 INFO ]: Start accepts. Automaton has 4 states. Word has length 29 [2018-06-22 11:08:51,001 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:51,002 INFO ]: With dead ends: 37 [2018-06-22 11:08:51,002 INFO ]: Without dead ends: 37 [2018-06-22 11:08:51,002 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:08:51,002 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:08:51,006 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-06-22 11:08:51,006 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:08:51,007 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions. [2018-06-22 11:08:51,007 INFO ]: Start accepts. Automaton has 35 states and 61 transitions. Word has length 29 [2018-06-22 11:08:51,007 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:51,007 INFO ]: Abstraction has 35 states and 61 transitions. [2018-06-22 11:08:51,007 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:51,007 INFO ]: Start isEmpty. Operand 35 states and 61 transitions. [2018-06-22 11:08:51,008 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:08:51,008 INFO ]: Found error trace [2018-06-22 11:08:51,008 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:51,008 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:51,008 INFO ]: Analyzing trace with hash 934508696, now seen corresponding path program 5 times [2018-06-22 11:08:51,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:51,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:51,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:51,009 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:51,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:51,019 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:51,286 INFO ]: Checked inductivity of 51 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:08:51,286 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:51,286 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:51,292 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:08:51,330 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:08:51,330 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:51,333 INFO ]: Computing forward predicates... [2018-06-22 11:08:51,349 INFO ]: Checked inductivity of 51 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:08:51,380 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:51,380 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:08:51,381 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:08:51,381 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:08:51,381 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:08:51,381 INFO ]: Start difference. First operand 35 states and 61 transitions. Second operand 8 states. [2018-06-22 11:08:51,537 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:51,537 INFO ]: Finished difference Result 39 states and 74 transitions. [2018-06-22 11:08:51,537 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:08:51,537 INFO ]: Start accepts. Automaton has 8 states. Word has length 29 [2018-06-22 11:08:51,537 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:51,537 INFO ]: With dead ends: 39 [2018-06-22 11:08:51,537 INFO ]: Without dead ends: 39 [2018-06-22 11:08:51,538 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:08:51,538 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:08:51,542 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-06-22 11:08:51,542 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:08:51,543 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 60 transitions. [2018-06-22 11:08:51,543 INFO ]: Start accepts. Automaton has 35 states and 60 transitions. Word has length 29 [2018-06-22 11:08:51,543 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:51,543 INFO ]: Abstraction has 35 states and 60 transitions. [2018-06-22 11:08:51,543 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:08:51,543 INFO ]: Start isEmpty. Operand 35 states and 60 transitions. [2018-06-22 11:08:51,544 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:08:51,544 INFO ]: Found error trace [2018-06-22 11:08:51,544 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:51,544 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:51,544 INFO ]: Analyzing trace with hash -1023067405, now seen corresponding path program 4 times [2018-06-22 11:08:51,544 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:51,544 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:51,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:51,545 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:51,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:51,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:51,674 INFO ]: Checked inductivity of 51 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:08:51,674 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:51,674 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:51,679 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:08:51,724 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:08:51,724 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:51,727 INFO ]: Computing forward predicates... [2018-06-22 11:08:51,756 INFO ]: Checked inductivity of 51 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:08:51,780 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:51,780 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:08:51,780 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:08:51,780 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:08:51,780 INFO ]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:08:51,780 INFO ]: Start difference. First operand 35 states and 60 transitions. Second operand 9 states. [2018-06-22 11:08:51,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:51,868 INFO ]: Finished difference Result 41 states and 77 transitions. [2018-06-22 11:08:51,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:08:51,869 INFO ]: Start accepts. Automaton has 9 states. Word has length 29 [2018-06-22 11:08:51,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:51,870 INFO ]: With dead ends: 41 [2018-06-22 11:08:51,870 INFO ]: Without dead ends: 41 [2018-06-22 11:08:51,870 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:08:51,870 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:08:51,874 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-06-22 11:08:51,874 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:08:51,875 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2018-06-22 11:08:51,875 INFO ]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 29 [2018-06-22 11:08:51,876 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:51,876 INFO ]: Abstraction has 37 states and 63 transitions. [2018-06-22 11:08:51,876 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:08:51,876 INFO ]: Start isEmpty. Operand 37 states and 63 transitions. [2018-06-22 11:08:51,876 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:08:51,877 INFO ]: Found error trace [2018-06-22 11:08:51,877 INFO ]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:51,877 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:51,877 INFO ]: Analyzing trace with hash 435442941, now seen corresponding path program 6 times [2018-06-22 11:08:51,877 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:51,877 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:51,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:51,877 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:51,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:51,893 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:52,006 INFO ]: Checked inductivity of 73 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 11:08:52,006 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:52,006 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:52,011 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:08:52,095 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:08:52,095 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:52,098 INFO ]: Computing forward predicates... [2018-06-22 11:08:52,111 INFO ]: Checked inductivity of 73 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 11:08:52,131 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:52,131 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:08:52,131 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:08:52,131 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:08:52,131 INFO ]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:08:52,131 INFO ]: Start difference. First operand 37 states and 63 transitions. Second operand 9 states. [2018-06-22 11:08:52,304 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:52,304 INFO ]: Finished difference Result 41 states and 76 transitions. [2018-06-22 11:08:52,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:08:52,304 INFO ]: Start accepts. Automaton has 9 states. Word has length 33 [2018-06-22 11:08:52,304 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:52,305 INFO ]: With dead ends: 41 [2018-06-22 11:08:52,305 INFO ]: Without dead ends: 41 [2018-06-22 11:08:52,305 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:08:52,305 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:08:52,309 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-06-22 11:08:52,310 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:08:52,310 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 62 transitions. [2018-06-22 11:08:52,310 INFO ]: Start accepts. Automaton has 37 states and 62 transitions. Word has length 33 [2018-06-22 11:08:52,310 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:52,310 INFO ]: Abstraction has 37 states and 62 transitions. [2018-06-22 11:08:52,310 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:08:52,310 INFO ]: Start isEmpty. Operand 37 states and 62 transitions. [2018-06-22 11:08:52,311 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:08:52,311 INFO ]: Found error trace [2018-06-22 11:08:52,311 INFO ]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:52,312 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:52,312 INFO ]: Analyzing trace with hash -1384202024, now seen corresponding path program 5 times [2018-06-22 11:08:52,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:52,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:52,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:52,312 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:52,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:52,330 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:53,125 INFO ]: Checked inductivity of 73 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:08:53,125 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:53,125 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:53,132 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:08:53,251 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:08:53,251 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:53,254 INFO ]: Computing forward predicates... [2018-06-22 11:08:53,277 INFO ]: Checked inductivity of 73 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:08:53,297 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:53,297 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:08:53,297 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:08:53,298 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:08:53,298 INFO ]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:08:53,298 INFO ]: Start difference. First operand 37 states and 62 transitions. Second operand 10 states. [2018-06-22 11:08:53,583 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:53,583 INFO ]: Finished difference Result 43 states and 79 transitions. [2018-06-22 11:08:53,583 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:08:53,583 INFO ]: Start accepts. Automaton has 10 states. Word has length 33 [2018-06-22 11:08:53,583 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:53,584 INFO ]: With dead ends: 43 [2018-06-22 11:08:53,584 INFO ]: Without dead ends: 43 [2018-06-22 11:08:53,584 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:08:53,584 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:08:53,589 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-06-22 11:08:53,589 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:08:53,589 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 65 transitions. [2018-06-22 11:08:53,589 INFO ]: Start accepts. Automaton has 39 states and 65 transitions. Word has length 33 [2018-06-22 11:08:53,590 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:53,590 INFO ]: Abstraction has 39 states and 65 transitions. [2018-06-22 11:08:53,590 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:08:53,590 INFO ]: Start isEmpty. Operand 39 states and 65 transitions. [2018-06-22 11:08:53,591 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:08:53,591 INFO ]: Found error trace [2018-06-22 11:08:53,591 INFO ]: trace histogram [8, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:53,591 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:53,591 INFO ]: Analyzing trace with hash -1083289054, now seen corresponding path program 7 times [2018-06-22 11:08:53,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:53,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:53,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:53,591 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:53,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:53,610 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:53,690 INFO ]: Checked inductivity of 99 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 11:08:53,690 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:53,690 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:53,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:53,741 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:53,744 INFO ]: Computing forward predicates... [2018-06-22 11:08:53,780 INFO ]: Checked inductivity of 99 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 11:08:53,813 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:53,813 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:08:53,813 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:08:53,813 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:08:53,814 INFO ]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:08:53,814 INFO ]: Start difference. First operand 39 states and 65 transitions. Second operand 10 states. [2018-06-22 11:08:54,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:54,393 INFO ]: Finished difference Result 43 states and 78 transitions. [2018-06-22 11:08:54,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:08:54,393 INFO ]: Start accepts. Automaton has 10 states. Word has length 37 [2018-06-22 11:08:54,394 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:54,395 INFO ]: With dead ends: 43 [2018-06-22 11:08:54,395 INFO ]: Without dead ends: 43 [2018-06-22 11:08:54,395 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:08:54,395 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:08:54,399 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-06-22 11:08:54,400 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:08:54,405 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 64 transitions. [2018-06-22 11:08:54,405 INFO ]: Start accepts. Automaton has 39 states and 64 transitions. Word has length 37 [2018-06-22 11:08:54,405 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:54,405 INFO ]: Abstraction has 39 states and 64 transitions. [2018-06-22 11:08:54,405 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:08:54,405 INFO ]: Start isEmpty. Operand 39 states and 64 transitions. [2018-06-22 11:08:54,406 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:08:54,406 INFO ]: Found error trace [2018-06-22 11:08:54,406 INFO ]: trace histogram [8, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:54,406 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:54,407 INFO ]: Analyzing trace with hash -742348931, now seen corresponding path program 6 times [2018-06-22 11:08:54,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:54,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:54,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:54,407 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:54,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:54,422 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:54,519 INFO ]: Checked inductivity of 99 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:08:54,519 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:54,519 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:54,526 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:08:54,614 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:08:54,614 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:54,617 INFO ]: Computing forward predicates... [2018-06-22 11:08:54,644 INFO ]: Checked inductivity of 99 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:08:54,666 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:54,666 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:08:54,666 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:08:54,666 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:08:54,666 INFO ]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:08:54,666 INFO ]: Start difference. First operand 39 states and 64 transitions. Second operand 11 states. [2018-06-22 11:08:54,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:54,886 INFO ]: Finished difference Result 45 states and 81 transitions. [2018-06-22 11:08:54,888 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:08:54,888 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-22 11:08:54,888 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:54,889 INFO ]: With dead ends: 45 [2018-06-22 11:08:54,889 INFO ]: Without dead ends: 45 [2018-06-22 11:08:54,889 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:08:54,889 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:08:54,893 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-06-22 11:08:54,893 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:08:54,894 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 67 transitions. [2018-06-22 11:08:54,894 INFO ]: Start accepts. Automaton has 41 states and 67 transitions. Word has length 37 [2018-06-22 11:08:54,894 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:54,894 INFO ]: Abstraction has 41 states and 67 transitions. [2018-06-22 11:08:54,894 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:08:54,894 INFO ]: Start isEmpty. Operand 41 states and 67 transitions. [2018-06-22 11:08:54,895 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:08:54,895 INFO ]: Found error trace [2018-06-22 11:08:54,895 INFO ]: trace histogram [9, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:54,895 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:54,895 INFO ]: Analyzing trace with hash 848904199, now seen corresponding path program 8 times [2018-06-22 11:08:54,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:54,895 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:54,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:54,896 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:54,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:54,911 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:55,556 INFO ]: Checked inductivity of 129 backedges. 34 proven. 42 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-22 11:08:55,557 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:55,557 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:55,562 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:08:55,609 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:08:55,609 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:55,612 INFO ]: Computing forward predicates... [2018-06-22 11:08:55,630 INFO ]: Checked inductivity of 129 backedges. 34 proven. 42 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-22 11:08:55,652 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:55,652 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:08:55,652 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:08:55,652 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:08:55,652 INFO ]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:08:55,652 INFO ]: Start difference. First operand 41 states and 67 transitions. Second operand 11 states. [2018-06-22 11:08:55,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:55,809 INFO ]: Finished difference Result 45 states and 80 transitions. [2018-06-22 11:08:55,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:08:55,817 INFO ]: Start accepts. Automaton has 11 states. Word has length 41 [2018-06-22 11:08:55,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:55,818 INFO ]: With dead ends: 45 [2018-06-22 11:08:55,818 INFO ]: Without dead ends: 45 [2018-06-22 11:08:55,818 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:08:55,818 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:08:55,823 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-06-22 11:08:55,823 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:08:55,824 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2018-06-22 11:08:55,824 INFO ]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 41 [2018-06-22 11:08:55,824 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:55,824 INFO ]: Abstraction has 41 states and 66 transitions. [2018-06-22 11:08:55,824 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:08:55,824 INFO ]: Start isEmpty. Operand 41 states and 66 transitions. [2018-06-22 11:08:55,831 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:08:55,831 INFO ]: Found error trace [2018-06-22 11:08:55,831 INFO ]: trace histogram [9, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:55,831 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:55,831 INFO ]: Analyzing trace with hash -425541918, now seen corresponding path program 7 times [2018-06-22 11:08:55,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:55,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:55,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:55,832 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:55,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:55,858 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:56,115 INFO ]: Checked inductivity of 129 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:08:56,115 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:56,115 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:56,121 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:56,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:56,190 INFO ]: Computing forward predicates... [2018-06-22 11:08:56,219 INFO ]: Checked inductivity of 129 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:08:56,252 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:56,252 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 11:08:56,253 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:08:56,253 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:08:56,253 INFO ]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:08:56,253 INFO ]: Start difference. First operand 41 states and 66 transitions. Second operand 12 states. [2018-06-22 11:08:56,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:56,507 INFO ]: Finished difference Result 47 states and 83 transitions. [2018-06-22 11:08:56,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:08:56,508 INFO ]: Start accepts. Automaton has 12 states. Word has length 41 [2018-06-22 11:08:56,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:56,508 INFO ]: With dead ends: 47 [2018-06-22 11:08:56,508 INFO ]: Without dead ends: 47 [2018-06-22 11:08:56,509 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:08:56,509 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:08:56,513 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:08:56,513 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:08:56,513 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2018-06-22 11:08:56,513 INFO ]: Start accepts. Automaton has 43 states and 69 transitions. Word has length 41 [2018-06-22 11:08:56,514 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:56,514 INFO ]: Abstraction has 43 states and 69 transitions. [2018-06-22 11:08:56,514 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:08:56,514 INFO ]: Start isEmpty. Operand 43 states and 69 transitions. [2018-06-22 11:08:56,514 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:08:56,515 INFO ]: Found error trace [2018-06-22 11:08:56,515 INFO ]: trace histogram [10, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:56,515 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:56,515 INFO ]: Analyzing trace with hash 1103681287, now seen corresponding path program 8 times [2018-06-22 11:08:56,515 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:56,515 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:56,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:56,516 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:56,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:56,535 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:56,697 INFO ]: Checked inductivity of 163 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-22 11:08:56,697 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:56,697 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:56,706 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:08:56,766 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:08:56,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:56,770 INFO ]: Computing forward predicates... [2018-06-22 11:08:56,825 INFO ]: Checked inductivity of 163 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-22 11:08:56,859 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:56,859 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 11:08:56,860 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:08:56,860 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:08:56,860 INFO ]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:08:56,860 INFO ]: Start difference. First operand 43 states and 69 transitions. Second operand 13 states. [2018-06-22 11:08:57,202 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:57,202 INFO ]: Finished difference Result 51 states and 89 transitions. [2018-06-22 11:08:57,203 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:08:57,203 INFO ]: Start accepts. Automaton has 13 states. Word has length 45 [2018-06-22 11:08:57,203 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:57,203 INFO ]: With dead ends: 51 [2018-06-22 11:08:57,203 INFO ]: Without dead ends: 51 [2018-06-22 11:08:57,204 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:08:57,204 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:08:57,208 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 45. [2018-06-22 11:08:57,208 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:08:57,208 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2018-06-22 11:08:57,209 INFO ]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 45 [2018-06-22 11:08:57,209 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:57,209 INFO ]: Abstraction has 45 states and 72 transitions. [2018-06-22 11:08:57,209 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:08:57,209 INFO ]: Start isEmpty. Operand 45 states and 72 transitions. [2018-06-22 11:08:57,210 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:08:57,210 INFO ]: Found error trace [2018-06-22 11:08:57,210 INFO ]: trace histogram [10, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:57,210 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:57,210 INFO ]: Analyzing trace with hash 1488514732, now seen corresponding path program 9 times [2018-06-22 11:08:57,210 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:57,210 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:57,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:57,211 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:57,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:57,226 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:57,356 INFO ]: Checked inductivity of 163 backedges. 39 proven. 56 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:08:57,357 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:57,357 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:57,362 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:08:57,437 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 11:08:57,437 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:57,440 INFO ]: Computing forward predicates... [2018-06-22 11:08:57,463 INFO ]: Checked inductivity of 163 backedges. 39 proven. 56 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:08:57,498 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:57,498 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 11:08:57,498 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:08:57,498 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:08:57,498 INFO ]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:08:57,499 INFO ]: Start difference. First operand 45 states and 72 transitions. Second operand 12 states. [2018-06-22 11:08:57,733 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:57,733 INFO ]: Finished difference Result 49 states and 85 transitions. [2018-06-22 11:08:57,734 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:08:57,734 INFO ]: Start accepts. Automaton has 12 states. Word has length 45 [2018-06-22 11:08:57,734 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:57,734 INFO ]: With dead ends: 49 [2018-06-22 11:08:57,734 INFO ]: Without dead ends: 49 [2018-06-22 11:08:57,735 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:08:57,735 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:08:57,739 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-06-22 11:08:57,739 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:08:57,739 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 71 transitions. [2018-06-22 11:08:57,739 INFO ]: Start accepts. Automaton has 45 states and 71 transitions. Word has length 45 [2018-06-22 11:08:57,741 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:57,741 INFO ]: Abstraction has 45 states and 71 transitions. [2018-06-22 11:08:57,741 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:08:57,741 INFO ]: Start isEmpty. Operand 45 states and 71 transitions. [2018-06-22 11:08:57,741 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:08:57,741 INFO ]: Found error trace [2018-06-22 11:08:57,742 INFO ]: trace histogram [11, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:57,742 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:57,742 INFO ]: Analyzing trace with hash -1361236463, now seen corresponding path program 10 times [2018-06-22 11:08:57,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:57,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:57,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:57,742 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:57,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:57,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:58,659 INFO ]: Checked inductivity of 201 backedges. 44 proven. 72 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 11:08:58,659 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:58,659 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 11:08:58,666 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:08:58,726 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:08:58,726 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:58,729 INFO ]: Computing forward predicates... [2018-06-22 11:08:58,742 INFO ]: Checked inductivity of 201 backedges. 44 proven. 72 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 11:08:58,762 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:58,762 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 11:08:58,762 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:08:58,762 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:08:58,762 INFO ]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:08:58,762 INFO ]: Start difference. First operand 45 states and 71 transitions. Second operand 13 states. [2018-06-22 11:08:58,937 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:58,937 INFO ]: Finished difference Result 49 states and 84 transitions. [2018-06-22 11:08:58,937 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:08:58,937 INFO ]: Start accepts. Automaton has 13 states. Word has length 49 [2018-06-22 11:08:58,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:58,938 INFO ]: With dead ends: 49 [2018-06-22 11:08:58,938 INFO ]: Without dead ends: 49 [2018-06-22 11:08:58,938 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:08:58,938 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:08:58,942 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-06-22 11:08:58,942 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:08:58,943 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 70 transitions. [2018-06-22 11:08:58,943 INFO ]: Start accepts. Automaton has 45 states and 70 transitions. Word has length 49 [2018-06-22 11:08:58,943 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:58,943 INFO ]: Abstraction has 45 states and 70 transitions. [2018-06-22 11:08:58,943 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:08:58,943 INFO ]: Start isEmpty. Operand 45 states and 70 transitions. [2018-06-22 11:08:58,944 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:08:58,944 INFO ]: Found error trace [2018-06-22 11:08:58,944 INFO ]: trace histogram [11, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:58,944 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:58,945 INFO ]: Analyzing trace with hash -1465729044, now seen corresponding path program 9 times [2018-06-22 11:08:58,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:58,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:58,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:58,946 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:58,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:58,965 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:59,131 INFO ]: Checked inductivity of 201 backedges. 20 proven. 90 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:08:59,131 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:59,131 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:59,141 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:08:59,311 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 11:08:59,311 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:59,316 INFO ]: Computing forward predicates... [2018-06-22 11:08:59,640 INFO ]: Checked inductivity of 201 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:08:59,660 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:59,661 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2018-06-22 11:08:59,661 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:08:59,661 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:08:59,661 INFO ]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:08:59,661 INFO ]: Start difference. First operand 45 states and 70 transitions. Second operand 28 states. [2018-06-22 11:09:00,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:00,334 INFO ]: Finished difference Result 51 states and 87 transitions. [2018-06-22 11:09:00,334 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:09:00,334 INFO ]: Start accepts. Automaton has 28 states. Word has length 49 [2018-06-22 11:09:00,334 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:00,335 INFO ]: With dead ends: 51 [2018-06-22 11:09:00,335 INFO ]: Without dead ends: 51 [2018-06-22 11:09:00,336 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:09:00,336 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:09:00,340 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-06-22 11:09:00,340 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:09:00,341 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-06-22 11:09:00,341 INFO ]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 49 [2018-06-22 11:09:00,341 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:00,341 INFO ]: Abstraction has 47 states and 73 transitions. [2018-06-22 11:09:00,341 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:09:00,341 INFO ]: Start isEmpty. Operand 47 states and 73 transitions. [2018-06-22 11:09:00,342 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:09:00,342 INFO ]: Found error trace [2018-06-22 11:09:00,342 INFO ]: trace histogram [12, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:00,342 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:00,342 INFO ]: Analyzing trace with hash -958280138, now seen corresponding path program 11 times [2018-06-22 11:09:00,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:00,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:00,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:00,343 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:00,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:00,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:00,563 INFO ]: Checked inductivity of 243 backedges. 49 proven. 90 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-06-22 11:09:00,563 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:00,563 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:09:00,569 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:09:00,657 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 11:09:00,657 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:00,660 INFO ]: Computing forward predicates... [2018-06-22 11:09:00,675 INFO ]: Checked inductivity of 243 backedges. 49 proven. 90 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-06-22 11:09:00,697 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:00,697 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-22 11:09:00,697 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:09:00,698 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:09:00,698 INFO ]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:09:00,698 INFO ]: Start difference. First operand 47 states and 73 transitions. Second operand 14 states. [2018-06-22 11:09:01,027 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:01,027 INFO ]: Finished difference Result 51 states and 86 transitions. [2018-06-22 11:09:01,028 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:09:01,028 INFO ]: Start accepts. Automaton has 14 states. Word has length 53 [2018-06-22 11:09:01,028 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:01,028 INFO ]: With dead ends: 51 [2018-06-22 11:09:01,028 INFO ]: Without dead ends: 51 [2018-06-22 11:09:01,029 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:09:01,029 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:09:01,032 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-06-22 11:09:01,032 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:09:01,033 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 72 transitions. [2018-06-22 11:09:01,033 INFO ]: Start accepts. Automaton has 47 states and 72 transitions. Word has length 53 [2018-06-22 11:09:01,033 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:01,033 INFO ]: Abstraction has 47 states and 72 transitions. [2018-06-22 11:09:01,033 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:09:01,033 INFO ]: Start isEmpty. Operand 47 states and 72 transitions. [2018-06-22 11:09:01,034 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:09:01,034 INFO ]: Found error trace [2018-06-22 11:09:01,034 INFO ]: trace histogram [12, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:01,034 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:01,034 INFO ]: Analyzing trace with hash -1016313455, now seen corresponding path program 10 times [2018-06-22 11:09:01,034 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:01,034 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:01,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:01,036 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:01,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:01,059 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:01,321 INFO ]: Checked inductivity of 243 backedges. 22 proven. 110 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-22 11:09:01,321 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:01,321 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:09:01,327 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:09:01,385 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:09:01,385 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:01,390 INFO ]: Computing forward predicates... [2018-06-22 11:09:01,773 INFO ]: Checked inductivity of 243 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-22 11:09:01,792 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:01,792 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-06-22 11:09:01,792 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:09:01,792 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:09:01,793 INFO ]: CoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:09:01,793 INFO ]: Start difference. First operand 47 states and 72 transitions. Second operand 29 states. [2018-06-22 11:09:02,819 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:02,819 INFO ]: Finished difference Result 70 states and 119 transitions. [2018-06-22 11:09:02,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:09:02,867 INFO ]: Start accepts. Automaton has 29 states. Word has length 53 [2018-06-22 11:09:02,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:02,868 INFO ]: With dead ends: 70 [2018-06-22 11:09:02,868 INFO ]: Without dead ends: 66 [2018-06-22 11:09:02,869 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=421, Invalid=1385, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:09:02,869 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:09:02,879 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-06-22 11:09:02,880 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:09:02,880 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 108 transitions. [2018-06-22 11:09:02,880 INFO ]: Start accepts. Automaton has 62 states and 108 transitions. Word has length 53 [2018-06-22 11:09:02,881 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:02,881 INFO ]: Abstraction has 62 states and 108 transitions. [2018-06-22 11:09:02,881 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:09:02,881 INFO ]: Start isEmpty. Operand 62 states and 108 transitions. [2018-06-22 11:09:02,881 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:09:02,882 INFO ]: Found error trace [2018-06-22 11:09:02,882 INFO ]: trace histogram [13, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:02,882 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:02,882 INFO ]: Analyzing trace with hash -2073125093, now seen corresponding path program 12 times [2018-06-22 11:09:02,882 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:02,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:02,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:02,882 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:02,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:02,921 INFO ]: Conjunction of SSA is sat [2018-06-22 11:09:02,928 INFO ]: Counterexample might be feasible [2018-06-22 11:09:02,950 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:09:02 BoogieIcfgContainer [2018-06-22 11:09:02,951 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:09:02,960 INFO ]: Toolchain (without parser) took 22490.89 ms. Allocated memory was 309.3 MB in the beginning and 460.8 MB in the end (delta: 151.5 MB). Free memory was 261.7 MB in the beginning and 315.8 MB in the end (delta: -54.1 MB). Peak memory consumption was 97.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:09:02,961 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:09:02,962 INFO ]: ChcToBoogie took 49.46 ms. Allocated memory is still 309.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 11:09:02,962 INFO ]: Boogie Preprocessor took 46.17 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 258.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:09:02,962 INFO ]: RCFGBuilder took 321.53 ms. Allocated memory is still 309.3 MB. Free memory was 258.7 MB in the beginning and 247.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:09:02,963 INFO ]: TraceAbstraction took 22054.32 ms. Allocated memory was 309.3 MB in the beginning and 460.8 MB in the end (delta: 151.5 MB). Free memory was 247.7 MB in the beginning and 315.9 MB in the end (delta: -68.2 MB). Peak memory consumption was 83.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:09:02,965 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 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 49.46 ms. Allocated memory is still 309.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. * Boogie Preprocessor took 46.17 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 258.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 321.53 ms. Allocated memory is still 309.3 MB. Free memory was 258.7 MB in the beginning and 247.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 22054.32 ms. Allocated memory was 309.3 MB in the beginning and 460.8 MB in the end (delta: 151.5 MB). Free memory was 247.7 MB in the beginning and 315.9 MB in the end (delta: -68.2 MB). Peak memory consumption was 83.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call False(); [L0] assume (((!(hbv_False_7_Int - hbv_False_8_Int + -1 >= 0) && !(hbv_False_9_Int == hbv_False_10_Int)) && !(hbv_False_5_Int - hbv_False_6_Int + -1 >= 0)) && hbv_False_3_Int == hbv_False_4_Int) && hbv_False_1_Int == hbv_False_2_Int; [L0] CALL call INV1(hbv_False_7_Int, hbv_False_11_Int, hbv_False_8_Int, hbv_False_12_Int, hbv_False_9_Int, hbv_False_5_Int, hbv_False_13_Int, hbv_False_6_Int, hbv_False_14_Int, hbv_False_10_Int, hbv_False_3_Int, hbv_False_1_Int, hbv_False_4_Int, hbv_False_2_Int); [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && -1 * hhv_INV1_8_Int == -10) && hhv_INV1_10_Int == hhv_INV1_12_Int) && hbv_INV1_3_Int + hbv_INV1_4_Int == hhv_INV1_9_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && hbv_INV1_5_Int + -10 == 0) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_4_Int, hbv_INV1_3_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] assume (((((((((hbv_INV1_5_Int + 1 == hhv_INV1_7_Int && hhv_INV1_10_Int == hhv_INV1_12_Int) && hhv_INV1_5_Int - hbv_INV1_5_Int + -1 >= 0) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_5_Int + -10 == 0)) && hhv_INV1_11_Int == hhv_INV1_13_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_4_Int + hbv_INV1_3_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] assume ((((((((((hhv_INV1_10_Int == hhv_INV1_0_Int && -1 * hhv_INV1_2_Int == 0) && hhv_INV1_12_Int == hhv_INV1_5_Int) && -1 * hhv_INV1_7_Int == 0) && -1 * hhv_INV1_3_Int == 0) && hhv_INV1_8_Int == hhv_INV1_6_Int) && -1 * hhv_INV1_9_Int == 0) && hhv_INV1_0_Int == hhv_INV1_5_Int) && hhv_INV1_1_Int == hhv_INV1_6_Int) && -1 * hhv_INV1_4_Int == 0) && hhv_INV1_13_Int == hhv_INV1_6_Int) && hhv_INV1_11_Int == hhv_INV1_1_Int; [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_4_Int, hbv_INV1_3_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_5_Int, hbv_INV1_3_Int, hbv_INV1_4_Int, hhv_INV1_10_Int, hhv_INV1_11_Int, hhv_INV1_12_Int, hhv_INV1_13_Int); [L0] RET call INV1(hbv_False_7_Int, hbv_False_11_Int, hbv_False_8_Int, hbv_False_12_Int, hbv_False_9_Int, hbv_False_5_Int, hbv_False_13_Int, hbv_False_6_Int, hbv_False_14_Int, hbv_False_10_Int, hbv_False_3_Int, hbv_False_1_Int, hbv_False_4_Int, hbv_False_2_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 17 locations, 1 error locations. UNSAFE Result, 21.9s OverallTime, 31 OverallIterations, 13 TraceHistogramMax, 10.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 624 SDtfs, 233 SDslu, 1804 SDs, 0 SdLazy, 3599 SolverSat, 377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1184 GetRequests, 818 SyntacticMatches, 1 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 112 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1661 NumberOfCodeBlocks, 1651 NumberOfCodeBlocksAsserted, 115 NumberOfCheckSat, 1552 ConstructedInterpolants, 2 QuantifiedInterpolants, 155684 SizeOfPredicates, 150 NumberOfNonLiveVariables, 8398 ConjunctsInSsa, 428 ConjunctsInUnsatCore, 52 InterpolantComputations, 8 PerfectInterpolantSequences, 2627/4236 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003d-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-09-02-975.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003d-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-09-02-975.csv Received shutdown request...