java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label19_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:10:42,680 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:10:42,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:10:42,697 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:10:42,698 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:10:42,700 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:10:42,701 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:10:42,706 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:10:42,708 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:10:42,709 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:10:42,710 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:10:42,710 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:10:42,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:10:42,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:10:42,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:10:42,715 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:10:42,719 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:10:42,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:10:42,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:10:42,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:10:42,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:10:42,737 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:10:42,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:10:42,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:10:42,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:10:42,745 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:10:42,746 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:10:42,749 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:10:42,753 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:10:42,754 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:10:42,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:10:42,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:10:42,755 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:10:42,755 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:10:42,756 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:10:42,757 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:10:42,757 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:10:42,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:10:42,772 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:10:42,773 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:10:42,773 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:10:42,774 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:10:42,774 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:10:42,774 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:10:42,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:10:42,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:10:42,775 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:10:42,775 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:10:42,775 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:10:42,775 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:10:42,775 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:10:42,776 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:10:42,776 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:10:42,776 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:10:42,776 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:10:42,776 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:10:42,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:10:42,777 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:10:42,777 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:10:42,777 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:10:42,777 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:10:42,777 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:10:42,778 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:10:42,778 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:10:42,778 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:10:42,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:10:42,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:10:42,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:10:42,850 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:10:42,850 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:10:42,851 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label19_false-unreach-call.c [2018-11-06 19:10:42,914 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54213599a/a0420fb839cd45f98744d95459590661/FLAG655a3e1bf [2018-11-06 19:10:43,682 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:10:43,683 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label19_false-unreach-call.c [2018-11-06 19:10:43,719 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54213599a/a0420fb839cd45f98744d95459590661/FLAG655a3e1bf [2018-11-06 19:10:43,737 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54213599a/a0420fb839cd45f98744d95459590661 [2018-11-06 19:10:43,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:10:43,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:10:43,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:10:43,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:10:43,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:10:43,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:10:43" (1/1) ... [2018-11-06 19:10:43,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7293a3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:10:43, skipping insertion in model container [2018-11-06 19:10:43,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:10:43" (1/1) ... [2018-11-06 19:10:43,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:10:43,996 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:10:45,528 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:10:45,540 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:10:46,242 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:10:46,276 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:10:46,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:10:46 WrapperNode [2018-11-06 19:10:46,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:10:46,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:10:46,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:10:46,278 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:10:46,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:10:46" (1/1) ... [2018-11-06 19:10:46,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:10:46" (1/1) ... [2018-11-06 19:10:47,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:10:47,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:10:47,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:10:47,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:10:47,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:10:46" (1/1) ... [2018-11-06 19:10:47,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:10:46" (1/1) ... [2018-11-06 19:10:47,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:10:46" (1/1) ... [2018-11-06 19:10:47,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:10:46" (1/1) ... [2018-11-06 19:10:47,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:10:46" (1/1) ... [2018-11-06 19:10:47,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:10:46" (1/1) ... [2018-11-06 19:10:47,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:10:46" (1/1) ... [2018-11-06 19:10:47,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:10:47,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:10:47,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:10:47,576 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:10:47,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:10:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 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 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:10:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:10:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:10:47,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:10:57,800 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:10:57,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:10:57 BoogieIcfgContainer [2018-11-06 19:10:57,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:10:57,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:10:57,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:10:57,806 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:10:57,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:10:43" (1/3) ... [2018-11-06 19:10:57,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753e00e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:10:57, skipping insertion in model container [2018-11-06 19:10:57,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:10:46" (2/3) ... [2018-11-06 19:10:57,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753e00e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:10:57, skipping insertion in model container [2018-11-06 19:10:57,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:10:57" (3/3) ... [2018-11-06 19:10:57,810 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label19_false-unreach-call.c [2018-11-06 19:10:57,820 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:10:57,831 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:10:57,849 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:10:57,897 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:10:57,898 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:10:57,898 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:10:57,898 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:10:57,898 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:10:57,899 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:10:57,899 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:10:57,899 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:10:57,899 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:10:57,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-11-06 19:10:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-06 19:10:57,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:10:57,962 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:10:57,964 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:10:57,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:10:57,972 INFO L82 PathProgramCache]: Analyzing trace with hash 670581594, now seen corresponding path program 1 times [2018-11-06 19:10:57,974 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:10:57,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:10:58,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:10:58,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:10:58,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:10:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:10:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:10:58,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:10:58,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:10:58,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:10:58,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:10:58,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:10:58,354 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-11-06 19:11:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:11:11,543 INFO L93 Difference]: Finished difference Result 3993 states and 7498 transitions. [2018-11-06 19:11:11,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:11:11,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-06 19:11:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:11:11,598 INFO L225 Difference]: With dead ends: 3993 [2018-11-06 19:11:11,599 INFO L226 Difference]: Without dead ends: 2887 [2018-11-06 19:11:11,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-11-06 19:11:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1936. [2018-11-06 19:11:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2018-11-06 19:11:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 3550 transitions. [2018-11-06 19:11:11,765 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 3550 transitions. Word has length 18 [2018-11-06 19:11:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:11:11,766 INFO L480 AbstractCegarLoop]: Abstraction has 1936 states and 3550 transitions. [2018-11-06 19:11:11,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:11:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 3550 transitions. [2018-11-06 19:11:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-06 19:11:11,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:11:11,771 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:11:11,771 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:11:11,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:11:11,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1916991881, now seen corresponding path program 1 times [2018-11-06 19:11:11,772 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:11:11,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:11:11,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:11,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:11,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:11:12,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:11:12,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:11:12,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:11:12,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:11:12,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:12,176 INFO L87 Difference]: Start difference. First operand 1936 states and 3550 transitions. Second operand 4 states. [2018-11-06 19:11:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:11:24,375 INFO L93 Difference]: Finished difference Result 7120 states and 13344 transitions. [2018-11-06 19:11:24,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:11:24,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-06 19:11:24,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:11:24,404 INFO L225 Difference]: With dead ends: 7120 [2018-11-06 19:11:24,405 INFO L226 Difference]: Without dead ends: 5186 [2018-11-06 19:11:24,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2018-11-06 19:11:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 3554. [2018-11-06 19:11:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3554 states. [2018-11-06 19:11:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 6248 transitions. [2018-11-06 19:11:24,503 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 6248 transitions. Word has length 87 [2018-11-06 19:11:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:11:24,503 INFO L480 AbstractCegarLoop]: Abstraction has 3554 states and 6248 transitions. [2018-11-06 19:11:24,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:11:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 6248 transitions. [2018-11-06 19:11:24,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-06 19:11:24,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:11:24,510 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1] [2018-11-06 19:11:24,510 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:11:24,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:11:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2105908058, now seen corresponding path program 1 times [2018-11-06 19:11:24,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:11:24,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:11:24,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:24,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:24,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:11:24,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:11:24,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:11:24,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:11:24,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:11:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:24,854 INFO L87 Difference]: Start difference. First operand 3554 states and 6248 transitions. Second operand 4 states. [2018-11-06 19:11:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:11:36,388 INFO L93 Difference]: Finished difference Result 12675 states and 22439 transitions. [2018-11-06 19:11:36,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:11:36,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-06 19:11:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:11:36,433 INFO L225 Difference]: With dead ends: 12675 [2018-11-06 19:11:36,433 INFO L226 Difference]: Without dead ends: 9123 [2018-11-06 19:11:36,441 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:36,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9123 states. [2018-11-06 19:11:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9123 to 9116. [2018-11-06 19:11:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2018-11-06 19:11:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 14200 transitions. [2018-11-06 19:11:36,620 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 14200 transitions. Word has length 100 [2018-11-06 19:11:36,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:11:36,621 INFO L480 AbstractCegarLoop]: Abstraction has 9116 states and 14200 transitions. [2018-11-06 19:11:36,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:11:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 14200 transitions. [2018-11-06 19:11:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-06 19:11:36,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:11:36,634 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:11:36,635 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:11:36,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:11:36,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1681546925, now seen corresponding path program 1 times [2018-11-06 19:11:36,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:11:36,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:11:36,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:36,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:36,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:37,082 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 19:11:37,292 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-11-06 19:11:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:11:37,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:11:37,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:11:37,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:11:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:11:37,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:11:37,394 INFO L87 Difference]: Start difference. First operand 9116 states and 14200 transitions. Second operand 5 states. [2018-11-06 19:11:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:11:49,501 INFO L93 Difference]: Finished difference Result 29265 states and 45080 transitions. [2018-11-06 19:11:49,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:11:49,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-11-06 19:11:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:11:49,566 INFO L225 Difference]: With dead ends: 29265 [2018-11-06 19:11:49,566 INFO L226 Difference]: Without dead ends: 20151 [2018-11-06 19:11:49,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:11:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20151 states. [2018-11-06 19:11:49,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20151 to 20149. [2018-11-06 19:11:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20149 states. [2018-11-06 19:11:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20149 states to 20149 states and 28284 transitions. [2018-11-06 19:11:49,897 INFO L78 Accepts]: Start accepts. Automaton has 20149 states and 28284 transitions. Word has length 121 [2018-11-06 19:11:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:11:49,897 INFO L480 AbstractCegarLoop]: Abstraction has 20149 states and 28284 transitions. [2018-11-06 19:11:49,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:11:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 20149 states and 28284 transitions. [2018-11-06 19:11:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-06 19:11:49,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:11:49,899 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:11:49,900 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:11:49,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:11:49,900 INFO L82 PathProgramCache]: Analyzing trace with hash 964067941, now seen corresponding path program 1 times [2018-11-06 19:11:49,900 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:11:49,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:11:49,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:49,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:49,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:11:50,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:11:50,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:11:50,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:11:50,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:11:50,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:11:50,055 INFO L87 Difference]: Start difference. First operand 20149 states and 28284 transitions. Second operand 3 states. [2018-11-06 19:11:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:11:55,695 INFO L93 Difference]: Finished difference Result 41070 states and 57647 transitions. [2018-11-06 19:11:55,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:11:55,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-11-06 19:11:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:11:55,728 INFO L225 Difference]: With dead ends: 41070 [2018-11-06 19:11:55,728 INFO L226 Difference]: Without dead ends: 21711 [2018-11-06 19:11:55,752 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:11:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21711 states. [2018-11-06 19:11:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21711 to 21708. [2018-11-06 19:11:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21708 states. [2018-11-06 19:11:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21708 states to 21708 states and 27055 transitions. [2018-11-06 19:11:56,035 INFO L78 Accepts]: Start accepts. Automaton has 21708 states and 27055 transitions. Word has length 144 [2018-11-06 19:11:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:11:56,035 INFO L480 AbstractCegarLoop]: Abstraction has 21708 states and 27055 transitions. [2018-11-06 19:11:56,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:11:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 21708 states and 27055 transitions. [2018-11-06 19:11:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-06 19:11:56,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:11:56,045 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2018-11-06 19:11:56,045 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:11:56,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:11:56,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1570115156, now seen corresponding path program 1 times [2018-11-06 19:11:56,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:11:56,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:11:56,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:56,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:56,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:56,477 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:11:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:11:56,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:11:56,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:11:56,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:11:56,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:11:56,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:56,588 INFO L87 Difference]: Start difference. First operand 21708 states and 27055 transitions. Second operand 4 states. [2018-11-06 19:12:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:06,894 INFO L93 Difference]: Finished difference Result 64687 states and 81783 transitions. [2018-11-06 19:12:06,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:12:06,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-11-06 19:12:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:06,946 INFO L225 Difference]: With dead ends: 64687 [2018-11-06 19:12:06,946 INFO L226 Difference]: Without dead ends: 38998 [2018-11-06 19:12:06,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:07,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38998 states. [2018-11-06 19:12:07,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38998 to 35054. [2018-11-06 19:12:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35054 states. [2018-11-06 19:12:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35054 states to 35054 states and 41125 transitions. [2018-11-06 19:12:07,410 INFO L78 Accepts]: Start accepts. Automaton has 35054 states and 41125 transitions. Word has length 261 [2018-11-06 19:12:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:07,411 INFO L480 AbstractCegarLoop]: Abstraction has 35054 states and 41125 transitions. [2018-11-06 19:12:07,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:12:07,411 INFO L276 IsEmpty]: Start isEmpty. Operand 35054 states and 41125 transitions. [2018-11-06 19:12:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-06 19:12:07,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:07,417 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:07,417 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:07,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:07,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1991819509, now seen corresponding path program 1 times [2018-11-06 19:12:07,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:07,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:07,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:07,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:07,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 19:12:07,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:07,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:12:07,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:12:07,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:12:07,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:12:07,733 INFO L87 Difference]: Start difference. First operand 35054 states and 41125 transitions. Second operand 5 states. [2018-11-06 19:12:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:20,638 INFO L93 Difference]: Finished difference Result 114511 states and 134185 transitions. [2018-11-06 19:12:20,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:12:20,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2018-11-06 19:12:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:20,733 INFO L225 Difference]: With dead ends: 114511 [2018-11-06 19:12:20,734 INFO L226 Difference]: Without dead ends: 80247 [2018-11-06 19:12:20,768 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:12:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80247 states. [2018-11-06 19:12:21,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80247 to 76921. [2018-11-06 19:12:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76921 states. [2018-11-06 19:12:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76921 states to 76921 states and 88858 transitions. [2018-11-06 19:12:21,646 INFO L78 Accepts]: Start accepts. Automaton has 76921 states and 88858 transitions. Word has length 284 [2018-11-06 19:12:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:21,647 INFO L480 AbstractCegarLoop]: Abstraction has 76921 states and 88858 transitions. [2018-11-06 19:12:21,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:12:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 76921 states and 88858 transitions. [2018-11-06 19:12:21,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-06 19:12:21,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:21,653 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1] [2018-11-06 19:12:21,654 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:21,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:21,654 INFO L82 PathProgramCache]: Analyzing trace with hash 464366551, now seen corresponding path program 1 times [2018-11-06 19:12:21,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:21,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:21,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:21,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:21,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-06 19:12:21,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:21,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:12:21,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:12:21,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:12:21,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:21,975 INFO L87 Difference]: Start difference. First operand 76921 states and 88858 transitions. Second operand 4 states. [2018-11-06 19:12:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:29,431 INFO L93 Difference]: Finished difference Result 160132 states and 186218 transitions. [2018-11-06 19:12:29,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:12:29,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-11-06 19:12:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:29,536 INFO L225 Difference]: With dead ends: 160132 [2018-11-06 19:12:29,536 INFO L226 Difference]: Without dead ends: 84001 [2018-11-06 19:12:29,588 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84001 states. [2018-11-06 19:12:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84001 to 83211. [2018-11-06 19:12:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83211 states. [2018-11-06 19:12:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83211 states to 83211 states and 92870 transitions. [2018-11-06 19:12:30,338 INFO L78 Accepts]: Start accepts. Automaton has 83211 states and 92870 transitions. Word has length 306 [2018-11-06 19:12:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:30,338 INFO L480 AbstractCegarLoop]: Abstraction has 83211 states and 92870 transitions. [2018-11-06 19:12:30,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:12:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 83211 states and 92870 transitions. [2018-11-06 19:12:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-11-06 19:12:30,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:30,360 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:30,360 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:30,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:30,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1544791703, now seen corresponding path program 1 times [2018-11-06 19:12:30,361 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:30,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:30,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:30,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:30,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 684 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-11-06 19:12:30,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:30,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:12:30,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:12:30,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:12:30,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:30,915 INFO L87 Difference]: Start difference. First operand 83211 states and 92870 transitions. Second operand 4 states. [2018-11-06 19:12:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:40,560 INFO L93 Difference]: Finished difference Result 254685 states and 283833 transitions. [2018-11-06 19:12:40,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:12:40,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 472 [2018-11-06 19:12:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:40,767 INFO L225 Difference]: With dead ends: 254685 [2018-11-06 19:12:40,767 INFO L226 Difference]: Without dead ends: 170684 [2018-11-06 19:12:40,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170684 states. [2018-11-06 19:12:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170684 to 165930. [2018-11-06 19:12:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165930 states. [2018-11-06 19:12:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165930 states to 165930 states and 179340 transitions. [2018-11-06 19:12:43,105 INFO L78 Accepts]: Start accepts. Automaton has 165930 states and 179340 transitions. Word has length 472 [2018-11-06 19:12:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:43,106 INFO L480 AbstractCegarLoop]: Abstraction has 165930 states and 179340 transitions. [2018-11-06 19:12:43,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:12:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 165930 states and 179340 transitions. [2018-11-06 19:12:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-11-06 19:12:43,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:43,142 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:43,143 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:43,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:43,143 INFO L82 PathProgramCache]: Analyzing trace with hash -126964752, now seen corresponding path program 1 times [2018-11-06 19:12:43,143 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:43,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:43,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:43,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:43,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 19:12:43,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:43,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:12:43,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:12:43,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:12:43,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:43,821 INFO L87 Difference]: Start difference. First operand 165930 states and 179340 transitions. Second operand 4 states. [2018-11-06 19:12:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:53,590 INFO L93 Difference]: Finished difference Result 386233 states and 418040 transitions. [2018-11-06 19:12:53,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:12:53,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 579 [2018-11-06 19:12:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:53,855 INFO L225 Difference]: With dead ends: 386233 [2018-11-06 19:12:53,855 INFO L226 Difference]: Without dead ends: 220302 [2018-11-06 19:12:53,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220302 states. [2018-11-06 19:12:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220302 to 214749. [2018-11-06 19:12:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214749 states. [2018-11-06 19:12:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214749 states to 214749 states and 228649 transitions. [2018-11-06 19:12:55,954 INFO L78 Accepts]: Start accepts. Automaton has 214749 states and 228649 transitions. Word has length 579 [2018-11-06 19:12:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:55,955 INFO L480 AbstractCegarLoop]: Abstraction has 214749 states and 228649 transitions. [2018-11-06 19:12:55,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:12:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 214749 states and 228649 transitions. [2018-11-06 19:12:55,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2018-11-06 19:12:55,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:55,979 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:55,980 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:55,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:55,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1266617253, now seen corresponding path program 1 times [2018-11-06 19:12:55,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:55,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:55,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:55,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:55,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:56,410 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-11-06 19:12:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-11-06 19:12:57,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:57,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:12:57,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:12:57,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:12:57,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:57,800 INFO L87 Difference]: Start difference. First operand 214749 states and 228649 transitions. Second operand 4 states. [2018-11-06 19:13:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:09,138 INFO L93 Difference]: Finished difference Result 508396 states and 541467 transitions. [2018-11-06 19:13:09,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:13:09,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 664 [2018-11-06 19:13:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:09,519 INFO L225 Difference]: With dead ends: 508396 [2018-11-06 19:13:09,519 INFO L226 Difference]: Without dead ends: 294437 [2018-11-06 19:13:09,614 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294437 states. [2018-11-06 19:13:13,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294437 to 287255. [2018-11-06 19:13:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287255 states. [2018-11-06 19:13:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287255 states to 287255 states and 304976 transitions. [2018-11-06 19:13:13,653 INFO L78 Accepts]: Start accepts. Automaton has 287255 states and 304976 transitions. Word has length 664 [2018-11-06 19:13:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:13,654 INFO L480 AbstractCegarLoop]: Abstraction has 287255 states and 304976 transitions. [2018-11-06 19:13:13,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:13:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 287255 states and 304976 transitions. [2018-11-06 19:13:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2018-11-06 19:13:13,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:13,678 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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-11-06 19:13:13,678 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:13,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:13,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1250965412, now seen corresponding path program 1 times [2018-11-06 19:13:13,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:13,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:13,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:13,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:13,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2018-11-06 19:13:14,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:14,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:13:14,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:14,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:14,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:14,329 INFO L87 Difference]: Start difference. First operand 287255 states and 304976 transitions. Second operand 4 states. [2018-11-06 19:13:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:29,220 INFO L93 Difference]: Finished difference Result 569785 states and 605035 transitions. [2018-11-06 19:13:29,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:13:29,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 694 [2018-11-06 19:13:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:29,646 INFO L225 Difference]: With dead ends: 569785 [2018-11-06 19:13:29,647 INFO L226 Difference]: Without dead ends: 283320 [2018-11-06 19:13:29,781 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283320 states. [2018-11-06 19:13:33,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283320 to 278585. [2018-11-06 19:13:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278585 states. [2018-11-06 19:13:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278585 states to 278585 states and 292740 transitions. [2018-11-06 19:13:34,286 INFO L78 Accepts]: Start accepts. Automaton has 278585 states and 292740 transitions. Word has length 694 [2018-11-06 19:13:34,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:34,287 INFO L480 AbstractCegarLoop]: Abstraction has 278585 states and 292740 transitions. [2018-11-06 19:13:34,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:13:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 278585 states and 292740 transitions. [2018-11-06 19:13:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2018-11-06 19:13:34,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:34,332 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2018-11-06 19:13:34,332 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:34,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:34,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2142948040, now seen corresponding path program 1 times [2018-11-06 19:13:34,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:34,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:34,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:34,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:34,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:35,123 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:13:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 1168 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2018-11-06 19:13:35,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:35,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:13:35,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:35,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:35,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:35,937 INFO L87 Difference]: Start difference. First operand 278585 states and 292740 transitions. Second operand 4 states. [2018-11-06 19:13:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:44,963 INFO L93 Difference]: Finished difference Result 551668 states and 579892 transitions. [2018-11-06 19:13:44,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:13:44,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 787 [2018-11-06 19:13:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:45,338 INFO L225 Difference]: With dead ends: 551668 [2018-11-06 19:13:45,338 INFO L226 Difference]: Without dead ends: 273873 [2018-11-06 19:13:45,495 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273873 states. [2018-11-06 19:13:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273873 to 270691. [2018-11-06 19:13:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270691 states. [2018-11-06 19:13:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270691 states to 270691 states and 280137 transitions. [2018-11-06 19:13:49,886 INFO L78 Accepts]: Start accepts. Automaton has 270691 states and 280137 transitions. Word has length 787 [2018-11-06 19:13:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:49,886 INFO L480 AbstractCegarLoop]: Abstraction has 270691 states and 280137 transitions. [2018-11-06 19:13:49,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:13:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 270691 states and 280137 transitions. [2018-11-06 19:13:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 911 [2018-11-06 19:13:49,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:49,934 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:13:49,935 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:49,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash -54212809, now seen corresponding path program 1 times [2018-11-06 19:13:49,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:49,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:49,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:49,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:49,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1628 backedges. 1207 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2018-11-06 19:13:52,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:52,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:13:52,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:13:52,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:13:52,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:13:52,127 INFO L87 Difference]: Start difference. First operand 270691 states and 280137 transitions. Second operand 5 states. [2018-11-06 19:14:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:03,484 INFO L93 Difference]: Finished difference Result 662019 states and 684284 transitions. [2018-11-06 19:14:03,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:14:03,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 910 [2018-11-06 19:14:03,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:04,797 INFO L225 Difference]: With dead ends: 662019 [2018-11-06 19:14:04,797 INFO L226 Difference]: Without dead ends: 392118 [2018-11-06 19:14:04,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:14:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392118 states. [2018-11-06 19:14:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392118 to 345577. [2018-11-06 19:14:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345577 states. [2018-11-06 19:14:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345577 states to 345577 states and 356425 transitions. [2018-11-06 19:14:14,460 INFO L78 Accepts]: Start accepts. Automaton has 345577 states and 356425 transitions. Word has length 910 [2018-11-06 19:14:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:14,460 INFO L480 AbstractCegarLoop]: Abstraction has 345577 states and 356425 transitions. [2018-11-06 19:14:14,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:14:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 345577 states and 356425 transitions. [2018-11-06 19:14:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2018-11-06 19:14:14,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:14,506 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:14:14,506 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:14,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:14,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1308105528, now seen corresponding path program 1 times [2018-11-06 19:14:14,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:14,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:14,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:14,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:14,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1170 backedges. 909 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-06 19:14:17,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:17,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:14:17,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:14:17,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:14:17,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:14:17,113 INFO L87 Difference]: Start difference. First operand 345577 states and 356425 transitions. Second operand 5 states. Received shutdown request... [2018-11-06 19:14:22,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:14:22,713 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:14:22,719 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:14:22,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:14:22 BoogieIcfgContainer [2018-11-06 19:14:22,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:14:22,721 INFO L168 Benchmark]: Toolchain (without parser) took 218967.14 ms. Allocated memory was 1.5 GB in the beginning and 4.4 GB in the end (delta: 2.9 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-06 19:14:22,722 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:14:22,723 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2521.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:14:22,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 795.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -943.3 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:14:22,724 INFO L168 Benchmark]: Boogie Preprocessor took 502.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 70.5 MB). Peak memory consumption was 70.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:14:22,725 INFO L168 Benchmark]: RCFGBuilder took 10225.90 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 285.7 MB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: -46.0 MB). Peak memory consumption was 599.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:14:22,726 INFO L168 Benchmark]: TraceAbstraction took 204917.68 ms. Allocated memory was 2.5 GB in the beginning and 4.4 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -423.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-06 19:14:22,731 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2521.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 795.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -943.3 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 502.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 70.5 MB). Peak memory consumption was 70.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10225.90 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 285.7 MB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: -46.0 MB). Peak memory consumption was 599.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 204917.68 ms. Allocated memory was 2.5 GB in the beginning and 4.4 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -423.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 63). Cancelled while BasicCegarLoop was constructing difference of abstraction (345577states) and FLOYD_HOARE automaton (currently 5 states, 5 states before enhancement),while ReachableStatesComputation was computing reachable states (38191 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 204.8s OverallTime, 15 OverallIterations, 7 TraceHistogramMax, 161.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12304 SDtfs, 34237 SDslu, 3369 SDs, 0 SdLazy, 66720 SolverSat, 17559 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 114.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=345577occurred in iteration=14, 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: 29.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 82602 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 6377 NumberOfCodeBlocks, 6377 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 6362 ConstructedInterpolants, 0 QuantifiedInterpolants, 7233413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 8315/8315 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown