java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/07.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:55:50,641 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:55:50,643 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:55:50,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:55:50,655 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:55:50,656 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:55:50,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:55:50,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:55:50,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:55:50,661 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:55:50,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:55:50,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:55:50,664 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:55:50,665 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:55:50,668 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:55:50,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:55:50,682 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:55:50,684 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:55:50,685 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:55:50,686 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:55:50,687 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:55:50,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:55:50,690 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:55:50,690 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:55:50,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:55:50,692 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:55:50,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:55:50,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:55:50,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:55:50,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:55:50,695 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:55:50,696 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:55:50,696 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:55:50,697 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:55:50,697 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:55:50,698 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 00:55:50,710 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:55:50,711 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:55:50,711 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:55:50,711 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:55:50,712 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:55:50,712 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:55:50,713 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:55:50,713 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:55:50,713 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:55:50,713 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:55:50,713 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:55:50,714 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:55:50,714 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:55:50,714 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:55:50,714 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:55:50,714 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:55:50,714 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:55:50,719 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:55:50,719 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:55:50,762 INFO ]: Repository-Root is: /tmp [2018-06-22 00:55:50,775 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:55:50,778 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:55:50,780 INFO ]: Initializing SmtParser... [2018-06-22 00:55:50,780 INFO ]: SmtParser initialized [2018-06-22 00:55:50,781 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/07.c.smt2 [2018-06-22 00:55:50,782 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 00:55:50,880 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/07.c.smt2 unknown [2018-06-22 00:55:51,419 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/07.c.smt2 [2018-06-22 00:55:51,423 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:55:51,435 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:55:51,436 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:55:51,436 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:55:51,436 INFO ]: ChcToBoogie initialized [2018-06-22 00:55:51,438 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:55:51" (1/1) ... [2018-06-22 00:55:51,490 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:51 Unit [2018-06-22 00:55:51,490 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:55:51,491 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:55:51,491 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:55:51,491 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:55:51,510 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:51" (1/1) ... [2018-06-22 00:55:51,510 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:51" (1/1) ... [2018-06-22 00:55:51,523 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:51" (1/1) ... [2018-06-22 00:55:51,523 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:51" (1/1) ... [2018-06-22 00:55:51,539 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:51" (1/1) ... [2018-06-22 00:55:51,541 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:51" (1/1) ... [2018-06-22 00:55:51,543 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:51" (1/1) ... [2018-06-22 00:55:51,552 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:55:51,553 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:55:51,553 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:55:51,553 INFO ]: RCFGBuilder initialized [2018-06-22 00:55:51,561 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:51" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:55:51,573 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:55:51,573 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:55:51,573 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:55:51,573 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:55:51,573 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:55:51,573 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 00:55:52,336 INFO ]: Using library mode [2018-06-22 00:55:52,336 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:55:52 BoogieIcfgContainer [2018-06-22 00:55:52,336 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:55:52,340 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:55:52,340 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:55:52,343 INFO ]: TraceAbstraction initialized [2018-06-22 00:55:52,343 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:55:51" (1/3) ... [2018-06-22 00:55:52,348 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b57bb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:55:52, skipping insertion in model container [2018-06-22 00:55:52,348 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:51" (2/3) ... [2018-06-22 00:55:52,348 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b57bb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:55:52, skipping insertion in model container [2018-06-22 00:55:52,348 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:55:52" (3/3) ... [2018-06-22 00:55:52,351 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:55:52,360 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:55:52,370 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:55:52,449 INFO ]: Using default assertion order modulation [2018-06-22 00:55:52,455 INFO ]: Interprodecural is true [2018-06-22 00:55:52,455 INFO ]: Hoare is false [2018-06-22 00:55:52,455 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:55:52,455 INFO ]: Backedges is TWOTRACK [2018-06-22 00:55:52,455 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:55:52,455 INFO ]: Difference is false [2018-06-22 00:55:52,455 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:55:52,455 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:55:52,481 INFO ]: Start isEmpty. Operand 33 states. [2018-06-22 00:55:52,496 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 00:55:52,496 INFO ]: Found error trace [2018-06-22 00:55:52,497 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:55:52,497 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:52,505 INFO ]: Analyzing trace with hash 1924951474, now seen corresponding path program 1 times [2018-06-22 00:55:52,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:52,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:52,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:52,557 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:52,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:52,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:53,671 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:53,673 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:53,673 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:55:53,674 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:55:53,685 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:55:53,685 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:55:53,687 INFO ]: Start difference. First operand 33 states. Second operand 12 states. [2018-06-22 00:55:54,186 WARN ]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-06-22 00:55:54,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:54,952 INFO ]: Finished difference Result 72 states and 80 transitions. [2018-06-22 00:55:54,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 00:55:54,955 INFO ]: Start accepts. Automaton has 12 states. Word has length 19 [2018-06-22 00:55:54,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:54,965 INFO ]: With dead ends: 72 [2018-06-22 00:55:54,965 INFO ]: Without dead ends: 68 [2018-06-22 00:55:54,967 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-06-22 00:55:54,982 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 00:55:55,001 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 37. [2018-06-22 00:55:55,002 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 00:55:55,003 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-06-22 00:55:55,004 INFO ]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 19 [2018-06-22 00:55:55,004 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:55,004 INFO ]: Abstraction has 37 states and 40 transitions. [2018-06-22 00:55:55,004 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:55:55,004 INFO ]: Start isEmpty. Operand 37 states and 40 transitions. [2018-06-22 00:55:55,005 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 00:55:55,005 INFO ]: Found error trace [2018-06-22 00:55:55,005 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:55:55,005 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:55,005 INFO ]: Analyzing trace with hash 1300926555, now seen corresponding path program 1 times [2018-06-22 00:55:55,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:55,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:55,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:55,006 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:55,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:55,034 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:55,652 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 00:55:55,820 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:55,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:55,820 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:55,821 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:55,821 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:55,822 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:55,822 INFO ]: Start difference. First operand 37 states and 40 transitions. Second operand 11 states. [2018-06-22 00:55:56,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:56,493 INFO ]: Finished difference Result 73 states and 81 transitions. [2018-06-22 00:55:56,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 00:55:56,494 INFO ]: Start accepts. Automaton has 11 states. Word has length 19 [2018-06-22 00:55:56,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:56,495 INFO ]: With dead ends: 73 [2018-06-22 00:55:56,495 INFO ]: Without dead ends: 70 [2018-06-22 00:55:56,496 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-06-22 00:55:56,496 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 00:55:56,500 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 33. [2018-06-22 00:55:56,500 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 00:55:56,500 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-06-22 00:55:56,500 INFO ]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 19 [2018-06-22 00:55:56,501 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:56,501 INFO ]: Abstraction has 33 states and 36 transitions. [2018-06-22 00:55:56,501 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:56,501 INFO ]: Start isEmpty. Operand 33 states and 36 transitions. [2018-06-22 00:55:56,501 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:55:56,501 INFO ]: Found error trace [2018-06-22 00:55:56,501 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, 1, 1, 1] [2018-06-22 00:55:56,502 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:56,502 INFO ]: Analyzing trace with hash 2063258678, now seen corresponding path program 1 times [2018-06-22 00:55:56,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:56,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:56,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:56,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:56,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:56,543 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:56,966 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:56,966 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:55:56,967 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 00:55:56,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:57,098 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:57,114 INFO ]: Computing forward predicates... [2018-06-22 00:55:58,104 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:58,128 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:55:58,128 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2018-06-22 00:55:58,128 INFO ]: Interpolant automaton has 31 states [2018-06-22 00:55:58,128 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 00:55:58,129 INFO ]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2018-06-22 00:55:58,129 INFO ]: Start difference. First operand 33 states and 36 transitions. Second operand 31 states. [2018-06-22 00:55:59,325 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-06-22 00:56:00,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:00,689 INFO ]: Finished difference Result 123 states and 137 transitions. [2018-06-22 00:56:00,691 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 00:56:00,691 INFO ]: Start accepts. Automaton has 31 states. Word has length 28 [2018-06-22 00:56:00,691 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:00,693 INFO ]: With dead ends: 123 [2018-06-22 00:56:00,693 INFO ]: Without dead ends: 120 [2018-06-22 00:56:00,694 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=867, Invalid=3293, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 00:56:00,695 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-22 00:56:00,703 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 46. [2018-06-22 00:56:00,704 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 00:56:00,705 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-06-22 00:56:00,705 INFO ]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 28 [2018-06-22 00:56:00,705 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:00,705 INFO ]: Abstraction has 46 states and 50 transitions. [2018-06-22 00:56:00,705 INFO ]: Interpolant automaton has 31 states. [2018-06-22 00:56:00,705 INFO ]: Start isEmpty. Operand 46 states and 50 transitions. [2018-06-22 00:56:00,706 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:56:00,706 INFO ]: Found error trace [2018-06-22 00:56:00,706 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, 1, 1, 1] [2018-06-22 00:56:00,706 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:00,706 INFO ]: Analyzing trace with hash -352447950, now seen corresponding path program 1 times [2018-06-22 00:56:00,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:00,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:00,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:00,709 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:00,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:00,749 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:01,091 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:01,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:56:01,092 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) [2018-06-22 00:56:01,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 00:56:01,211 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:01,220 INFO ]: Computing forward predicates... [2018-06-22 00:56:02,158 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:02,177 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:56:02,178 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2018-06-22 00:56:02,178 INFO ]: Interpolant automaton has 31 states [2018-06-22 00:56:02,178 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 00:56:02,179 INFO ]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2018-06-22 00:56:02,179 INFO ]: Start difference. First operand 46 states and 50 transitions. Second operand 31 states. [2018-06-22 00:56:03,817 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-06-22 00:56:04,651 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:04,651 INFO ]: Finished difference Result 168 states and 186 transitions. [2018-06-22 00:56:04,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 00:56:04,652 INFO ]: Start accepts. Automaton has 31 states. Word has length 28 [2018-06-22 00:56:04,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:04,654 INFO ]: With dead ends: 168 [2018-06-22 00:56:04,654 INFO ]: Without dead ends: 165 [2018-06-22 00:56:04,661 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1105, Invalid=4151, Unknown=0, NotChecked=0, Total=5256 [2018-06-22 00:56:04,661 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-22 00:56:04,670 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 48. [2018-06-22 00:56:04,670 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 00:56:04,671 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-06-22 00:56:04,671 INFO ]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 28 [2018-06-22 00:56:04,671 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:04,671 INFO ]: Abstraction has 48 states and 53 transitions. [2018-06-22 00:56:04,671 INFO ]: Interpolant automaton has 31 states. [2018-06-22 00:56:04,671 INFO ]: Start isEmpty. Operand 48 states and 53 transitions. [2018-06-22 00:56:04,672 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:56:04,672 INFO ]: Found error trace [2018-06-22 00:56:04,672 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, 1, 1, 1] [2018-06-22 00:56:04,672 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:04,672 INFO ]: Analyzing trace with hash -2037998990, now seen corresponding path program 1 times [2018-06-22 00:56:04,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:04,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:04,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:04,673 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:04,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:04,707 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:04,955 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:04,955 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:56:04,955 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 00:56:04,960 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:05,040 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:05,047 INFO ]: Computing forward predicates... [2018-06-22 00:56:05,607 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:05,627 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:56:05,628 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2018-06-22 00:56:05,628 INFO ]: Interpolant automaton has 31 states [2018-06-22 00:56:05,628 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 00:56:05,628 INFO ]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2018-06-22 00:56:05,628 INFO ]: Start difference. First operand 48 states and 53 transitions. Second operand 31 states. [2018-06-22 00:56:07,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:07,818 INFO ]: Finished difference Result 160 states and 177 transitions. [2018-06-22 00:56:07,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 00:56:07,818 INFO ]: Start accepts. Automaton has 31 states. Word has length 28 [2018-06-22 00:56:07,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:07,820 INFO ]: With dead ends: 160 [2018-06-22 00:56:07,820 INFO ]: Without dead ends: 157 [2018-06-22 00:56:07,821 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1105, Invalid=4151, Unknown=0, NotChecked=0, Total=5256 [2018-06-22 00:56:07,821 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-22 00:56:07,826 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 49. [2018-06-22 00:56:07,827 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 00:56:07,827 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-06-22 00:56:07,827 INFO ]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 28 [2018-06-22 00:56:07,827 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:07,827 INFO ]: Abstraction has 49 states and 54 transitions. [2018-06-22 00:56:07,827 INFO ]: Interpolant automaton has 31 states. [2018-06-22 00:56:07,828 INFO ]: Start isEmpty. Operand 49 states and 54 transitions. [2018-06-22 00:56:07,828 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:56:07,828 INFO ]: Found error trace [2018-06-22 00:56:07,828 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, 1, 1, 1] [2018-06-22 00:56:07,828 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:07,829 INFO ]: Analyzing trace with hash -311517267, now seen corresponding path program 1 times [2018-06-22 00:56:07,829 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:07,829 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:07,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:07,829 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:07,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:07,851 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:08,343 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:08,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:56:08,343 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 00:56:08,358 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:08,436 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:08,442 INFO ]: Computing forward predicates... [2018-06-22 00:56:08,922 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:56:08,946 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 00:56:08,946 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [20] total 29 [2018-06-22 00:56:08,946 INFO ]: Interpolant automaton has 29 states [2018-06-22 00:56:08,947 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 00:56:08,947 INFO ]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2018-06-22 00:56:08,947 INFO ]: Start difference. First operand 49 states and 54 transitions. Second operand 29 states. [2018-06-22 00:56:10,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:10,068 INFO ]: Finished difference Result 142 states and 159 transitions. [2018-06-22 00:56:10,071 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 00:56:10,071 INFO ]: Start accepts. Automaton has 29 states. Word has length 28 [2018-06-22 00:56:10,071 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:10,072 INFO ]: With dead ends: 142 [2018-06-22 00:56:10,072 INFO ]: Without dead ends: 139 [2018-06-22 00:56:10,073 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=656, Invalid=2100, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 00:56:10,073 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-22 00:56:10,078 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 58. [2018-06-22 00:56:10,078 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 00:56:10,083 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-06-22 00:56:10,083 INFO ]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 28 [2018-06-22 00:56:10,083 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:10,083 INFO ]: Abstraction has 58 states and 64 transitions. [2018-06-22 00:56:10,083 INFO ]: Interpolant automaton has 29 states. [2018-06-22 00:56:10,083 INFO ]: Start isEmpty. Operand 58 states and 64 transitions. [2018-06-22 00:56:10,084 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:56:10,084 INFO ]: Found error trace [2018-06-22 00:56:10,084 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, 1, 1, 1] [2018-06-22 00:56:10,084 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:10,084 INFO ]: Analyzing trace with hash 1567743401, now seen corresponding path program 1 times [2018-06-22 00:56:10,085 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:10,085 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:10,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:10,086 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:10,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:10,113 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:10,443 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:10,443 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:56:10,443 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 00:56:10,450 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:10,562 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:10,568 INFO ]: Computing forward predicates... [2018-06-22 00:56:10,903 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:56:10,923 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 00:56:10,923 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [20] total 29 [2018-06-22 00:56:10,924 INFO ]: Interpolant automaton has 29 states [2018-06-22 00:56:10,924 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 00:56:10,924 INFO ]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2018-06-22 00:56:10,924 INFO ]: Start difference. First operand 58 states and 64 transitions. Second operand 29 states. [2018-06-22 00:56:12,148 WARN ]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-06-22 00:56:12,555 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:12,555 INFO ]: Finished difference Result 191 states and 213 transitions. [2018-06-22 00:56:12,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 00:56:12,555 INFO ]: Start accepts. Automaton has 29 states. Word has length 28 [2018-06-22 00:56:12,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:12,556 INFO ]: With dead ends: 191 [2018-06-22 00:56:12,556 INFO ]: Without dead ends: 188 [2018-06-22 00:56:12,557 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=741, Invalid=2339, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 00:56:12,557 INFO ]: Start minimizeSevpa. Operand 188 states. [2018-06-22 00:56:12,569 INFO ]: Finished minimizeSevpa. Reduced states from 188 to 70. [2018-06-22 00:56:12,569 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 00:56:12,570 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-06-22 00:56:12,570 INFO ]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 28 [2018-06-22 00:56:12,570 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:12,570 INFO ]: Abstraction has 70 states and 79 transitions. [2018-06-22 00:56:12,570 INFO ]: Interpolant automaton has 29 states. [2018-06-22 00:56:12,570 INFO ]: Start isEmpty. Operand 70 states and 79 transitions. [2018-06-22 00:56:12,571 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:56:12,571 INFO ]: Found error trace [2018-06-22 00:56:12,571 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, 1, 1, 1] [2018-06-22 00:56:12,571 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:12,572 INFO ]: Analyzing trace with hash -117807639, now seen corresponding path program 1 times [2018-06-22 00:56:12,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:12,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:12,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:12,575 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:12,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:12,597 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:12,951 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:12,951 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:56:12,951 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 00:56:12,959 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:13,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:13,042 INFO ]: Computing forward predicates... [2018-06-22 00:56:13,372 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:56:13,392 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 00:56:13,392 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [20] total 29 [2018-06-22 00:56:13,392 INFO ]: Interpolant automaton has 29 states [2018-06-22 00:56:13,392 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 00:56:13,392 INFO ]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2018-06-22 00:56:13,392 INFO ]: Start difference. First operand 70 states and 79 transitions. Second operand 29 states. [2018-06-22 00:56:14,665 WARN ]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-06-22 00:56:15,110 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:15,110 INFO ]: Finished difference Result 193 states and 217 transitions. [2018-06-22 00:56:15,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 00:56:15,110 INFO ]: Start accepts. Automaton has 29 states. Word has length 28 [2018-06-22 00:56:15,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:15,111 INFO ]: With dead ends: 193 [2018-06-22 00:56:15,111 INFO ]: Without dead ends: 190 [2018-06-22 00:56:15,112 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=741, Invalid=2339, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 00:56:15,112 INFO ]: Start minimizeSevpa. Operand 190 states. [2018-06-22 00:56:15,118 INFO ]: Finished minimizeSevpa. Reduced states from 190 to 80. [2018-06-22 00:56:15,118 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 00:56:15,119 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2018-06-22 00:56:15,119 INFO ]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 28 [2018-06-22 00:56:15,119 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:15,119 INFO ]: Abstraction has 80 states and 92 transitions. [2018-06-22 00:56:15,119 INFO ]: Interpolant automaton has 29 states. [2018-06-22 00:56:15,119 INFO ]: Start isEmpty. Operand 80 states and 92 transitions. [2018-06-22 00:56:15,121 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 00:56:15,121 INFO ]: Found error trace [2018-06-22 00:56:15,121 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:56:15,121 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:15,121 INFO ]: Analyzing trace with hash 292389426, now seen corresponding path program 2 times [2018-06-22 00:56:15,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:15,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:15,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:15,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:15,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:15,149 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:16,103 INFO ]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:16,103 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:56:16,103 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 00:56:16,109 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 00:56:16,255 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 00:56:16,255 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:16,264 INFO ]: Computing forward predicates... [2018-06-22 00:56:17,076 INFO ]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:56:17,096 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:56:17,096 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 38 [2018-06-22 00:56:17,096 INFO ]: Interpolant automaton has 38 states [2018-06-22 00:56:17,096 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 00:56:17,096 INFO ]: CoverageRelationStatistics Valid=84, Invalid=1322, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 00:56:17,097 INFO ]: Start difference. First operand 80 states and 92 transitions. Second operand 38 states. [2018-06-22 00:56:18,620 WARN ]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-06-22 00:56:19,754 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:19,754 INFO ]: Finished difference Result 196 states and 223 transitions. [2018-06-22 00:56:19,756 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 00:56:19,756 INFO ]: Start accepts. Automaton has 38 states. Word has length 37 [2018-06-22 00:56:19,756 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:19,757 INFO ]: With dead ends: 196 [2018-06-22 00:56:19,757 INFO ]: Without dead ends: 193 [2018-06-22 00:56:19,759 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 11 SyntacticMatches, 18 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1014, Invalid=5306, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 00:56:19,759 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-22 00:56:19,770 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 78. [2018-06-22 00:56:19,770 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 00:56:19,771 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2018-06-22 00:56:19,771 INFO ]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 37 [2018-06-22 00:56:19,771 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:19,771 INFO ]: Abstraction has 78 states and 90 transitions. [2018-06-22 00:56:19,771 INFO ]: Interpolant automaton has 38 states. [2018-06-22 00:56:19,771 INFO ]: Start isEmpty. Operand 78 states and 90 transitions. [2018-06-22 00:56:19,772 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 00:56:19,772 INFO ]: Found error trace [2018-06-22 00:56:19,773 INFO ]: trace histogram [3, 2, 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, 1, 1] [2018-06-22 00:56:19,781 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:19,781 INFO ]: Analyzing trace with hash -2123317202, now seen corresponding path program 1 times [2018-06-22 00:56:19,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:19,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:19,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:19,782 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:56:19,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:19,803 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:20,047 INFO ]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:20,048 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:20,048 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:56:20,048 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:56:20,048 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:56:20,048 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:56:20,048 INFO ]: Start difference. First operand 78 states and 90 transitions. Second operand 11 states. [2018-06-22 00:56:20,318 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:20,318 INFO ]: Finished difference Result 168 states and 188 transitions. [2018-06-22 00:56:20,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 00:56:20,319 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-22 00:56:20,319 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:20,319 INFO ]: With dead ends: 168 [2018-06-22 00:56:20,319 INFO ]: Without dead ends: 167 [2018-06-22 00:56:20,320 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=676, Unknown=0, NotChecked=0, Total=930 [2018-06-22 00:56:20,320 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-22 00:56:20,324 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 86. [2018-06-22 00:56:20,325 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 00:56:20,328 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2018-06-22 00:56:20,328 INFO ]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 37 [2018-06-22 00:56:20,329 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:20,329 INFO ]: Abstraction has 86 states and 100 transitions. [2018-06-22 00:56:20,329 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:56:20,329 INFO ]: Start isEmpty. Operand 86 states and 100 transitions. [2018-06-22 00:56:20,330 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 00:56:20,330 INFO ]: Found error trace [2018-06-22 00:56:20,330 INFO ]: trace histogram [3, 2, 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, 1, 1] [2018-06-22 00:56:20,330 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:20,330 INFO ]: Analyzing trace with hash 486099054, now seen corresponding path program 1 times [2018-06-22 00:56:20,330 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:20,330 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:20,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:20,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:20,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:20,351 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:20,518 INFO ]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:20,519 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:20,519 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:56:20,519 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:56:20,519 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:56:20,519 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:56:20,519 INFO ]: Start difference. First operand 86 states and 100 transitions. Second operand 11 states. [2018-06-22 00:56:20,693 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:20,693 INFO ]: Finished difference Result 119 states and 133 transitions. [2018-06-22 00:56:20,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 00:56:20,693 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-22 00:56:20,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:20,694 INFO ]: With dead ends: 119 [2018-06-22 00:56:20,694 INFO ]: Without dead ends: 100 [2018-06-22 00:56:20,694 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 00:56:20,694 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 00:56:20,696 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 76. [2018-06-22 00:56:20,696 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 00:56:20,697 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-06-22 00:56:20,697 INFO ]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 37 [2018-06-22 00:56:20,697 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:20,697 INFO ]: Abstraction has 76 states and 86 transitions. [2018-06-22 00:56:20,697 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:56:20,697 INFO ]: Start isEmpty. Operand 76 states and 86 transitions. [2018-06-22 00:56:20,698 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 00:56:20,698 INFO ]: Found error trace [2018-06-22 00:56:20,698 INFO ]: trace histogram [3, 2, 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, 1, 1] [2018-06-22 00:56:20,698 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:20,698 INFO ]: Analyzing trace with hash -318095434, now seen corresponding path program 2 times [2018-06-22 00:56:20,698 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:20,698 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:20,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:20,699 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:20,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:20,716 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:20,948 INFO ]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:20,948 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:20,948 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:56:20,948 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:56:20,948 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:56:20,948 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:56:20,949 INFO ]: Start difference. First operand 76 states and 86 transitions. Second operand 11 states. [2018-06-22 00:56:21,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:21,063 INFO ]: Finished difference Result 83 states and 91 transitions. [2018-06-22 00:56:21,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 00:56:21,063 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-22 00:56:21,063 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:21,063 INFO ]: With dead ends: 83 [2018-06-22 00:56:21,064 INFO ]: Without dead ends: 81 [2018-06-22 00:56:21,064 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 00:56:21,064 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 00:56:21,066 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 67. [2018-06-22 00:56:21,066 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 00:56:21,066 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-06-22 00:56:21,066 INFO ]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 37 [2018-06-22 00:56:21,067 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:21,067 INFO ]: Abstraction has 67 states and 73 transitions. [2018-06-22 00:56:21,067 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:56:21,067 INFO ]: Start isEmpty. Operand 67 states and 73 transitions. [2018-06-22 00:56:21,068 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 00:56:21,068 INFO ]: Found error trace [2018-06-22 00:56:21,068 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:56:21,068 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:21,068 INFO ]: Analyzing trace with hash 1561165234, now seen corresponding path program 2 times [2018-06-22 00:56:21,068 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:21,068 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:21,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:21,068 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:56:21,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:21,089 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:21,540 INFO ]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:21,540 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:56:21,540 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 00:56:21,546 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 00:56:21,655 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 00:56:21,655 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:21,662 INFO ]: Computing forward predicates... [2018-06-22 00:56:22,384 INFO ]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:56:22,404 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:56:22,404 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 38 [2018-06-22 00:56:22,405 INFO ]: Interpolant automaton has 38 states [2018-06-22 00:56:22,405 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 00:56:22,405 INFO ]: CoverageRelationStatistics Valid=84, Invalid=1322, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 00:56:22,405 INFO ]: Start difference. First operand 67 states and 73 transitions. Second operand 38 states. [2018-06-22 00:56:25,078 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:25,078 INFO ]: Finished difference Result 176 states and 192 transitions. [2018-06-22 00:56:25,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-22 00:56:25,079 INFO ]: Start accepts. Automaton has 38 states. Word has length 37 [2018-06-22 00:56:25,079 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:25,080 INFO ]: With dead ends: 176 [2018-06-22 00:56:25,080 INFO ]: Without dead ends: 173 [2018-06-22 00:56:25,082 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 11 SyntacticMatches, 18 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1035, Invalid=5445, Unknown=0, NotChecked=0, Total=6480 [2018-06-22 00:56:25,082 INFO ]: Start minimizeSevpa. Operand 173 states. [2018-06-22 00:56:25,085 INFO ]: Finished minimizeSevpa. Reduced states from 173 to 66. [2018-06-22 00:56:25,085 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 00:56:25,086 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-06-22 00:56:25,086 INFO ]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 37 [2018-06-22 00:56:25,086 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:25,086 INFO ]: Abstraction has 66 states and 72 transitions. [2018-06-22 00:56:25,086 INFO ]: Interpolant automaton has 38 states. [2018-06-22 00:56:25,086 INFO ]: Start isEmpty. Operand 66 states and 72 transitions. [2018-06-22 00:56:25,087 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 00:56:25,087 INFO ]: Found error trace [2018-06-22 00:56:25,087 INFO ]: trace histogram [3, 2, 2, 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 00:56:25,087 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:25,087 INFO ]: Analyzing trace with hash -124385806, now seen corresponding path program 1 times [2018-06-22 00:56:25,087 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:25,087 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:25,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:25,088 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:56:25,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:25,104 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:25,350 INFO ]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:25,350 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:25,350 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:56:25,350 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:56:25,350 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:56:25,350 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:56:25,350 INFO ]: Start difference. First operand 66 states and 72 transitions. Second operand 11 states. [2018-06-22 00:56:25,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:25,487 INFO ]: Finished difference Result 107 states and 115 transitions. [2018-06-22 00:56:25,487 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 00:56:25,487 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-22 00:56:25,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:25,488 INFO ]: With dead ends: 107 [2018-06-22 00:56:25,488 INFO ]: Without dead ends: 89 [2018-06-22 00:56:25,488 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 00:56:25,488 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-22 00:56:25,491 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 65. [2018-06-22 00:56:25,491 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 00:56:25,492 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-06-22 00:56:25,492 INFO ]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 37 [2018-06-22 00:56:25,492 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:25,492 INFO ]: Abstraction has 65 states and 69 transitions. [2018-06-22 00:56:25,492 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:56:25,492 INFO ]: Start isEmpty. Operand 65 states and 69 transitions. [2018-06-22 00:56:25,492 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 00:56:25,492 INFO ]: Found error trace [2018-06-22 00:56:25,492 INFO ]: trace histogram [3, 2, 2, 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 00:56:25,492 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:25,493 INFO ]: Analyzing trace with hash 1358577010, now seen corresponding path program 2 times [2018-06-22 00:56:25,493 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:25,493 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:25,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:25,493 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:25,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:25,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:26,796 INFO ]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:26,797 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:26,797 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:56:26,797 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:56:26,797 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:56:26,797 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:56:26,797 INFO ]: Start difference. First operand 65 states and 69 transitions. Second operand 11 states. [2018-06-22 00:56:27,530 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:27,530 INFO ]: Finished difference Result 66 states and 68 transitions. [2018-06-22 00:56:27,530 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 00:56:27,530 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-22 00:56:27,530 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:27,530 INFO ]: With dead ends: 66 [2018-06-22 00:56:27,530 INFO ]: Without dead ends: 39 [2018-06-22 00:56:27,531 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 00:56:27,531 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 00:56:27,532 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-06-22 00:56:27,532 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 00:56:27,532 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-22 00:56:27,532 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 37 [2018-06-22 00:56:27,532 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:27,532 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-22 00:56:27,532 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:56:27,532 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-22 00:56:27,533 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 00:56:27,533 INFO ]: Found error trace [2018-06-22 00:56:27,533 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:56:27,533 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:27,533 INFO ]: Analyzing trace with hash -326974030, now seen corresponding path program 2 times [2018-06-22 00:56:27,533 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:27,533 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:27,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:27,533 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:56:27,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:27,552 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:28,651 INFO ]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:28,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:56:28,678 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 00:56:28,683 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 00:56:28,783 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 00:56:28,783 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:28,789 INFO ]: Computing forward predicates... [2018-06-22 00:56:29,870 INFO ]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:56:29,889 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:56:29,889 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 38 [2018-06-22 00:56:29,889 INFO ]: Interpolant automaton has 38 states [2018-06-22 00:56:29,890 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 00:56:29,890 INFO ]: CoverageRelationStatistics Valid=84, Invalid=1322, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 00:56:29,890 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-06-22 00:56:31,227 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:31,227 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-22 00:56:31,227 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 00:56:31,227 INFO ]: Start accepts. Automaton has 38 states. Word has length 37 [2018-06-22 00:56:31,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:31,227 INFO ]: With dead ends: 37 [2018-06-22 00:56:31,227 INFO ]: Without dead ends: 0 [2018-06-22 00:56:31,228 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 18 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=577, Invalid=3205, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 00:56:31,228 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 00:56:31,229 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 00:56:31,229 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 00:56:31,229 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 00:56:31,229 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-06-22 00:56:31,229 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:31,229 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 00:56:31,229 INFO ]: Interpolant automaton has 38 states. [2018-06-22 00:56:31,229 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 00:56:31,229 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 00:56:31,233 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:56:31 BoogieIcfgContainer [2018-06-22 00:56:31,233 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 00:56:31,234 INFO ]: Toolchain (without parser) took 39810.75 ms. Allocated memory was 309.3 MB in the beginning and 670.0 MB in the end (delta: 360.7 MB). Free memory was 241.7 MB in the beginning and 362.4 MB in the end (delta: -120.7 MB). Peak memory consumption was 240.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:31,235 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 00:56:31,235 INFO ]: ChcToBoogie took 55.01 ms. Allocated memory is still 309.3 MB. Free memory was 240.7 MB in the beginning and 237.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:31,235 INFO ]: Boogie Preprocessor took 61.14 ms. Allocated memory is still 309.3 MB. Free memory was 237.7 MB in the beginning and 236.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 00:56:31,236 INFO ]: RCFGBuilder took 783.64 ms. Allocated memory is still 309.3 MB. Free memory was 236.7 MB in the beginning and 193.9 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:31,236 INFO ]: TraceAbstraction took 38893.44 ms. Allocated memory was 309.3 MB in the beginning and 670.0 MB in the end (delta: 360.7 MB). Free memory was 193.9 MB in the beginning and 362.4 MB in the end (delta: -168.4 MB). Peak memory consumption was 192.3 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:31,238 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.01 ms. Allocated memory is still 309.3 MB. Free memory was 240.7 MB in the beginning and 237.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 61.14 ms. Allocated memory is still 309.3 MB. Free memory was 237.7 MB in the beginning and 236.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 783.64 ms. Allocated memory is still 309.3 MB. Free memory was 236.7 MB in the beginning and 193.9 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 38893.44 ms. Allocated memory was 309.3 MB in the beginning and 670.0 MB in the end (delta: 360.7 MB). Free memory was 193.9 MB in the beginning and 362.4 MB in the end (delta: -168.4 MB). Peak memory consumption was 192.3 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 2 procedures, 33 locations, 1 error locations. SAFE Result, 38.8s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 21.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 678 SDtfs, 5414 SDslu, 12155 SDs, 0 SdLazy, 5038 SolverSat, 1134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 945 GetRequests, 124 SyntacticMatches, 105 SemanticMatches, 716 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7329 ImplicationChecksByTransitivity, 28.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=10, 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, 16 MinimizatonAttempts, 1042 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 781 NumberOfCodeBlocks, 781 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 756 ConstructedInterpolants, 87 QuantifiedInterpolants, 148005 SizeOfPredicates, 603 NumberOfNonLiveVariables, 7912 ConjunctsInSsa, 642 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 69/159 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/07.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_00-56-31-250.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/07.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_00-56-31-250.csv Received shutdown request...