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/llreve/simple-loop_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:04:00,472 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:04:00,474 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:04:00,486 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:04:00,486 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:04:00,487 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:04:00,488 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:04:00,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:04:00,492 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:04:00,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:04:00,493 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:04:00,494 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:04:00,494 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:04:00,496 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:04:00,496 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:04:00,497 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:04:00,499 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:04:00,501 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:04:00,503 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:04:00,504 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:04:00,505 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:04:00,508 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:04:00,508 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:04:00,508 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:04:00,509 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:04:00,510 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:04:00,511 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:04:00,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:04:00,513 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:04:00,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:04:00,514 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:04:00,515 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:04:00,515 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:04:00,516 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:04:00,517 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:04:00,517 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:04:00,543 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:04:00,543 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:04:00,544 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:04:00,544 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:04:00,545 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:04:00,545 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:04:00,545 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:04:00,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:04:00,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:04:00,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:04:00,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:04:00,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:04:00,550 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:04:00,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:04:00,551 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:04:00,551 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:04:00,551 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:04:00,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:04:00,551 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:04:00,554 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:04:00,555 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:04:00,603 INFO ]: Repository-Root is: /tmp [2018-06-22 11:04:00,619 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:04:00,624 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:04:00,626 INFO ]: Initializing SmtParser... [2018-06-22 11:04:00,626 INFO ]: SmtParser initialized [2018-06-22 11:04:00,627 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/simple-loop_merged_safe.c-1.smt2 [2018-06-22 11:04:00,628 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:04:00,724 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/simple-loop_merged_safe.c-1.smt2 unknown [2018-06-22 11:04:00,860 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/simple-loop_merged_safe.c-1.smt2 [2018-06-22 11:04:00,866 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:04:00,875 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:04:00,876 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:04:00,876 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:04:00,876 INFO ]: ChcToBoogie initialized [2018-06-22 11:04:00,879 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:04:00" (1/1) ... [2018-06-22 11:04:00,924 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:00 Unit [2018-06-22 11:04:00,924 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:04:00,926 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:04:00,926 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:04:00,926 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:04:00,947 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:00" (1/1) ... [2018-06-22 11:04:00,947 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:00" (1/1) ... [2018-06-22 11:04:00,955 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:00" (1/1) ... [2018-06-22 11:04:00,955 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:00" (1/1) ... [2018-06-22 11:04:00,957 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:00" (1/1) ... [2018-06-22 11:04:00,959 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:00" (1/1) ... [2018-06-22 11:04:00,959 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:00" (1/1) ... [2018-06-22 11:04:00,961 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:04:00,962 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:04:00,962 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:04:00,962 INFO ]: RCFGBuilder initialized [2018-06-22 11:04:00,963 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:00" (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:04:00,979 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:04:00,979 INFO ]: Found specification of procedure False [2018-06-22 11:04:00,979 INFO ]: Found implementation of procedure False [2018-06-22 11:04:00,979 INFO ]: Specification and implementation of procedure inv_main17 given in one single declaration [2018-06-22 11:04:00,979 INFO ]: Found specification of procedure inv_main17 [2018-06-22 11:04:00,979 INFO ]: Found implementation of procedure inv_main17 [2018-06-22 11:04:00,979 INFO ]: Specification and implementation of procedure inv_main14 given in one single declaration [2018-06-22 11:04:00,979 INFO ]: Found specification of procedure inv_main14 [2018-06-22 11:04:00,979 INFO ]: Found implementation of procedure inv_main14 [2018-06-22 11:04:00,979 INFO ]: Specification and implementation of procedure inv_main7 given in one single declaration [2018-06-22 11:04:00,979 INFO ]: Found specification of procedure inv_main7 [2018-06-22 11:04:00,979 INFO ]: Found implementation of procedure inv_main7 [2018-06-22 11:04:00,979 INFO ]: Specification and implementation of procedure inv_main3 given in one single declaration [2018-06-22 11:04:00,979 INFO ]: Found specification of procedure inv_main3 [2018-06-22 11:04:00,979 INFO ]: Found implementation of procedure inv_main3 [2018-06-22 11:04:00,979 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:04:00,979 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:04:00,979 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:04:01,259 INFO ]: Using library mode [2018-06-22 11:04:01,260 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:04:01 BoogieIcfgContainer [2018-06-22 11:04:01,260 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:04:01,262 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:04:01,262 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:04:01,265 INFO ]: TraceAbstraction initialized [2018-06-22 11:04:01,265 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:04:00" (1/3) ... [2018-06-22 11:04:01,266 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d2ef2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:04:01, skipping insertion in model container [2018-06-22 11:04:01,266 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:00" (2/3) ... [2018-06-22 11:04:01,266 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d2ef2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:04:01, skipping insertion in model container [2018-06-22 11:04:01,266 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:04:01" (3/3) ... [2018-06-22 11:04:01,268 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:04:01,278 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:04:01,290 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:04:01,342 INFO ]: Using default assertion order modulation [2018-06-22 11:04:01,343 INFO ]: Interprodecural is true [2018-06-22 11:04:01,343 INFO ]: Hoare is false [2018-06-22 11:04:01,343 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:04:01,343 INFO ]: Backedges is TWOTRACK [2018-06-22 11:04:01,343 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:04:01,343 INFO ]: Difference is false [2018-06-22 11:04:01,343 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:04:01,343 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:04:01,362 INFO ]: Start isEmpty. Operand 26 states. [2018-06-22 11:04:01,381 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:04:01,381 INFO ]: Found error trace [2018-06-22 11:04:01,382 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:01,383 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:01,388 INFO ]: Analyzing trace with hash -1720518214, now seen corresponding path program 1 times [2018-06-22 11:04:01,389 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:01,390 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:01,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:01,424 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:01,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:01,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:01,605 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:04:01,608 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:04:01,608 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:04:01,610 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:04:01,620 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:04:01,621 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:04:01,622 INFO ]: Start difference. First operand 26 states. Second operand 4 states. [2018-06-22 11:04:01,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:01,717 INFO ]: Finished difference Result 26 states and 29 transitions. [2018-06-22 11:04:01,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:04:01,719 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:04:01,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:01,730 INFO ]: With dead ends: 26 [2018-06-22 11:04:01,730 INFO ]: Without dead ends: 26 [2018-06-22 11:04:01,732 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:04:01,745 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:04:01,766 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 11:04:01,767 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:04:01,768 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-06-22 11:04:01,769 INFO ]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2018-06-22 11:04:01,770 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:01,770 INFO ]: Abstraction has 26 states and 29 transitions. [2018-06-22 11:04:01,770 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:04:01,770 INFO ]: Start isEmpty. Operand 26 states and 29 transitions. [2018-06-22 11:04:01,772 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:04:01,772 INFO ]: Found error trace [2018-06-22 11:04:01,772 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:01,772 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:01,772 INFO ]: Analyzing trace with hash 689637052, now seen corresponding path program 1 times [2018-06-22 11:04:01,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:01,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:01,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:01,773 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:01,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:01,782 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:01,940 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:04:01,940 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:04:01,940 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:04:01,942 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:04:01,942 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:04:01,942 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:04:01,942 INFO ]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2018-06-22 11:04:02,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:02,005 INFO ]: Finished difference Result 28 states and 31 transitions. [2018-06-22 11:04:02,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:04:02,005 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:04:02,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:02,006 INFO ]: With dead ends: 28 [2018-06-22 11:04:02,006 INFO ]: Without dead ends: 28 [2018-06-22 11:04:02,007 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:04:02,007 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:04:02,012 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 11:04:02,012 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:04:02,013 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-06-22 11:04:02,013 INFO ]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2018-06-22 11:04:02,014 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:02,014 INFO ]: Abstraction has 28 states and 31 transitions. [2018-06-22 11:04:02,014 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:04:02,014 INFO ]: Start isEmpty. Operand 28 states and 31 transitions. [2018-06-22 11:04:02,015 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:04:02,015 INFO ]: Found error trace [2018-06-22 11:04:02,015 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:02,015 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:02,015 INFO ]: Analyzing trace with hash 1848918238, now seen corresponding path program 1 times [2018-06-22 11:04:02,015 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:02,015 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:02,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:02,016 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:02,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:02,034 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:02,130 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:04:02,130 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:02,130 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:04:02,138 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:02,181 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:02,193 INFO ]: Computing forward predicates... [2018-06-22 11:04:02,346 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:04:02,367 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:02,367 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:04:02,368 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:04:02,368 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:04:02,368 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:04:02,368 INFO ]: Start difference. First operand 28 states and 31 transitions. Second operand 7 states. [2018-06-22 11:04:02,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:02,539 INFO ]: Finished difference Result 30 states and 33 transitions. [2018-06-22 11:04:02,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:04:02,540 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 11:04:02,540 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:02,541 INFO ]: With dead ends: 30 [2018-06-22 11:04:02,541 INFO ]: Without dead ends: 30 [2018-06-22 11:04:02,542 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 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:04:02,542 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:04:02,547 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 11:04:02,547 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:04:02,548 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-06-22 11:04:02,548 INFO ]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 29 [2018-06-22 11:04:02,548 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:02,548 INFO ]: Abstraction has 30 states and 33 transitions. [2018-06-22 11:04:02,548 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:04:02,548 INFO ]: Start isEmpty. Operand 30 states and 33 transitions. [2018-06-22 11:04:02,549 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:04:02,549 INFO ]: Found error trace [2018-06-22 11:04:02,549 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:02,549 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:02,550 INFO ]: Analyzing trace with hash 900491744, now seen corresponding path program 2 times [2018-06-22 11:04:02,550 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:02,550 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:02,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:02,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:02,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:02,562 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:02,762 INFO ]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:04:02,762 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:02,762 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:04:02,774 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:04:02,828 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:04:02,828 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:02,831 INFO ]: Computing forward predicates... [2018-06-22 11:04:02,874 INFO ]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:04:02,900 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:02,900 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-06-22 11:04:02,900 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:04:02,900 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:04:02,900 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:04:02,901 INFO ]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2018-06-22 11:04:02,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:02,992 INFO ]: Finished difference Result 32 states and 35 transitions. [2018-06-22 11:04:02,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:04:02,992 INFO ]: Start accepts. Automaton has 8 states. Word has length 33 [2018-06-22 11:04:02,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:02,993 INFO ]: With dead ends: 32 [2018-06-22 11:04:02,993 INFO ]: Without dead ends: 32 [2018-06-22 11:04:02,994 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:04:02,994 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:04:02,999 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 11:04:02,999 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:04:03,000 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-22 11:04:03,000 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 33 [2018-06-22 11:04:03,001 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:03,001 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-22 11:04:03,001 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:04:03,001 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-22 11:04:03,002 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:04:03,002 INFO ]: Found error trace [2018-06-22 11:04:03,002 INFO ]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:03,002 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:03,002 INFO ]: Analyzing trace with hash 1231234274, now seen corresponding path program 3 times [2018-06-22 11:04:03,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:03,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:03,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:03,003 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:03,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:03,017 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:03,112 INFO ]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:04:03,113 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:03,113 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:04:03,130 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:04:03,167 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 11:04:03,167 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:03,169 INFO ]: Computing forward predicates... [2018-06-22 11:04:03,250 INFO ]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:04:03,282 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:03,282 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:04:03,283 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:04:03,283 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:04:03,283 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:04:03,283 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 7 states. [2018-06-22 11:04:03,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:03,554 INFO ]: Finished difference Result 34 states and 37 transitions. [2018-06-22 11:04:03,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:04:03,555 INFO ]: Start accepts. Automaton has 7 states. Word has length 37 [2018-06-22 11:04:03,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:03,556 INFO ]: With dead ends: 34 [2018-06-22 11:04:03,556 INFO ]: Without dead ends: 34 [2018-06-22 11:04:03,557 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 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:04:03,557 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:04:03,561 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 11:04:03,561 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:04:03,562 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-06-22 11:04:03,562 INFO ]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 37 [2018-06-22 11:04:03,562 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:03,562 INFO ]: Abstraction has 34 states and 37 transitions. [2018-06-22 11:04:03,562 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:04:03,562 INFO ]: Start isEmpty. Operand 34 states and 37 transitions. [2018-06-22 11:04:03,563 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:04:03,563 INFO ]: Found error trace [2018-06-22 11:04:03,564 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:03,564 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:03,564 INFO ]: Analyzing trace with hash 1684859524, now seen corresponding path program 4 times [2018-06-22 11:04:03,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:03,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:03,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:03,565 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:03,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:03,576 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:03,721 INFO ]: Checked inductivity of 31 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:04:03,722 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:03,722 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:04:03,737 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:04:03,767 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:04:03,768 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:03,770 INFO ]: Computing forward predicates... [2018-06-22 11:04:03,792 INFO ]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:04:03,811 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:03,811 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-06-22 11:04:03,811 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:04:03,811 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:04:03,811 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:04:03,812 INFO ]: Start difference. First operand 34 states and 37 transitions. Second operand 9 states. [2018-06-22 11:04:03,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:03,936 INFO ]: Finished difference Result 36 states and 39 transitions. [2018-06-22 11:04:03,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:04:03,936 INFO ]: Start accepts. Automaton has 9 states. Word has length 41 [2018-06-22 11:04:03,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:03,937 INFO ]: With dead ends: 36 [2018-06-22 11:04:03,937 INFO ]: Without dead ends: 36 [2018-06-22 11:04:03,938 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:04:03,938 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:04:03,942 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 11:04:03,942 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:04:03,943 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-22 11:04:03,943 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 41 [2018-06-22 11:04:03,943 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:03,943 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-22 11:04:03,943 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:04:03,943 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-22 11:04:03,944 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:04:03,944 INFO ]: Found error trace [2018-06-22 11:04:03,944 INFO ]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:03,945 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:03,946 INFO ]: Analyzing trace with hash 1320411526, now seen corresponding path program 5 times [2018-06-22 11:04:03,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:03,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:03,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:03,947 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:03,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:03,957 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:04,029 INFO ]: Checked inductivity of 46 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:04:04,029 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:04,029 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:04:04,034 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:04:04,088 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 11:04:04,088 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:04,091 INFO ]: Computing forward predicates... [2018-06-22 11:04:04,127 INFO ]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 11:04:04,157 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:04,157 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2018-06-22 11:04:04,157 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:04:04,157 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:04:04,157 INFO ]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:04:04,158 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 10 states. [2018-06-22 11:04:04,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:04,439 INFO ]: Finished difference Result 38 states and 41 transitions. [2018-06-22 11:04:04,439 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:04:04,439 INFO ]: Start accepts. Automaton has 10 states. Word has length 45 [2018-06-22 11:04:04,439 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:04,440 INFO ]: With dead ends: 38 [2018-06-22 11:04:04,440 INFO ]: Without dead ends: 38 [2018-06-22 11:04:04,440 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:04:04,440 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:04:04,445 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 11:04:04,445 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:04:04,446 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-22 11:04:04,446 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 45 [2018-06-22 11:04:04,446 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:04,446 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-22 11:04:04,446 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:04:04,446 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-22 11:04:04,447 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:04:04,447 INFO ]: Found error trace [2018-06-22 11:04:04,447 INFO ]: trace histogram [6, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:04,448 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:04,448 INFO ]: Analyzing trace with hash 1533160072, now seen corresponding path program 6 times [2018-06-22 11:04:04,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:04,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:04,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:04,448 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:04,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:04,460 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:04,583 INFO ]: Checked inductivity of 65 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:04:04,583 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:04,583 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:04:04,590 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:04:04,627 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:04:04,627 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:04,630 INFO ]: Computing forward predicates... [2018-06-22 11:04:04,720 INFO ]: Checked inductivity of 65 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-06-22 11:04:04,739 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:04,739 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-06-22 11:04:04,739 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:04:04,739 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:04:04,740 INFO ]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:04:04,740 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 16 states. [2018-06-22 11:04:05,125 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:05,125 INFO ]: Finished difference Result 42 states and 45 transitions. [2018-06-22 11:04:05,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:04:05,126 INFO ]: Start accepts. Automaton has 16 states. Word has length 49 [2018-06-22 11:04:05,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:05,127 INFO ]: With dead ends: 42 [2018-06-22 11:04:05,127 INFO ]: Without dead ends: 42 [2018-06-22 11:04:05,128 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:04:05,128 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:04:05,132 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 11:04:05,132 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:04:05,133 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-06-22 11:04:05,133 INFO ]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 49 [2018-06-22 11:04:05,133 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:05,133 INFO ]: Abstraction has 42 states and 45 transitions. [2018-06-22 11:04:05,133 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:04:05,133 INFO ]: Start isEmpty. Operand 42 states and 45 transitions. [2018-06-22 11:04:05,135 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:04:05,135 INFO ]: Found error trace [2018-06-22 11:04:05,135 INFO ]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:05,135 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:05,135 INFO ]: Analyzing trace with hash -662978388, now seen corresponding path program 7 times [2018-06-22 11:04:05,135 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:05,135 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:05,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:05,136 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:05,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:05,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:05,246 INFO ]: Checked inductivity of 99 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 11:04:05,246 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:05,246 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:04:05,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:05,273 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:05,277 INFO ]: Computing forward predicates... [2018-06-22 11:04:05,386 INFO ]: Checked inductivity of 99 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:04:05,406 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:05,406 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-06-22 11:04:05,407 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:04:05,407 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:04:05,407 INFO ]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:04:05,407 INFO ]: Start difference. First operand 42 states and 45 transitions. Second operand 18 states. [2018-06-22 11:04:05,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:05,644 INFO ]: Finished difference Result 46 states and 49 transitions. [2018-06-22 11:04:05,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:04:05,645 INFO ]: Start accepts. Automaton has 18 states. Word has length 57 [2018-06-22 11:04:05,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:05,646 INFO ]: With dead ends: 46 [2018-06-22 11:04:05,646 INFO ]: Without dead ends: 46 [2018-06-22 11:04:05,647 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:04:05,647 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:04:05,652 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-06-22 11:04:05,652 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:04:05,653 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-06-22 11:04:05,653 INFO ]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 57 [2018-06-22 11:04:05,653 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:05,653 INFO ]: Abstraction has 46 states and 49 transitions. [2018-06-22 11:04:05,654 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:04:05,654 INFO ]: Start isEmpty. Operand 46 states and 49 transitions. [2018-06-22 11:04:05,655 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:04:05,655 INFO ]: Found error trace [2018-06-22 11:04:05,656 INFO ]: trace histogram [8, 7, 7, 7, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:05,656 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:05,656 INFO ]: Analyzing trace with hash -320392112, now seen corresponding path program 8 times [2018-06-22 11:04:05,656 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:05,656 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:05,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:05,657 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:05,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:05,673 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:05,807 INFO ]: Checked inductivity of 141 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:04:05,807 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:05,807 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:04:05,816 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:04:05,840 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:04:05,840 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:05,844 INFO ]: Computing forward predicates... [2018-06-22 11:04:05,888 INFO ]: Checked inductivity of 141 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 11:04:05,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:05,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2018-06-22 11:04:05,910 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:04:05,910 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:04:05,910 INFO ]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:04:05,910 INFO ]: Start difference. First operand 46 states and 49 transitions. Second operand 13 states. [2018-06-22 11:04:06,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:06,030 INFO ]: Finished difference Result 48 states and 51 transitions. [2018-06-22 11:04:06,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:04:06,030 INFO ]: Start accepts. Automaton has 13 states. Word has length 65 [2018-06-22 11:04:06,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:06,031 INFO ]: With dead ends: 48 [2018-06-22 11:04:06,031 INFO ]: Without dead ends: 48 [2018-06-22 11:04:06,032 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:04:06,032 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:04:06,037 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-22 11:04:06,037 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:04:06,039 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-06-22 11:04:06,039 INFO ]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 65 [2018-06-22 11:04:06,040 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:06,040 INFO ]: Abstraction has 48 states and 51 transitions. [2018-06-22 11:04:06,040 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:04:06,040 INFO ]: Start isEmpty. Operand 48 states and 51 transitions. [2018-06-22 11:04:06,041 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:04:06,041 INFO ]: Found error trace [2018-06-22 11:04:06,041 INFO ]: trace histogram [9, 8, 8, 8, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:06,041 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:06,041 INFO ]: Analyzing trace with hash -1209112750, now seen corresponding path program 9 times [2018-06-22 11:04:06,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:06,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:06,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:06,042 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:06,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:06,056 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:06,584 INFO ]: Checked inductivity of 172 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-06-22 11:04:06,584 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:06,584 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:04:06,595 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:04:06,647 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:04:06,647 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:06,650 INFO ]: Computing forward predicates... [2018-06-22 11:04:06,747 INFO ]: Checked inductivity of 172 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-06-22 11:04:06,767 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:06,767 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2018-06-22 11:04:06,768 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:04:06,768 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:04:06,768 INFO ]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:04:06,768 INFO ]: Start difference. First operand 48 states and 51 transitions. Second operand 21 states. [2018-06-22 11:04:07,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:07,419 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-22 11:04:07,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:04:07,419 INFO ]: Start accepts. Automaton has 21 states. Word has length 69 [2018-06-22 11:04:07,420 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:07,420 INFO ]: With dead ends: 52 [2018-06-22 11:04:07,420 INFO ]: Without dead ends: 52 [2018-06-22 11:04:07,421 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:04:07,421 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:04:07,427 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-06-22 11:04:07,427 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:04:07,428 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-06-22 11:04:07,428 INFO ]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 69 [2018-06-22 11:04:07,428 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:07,428 INFO ]: Abstraction has 52 states and 55 transitions. [2018-06-22 11:04:07,428 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:04:07,428 INFO ]: Start isEmpty. Operand 52 states and 55 transitions. [2018-06-22 11:04:07,429 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:04:07,429 INFO ]: Found error trace [2018-06-22 11:04:07,429 INFO ]: trace histogram [10, 9, 9, 9, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:07,430 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:07,430 INFO ]: Analyzing trace with hash -429550474, now seen corresponding path program 10 times [2018-06-22 11:04:07,430 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:07,430 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:07,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:07,431 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:07,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:07,445 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:07,558 INFO ]: Checked inductivity of 226 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-06-22 11:04:07,559 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:07,559 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:04:07,566 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:04:07,608 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:04:07,608 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:07,612 INFO ]: Computing forward predicates... [2018-06-22 11:04:07,834 INFO ]: Checked inductivity of 226 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-06-22 11:04:07,853 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:07,853 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2018-06-22 11:04:07,854 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:04:07,854 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:04:07,854 INFO ]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:04:07,854 INFO ]: Start difference. First operand 52 states and 55 transitions. Second operand 23 states. [2018-06-22 11:04:08,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:08,221 INFO ]: Finished difference Result 56 states and 59 transitions. [2018-06-22 11:04:08,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:04:08,225 INFO ]: Start accepts. Automaton has 23 states. Word has length 77 [2018-06-22 11:04:08,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:08,226 INFO ]: With dead ends: 56 [2018-06-22 11:04:08,226 INFO ]: Without dead ends: 56 [2018-06-22 11:04:08,227 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:04:08,227 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:04:08,232 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-22 11:04:08,232 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:04:08,233 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-06-22 11:04:08,233 INFO ]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 77 [2018-06-22 11:04:08,233 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:08,233 INFO ]: Abstraction has 56 states and 59 transitions. [2018-06-22 11:04:08,233 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:04:08,233 INFO ]: Start isEmpty. Operand 56 states and 59 transitions. [2018-06-22 11:04:08,234 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:04:08,234 INFO ]: Found error trace [2018-06-22 11:04:08,235 INFO ]: trace histogram [11, 10, 10, 10, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:08,235 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:08,235 INFO ]: Analyzing trace with hash 92258074, now seen corresponding path program 11 times [2018-06-22 11:04:08,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:08,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:08,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:08,235 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:08,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:08,248 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:08,967 INFO ]: Checked inductivity of 288 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-06-22 11:04:08,967 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:08,967 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:04:08,973 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:04:09,005 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-06-22 11:04:09,005 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:09,008 INFO ]: Computing forward predicates... [2018-06-22 11:04:09,038 INFO ]: Checked inductivity of 288 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-06-22 11:04:09,058 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:09,058 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2018-06-22 11:04:09,059 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:04:09,059 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:04:09,059 INFO ]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:04:09,059 INFO ]: Start difference. First operand 56 states and 59 transitions. Second operand 12 states. [2018-06-22 11:04:09,293 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:09,294 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-22 11:04:09,294 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:04:09,294 INFO ]: Start accepts. Automaton has 12 states. Word has length 85 [2018-06-22 11:04:09,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:09,295 INFO ]: With dead ends: 58 [2018-06-22 11:04:09,295 INFO ]: Without dead ends: 58 [2018-06-22 11:04:09,295 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:04:09,295 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:04:09,304 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-06-22 11:04:09,304 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:04:09,305 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-06-22 11:04:09,305 INFO ]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 85 [2018-06-22 11:04:09,305 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:09,305 INFO ]: Abstraction has 58 states and 61 transitions. [2018-06-22 11:04:09,305 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:04:09,305 INFO ]: Start isEmpty. Operand 58 states and 61 transitions. [2018-06-22 11:04:09,306 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:04:09,306 INFO ]: Found error trace [2018-06-22 11:04:09,307 INFO ]: trace histogram [11, 10, 10, 10, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:09,307 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:09,307 INFO ]: Analyzing trace with hash 743063612, now seen corresponding path program 12 times [2018-06-22 11:04:09,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:09,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:09,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:09,307 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:09,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:09,321 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:09,441 INFO ]: Checked inductivity of 315 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-06-22 11:04:09,441 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:09,441 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:04:09,447 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:04:09,481 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-22 11:04:09,482 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:09,485 INFO ]: Computing forward predicates... [2018-06-22 11:04:09,515 INFO ]: Checked inductivity of 315 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-06-22 11:04:09,535 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:09,535 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2018-06-22 11:04:09,535 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:04:09,535 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:04:09,535 INFO ]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:04:09,535 INFO ]: Start difference. First operand 58 states and 61 transitions. Second operand 13 states. [2018-06-22 11:04:09,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:09,628 INFO ]: Finished difference Result 60 states and 63 transitions. [2018-06-22 11:04:09,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:04:09,628 INFO ]: Start accepts. Automaton has 13 states. Word has length 89 [2018-06-22 11:04:09,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:09,629 INFO ]: With dead ends: 60 [2018-06-22 11:04:09,629 INFO ]: Without dead ends: 60 [2018-06-22 11:04:09,629 INFO ]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:04:09,629 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:04:09,638 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-22 11:04:09,638 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:04:09,639 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-06-22 11:04:09,639 INFO ]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 89 [2018-06-22 11:04:09,639 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:09,640 INFO ]: Abstraction has 60 states and 63 transitions. [2018-06-22 11:04:09,640 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:04:09,640 INFO ]: Start isEmpty. Operand 60 states and 63 transitions. [2018-06-22 11:04:09,642 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:04:09,642 INFO ]: Found error trace [2018-06-22 11:04:09,642 INFO ]: trace histogram [11, 10, 10, 10, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:09,642 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:09,642 INFO ]: Analyzing trace with hash 1019336926, now seen corresponding path program 13 times [2018-06-22 11:04:09,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:09,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:09,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:09,643 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:09,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:09,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:09,894 INFO ]: Checked inductivity of 346 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-06-22 11:04:09,894 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:09,894 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:04:09,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:09,944 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:09,948 INFO ]: Computing forward predicates... [2018-06-22 11:04:10,032 INFO ]: Checked inductivity of 346 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-06-22 11:04:10,064 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:10,064 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 14 [2018-06-22 11:04:10,064 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:04:10,064 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:04:10,064 INFO ]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:04:10,065 INFO ]: Start difference. First operand 60 states and 63 transitions. Second operand 14 states. [2018-06-22 11:04:10,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:10,441 INFO ]: Finished difference Result 62 states and 65 transitions. [2018-06-22 11:04:10,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:04:10,441 INFO ]: Start accepts. Automaton has 14 states. Word has length 93 [2018-06-22 11:04:10,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:10,442 INFO ]: With dead ends: 62 [2018-06-22 11:04:10,442 INFO ]: Without dead ends: 62 [2018-06-22 11:04:10,442 INFO ]: 0 DeclaredPredicates, 120 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:04:10,442 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:04:10,449 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-06-22 11:04:10,449 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:04:10,450 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-06-22 11:04:10,450 INFO ]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 93 [2018-06-22 11:04:10,450 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:10,450 INFO ]: Abstraction has 62 states and 65 transitions. [2018-06-22 11:04:10,450 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:04:10,450 INFO ]: Start isEmpty. Operand 62 states and 65 transitions. [2018-06-22 11:04:10,451 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 11:04:10,451 INFO ]: Found error trace [2018-06-22 11:04:10,451 INFO ]: trace histogram [11, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:10,451 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:10,451 INFO ]: Analyzing trace with hash -2971392, now seen corresponding path program 14 times [2018-06-22 11:04:10,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:10,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:10,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:10,452 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:10,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:10,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:11,347 INFO ]: Checked inductivity of 381 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2018-06-22 11:04:11,347 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:11,347 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:04:11,353 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:04:11,392 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:04:11,392 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:11,397 INFO ]: Computing forward predicates... [2018-06-22 11:04:11,464 INFO ]: Checked inductivity of 381 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-06-22 11:04:11,495 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:11,495 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 15 [2018-06-22 11:04:11,496 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:04:11,496 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:04:11,496 INFO ]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:04:11,496 INFO ]: Start difference. First operand 62 states and 65 transitions. Second operand 15 states. [2018-06-22 11:04:11,631 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:11,631 INFO ]: Finished difference Result 64 states and 67 transitions. [2018-06-22 11:04:11,631 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:04:11,631 INFO ]: Start accepts. Automaton has 15 states. Word has length 97 [2018-06-22 11:04:11,631 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:11,632 INFO ]: With dead ends: 64 [2018-06-22 11:04:11,632 INFO ]: Without dead ends: 64 [2018-06-22 11:04:11,632 INFO ]: 0 DeclaredPredicates, 127 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:04:11,632 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:04:11,638 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-06-22 11:04:11,638 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 11:04:11,638 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-06-22 11:04:11,638 INFO ]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 97 [2018-06-22 11:04:11,639 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:11,639 INFO ]: Abstraction has 64 states and 67 transitions. [2018-06-22 11:04:11,639 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:04:11,639 INFO ]: Start isEmpty. Operand 64 states and 67 transitions. [2018-06-22 11:04:11,639 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 11:04:11,639 INFO ]: Found error trace [2018-06-22 11:04:11,639 INFO ]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:11,640 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:11,640 INFO ]: Analyzing trace with hash -1444884318, now seen corresponding path program 15 times [2018-06-22 11:04:11,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:11,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:11,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:11,640 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:11,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:11,654 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:11,894 INFO ]: Checked inductivity of 420 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-06-22 11:04:11,895 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:11,895 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:04:11,901 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:04:11,947 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-22 11:04:11,947 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:11,951 INFO ]: Computing forward predicates... [2018-06-22 11:04:12,036 INFO ]: Checked inductivity of 420 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-06-22 11:04:12,068 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:12,068 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 16 [2018-06-22 11:04:12,069 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:04:12,069 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:04:12,069 INFO ]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:04:12,069 INFO ]: Start difference. First operand 64 states and 67 transitions. Second operand 16 states. [2018-06-22 11:04:12,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:12,205 INFO ]: Finished difference Result 66 states and 69 transitions. [2018-06-22 11:04:12,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:04:12,205 INFO ]: Start accepts. Automaton has 16 states. Word has length 101 [2018-06-22 11:04:12,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:12,206 INFO ]: With dead ends: 66 [2018-06-22 11:04:12,206 INFO ]: Without dead ends: 66 [2018-06-22 11:04:12,206 INFO ]: 0 DeclaredPredicates, 134 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:04:12,206 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:04:12,213 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-22 11:04:12,213 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:04:12,213 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-06-22 11:04:12,213 INFO ]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 101 [2018-06-22 11:04:12,214 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:12,214 INFO ]: Abstraction has 66 states and 69 transitions. [2018-06-22 11:04:12,214 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:04:12,214 INFO ]: Start isEmpty. Operand 66 states and 69 transitions. [2018-06-22 11:04:12,214 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 11:04:12,214 INFO ]: Found error trace [2018-06-22 11:04:12,214 INFO ]: trace histogram [12, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:12,215 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:12,215 INFO ]: Analyzing trace with hash -590843964, now seen corresponding path program 16 times [2018-06-22 11:04:12,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:12,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:12,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:12,215 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:12,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:12,230 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:12,783 INFO ]: Checked inductivity of 463 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-06-22 11:04:12,783 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:12,783 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) [2018-06-22 11:04:12,794 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:04:12,827 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:04:12,827 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:12,830 INFO ]: Computing forward predicates... [2018-06-22 11:04:12,948 INFO ]: Checked inductivity of 463 backedges. 42 proven. 19 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2018-06-22 11:04:12,968 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:12,968 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10] total 26 [2018-06-22 11:04:12,968 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:04:12,968 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:04:12,968 INFO ]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:04:12,968 INFO ]: Start difference. First operand 66 states and 69 transitions. Second operand 26 states. [2018-06-22 11:04:13,760 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:13,760 INFO ]: Finished difference Result 218 states and 310 transitions. [2018-06-22 11:04:13,761 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 11:04:13,761 INFO ]: Start accepts. Automaton has 26 states. Word has length 105 [2018-06-22 11:04:13,761 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:13,761 INFO ]: With dead ends: 218 [2018-06-22 11:04:13,761 INFO ]: Without dead ends: 0 [2018-06-22 11:04:13,762 INFO ]: 0 DeclaredPredicates, 160 GetRequests, 110 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=338, Invalid=1302, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:04:13,762 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:04:13,762 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:04:13,762 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:04:13,762 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:04:13,762 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2018-06-22 11:04:13,762 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:13,762 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:04:13,762 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:04:13,762 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:04:13,762 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:04:13,766 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:04:13 BoogieIcfgContainer [2018-06-22 11:04:13,766 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:04:13,767 INFO ]: Toolchain (without parser) took 12900.40 ms. Allocated memory was 304.6 MB in the beginning and 452.5 MB in the end (delta: 147.8 MB). Free memory was 261.1 MB in the beginning and 206.0 MB in the end (delta: 55.1 MB). Peak memory consumption was 203.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:04:13,769 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.6 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:04:13,769 INFO ]: ChcToBoogie took 49.12 ms. Allocated memory is still 304.6 MB. Free memory was 261.1 MB in the beginning and 259.1 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:04:13,770 INFO ]: Boogie Preprocessor took 35.56 ms. Allocated memory is still 304.6 MB. Free memory was 259.1 MB in the beginning and 257.1 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:04:13,770 INFO ]: RCFGBuilder took 298.61 ms. Allocated memory is still 304.6 MB. Free memory was 257.1 MB in the beginning and 249.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:04:13,771 INFO ]: TraceAbstraction took 12504.84 ms. Allocated memory was 304.6 MB in the beginning and 452.5 MB in the end (delta: 147.8 MB). Free memory was 249.2 MB in the beginning and 206.0 MB in the end (delta: 43.2 MB). Peak memory consumption was 191.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:04:13,774 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 304.6 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 49.12 ms. Allocated memory is still 304.6 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.56 ms. Allocated memory is still 304.6 MB. Free memory was 259.1 MB in the beginning and 257.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 298.61 ms. Allocated memory is still 304.6 MB. Free memory was 257.1 MB in the beginning and 249.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 12504.84 ms. Allocated memory was 304.6 MB in the beginning and 452.5 MB in the end (delta: 147.8 MB). Free memory was 249.2 MB in the beginning and 206.0 MB in the end (delta: 43.2 MB). Peak memory consumption was 191.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 26 locations, 1 error locations. SAFE Result, 12.4s OverallTime, 18 OverallIterations, 12 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 448 SDtfs, 201 SDslu, 3130 SDs, 0 SdLazy, 2300 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1448 GetRequests, 1101 SyntacticMatches, 24 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2190 NumberOfCodeBlocks, 2162 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 2156 ConstructedInterpolants, 0 QuantifiedInterpolants, 316300 SizeOfPredicates, 98 NumberOfNonLiveVariables, 3431 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 34 InterpolantComputations, 2 PerfectInterpolantSequences, 4583/6075 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-loop_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-04-13-787.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-loop_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-04-13-787.csv Received shutdown request...