java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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_label54_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:12:26,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:12:26,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:12:26,570 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:12:26,570 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:12:26,571 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:12:26,572 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:12:26,574 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:12:26,576 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:12:26,577 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:12:26,578 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:12:26,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:12:26,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:12:26,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:12:26,581 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:12:26,582 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:12:26,583 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:12:26,585 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:12:26,587 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:12:26,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:12:26,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:12:26,594 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:12:26,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:12:26,604 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:12:26,604 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:12:26,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:12:26,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:12:26,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:12:26,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:12:26,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:12:26,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:12:26,613 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:12:26,613 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:12:26,614 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:12:26,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:12:26,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:12:26,617 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:12:26,632 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:12:26,632 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:12:26,633 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:12:26,633 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:12:26,634 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:12:26,634 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:12:26,634 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:12:26,635 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:12:26,635 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:12:26,635 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:12:26,635 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:12:26,636 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:12:26,636 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:12:26,636 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:12:26,636 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:12:26,636 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:12:26,637 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:12:26,637 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:12:26,637 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:12:26,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:12:26,637 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:12:26,638 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:12:26,638 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:12:26,638 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:12:26,638 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:12:26,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:12:26,639 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:12:26,639 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:12:26,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:12:26,694 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:12:26,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:12:26,699 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:12:26,699 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:12:26,700 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label54_false-unreach-call.c [2018-10-24 14:12:26,760 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/86b66767b/d47a65f09eb1441db461ea93295d7654/FLAG17f7e22a7 [2018-10-24 14:12:27,650 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:12:27,651 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label54_false-unreach-call.c [2018-10-24 14:12:27,706 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/86b66767b/d47a65f09eb1441db461ea93295d7654/FLAG17f7e22a7 [2018-10-24 14:12:27,727 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/86b66767b/d47a65f09eb1441db461ea93295d7654 [2018-10-24 14:12:27,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:12:27,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:12:27,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:12:27,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:12:27,750 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:12:27,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:12:27" (1/1) ... [2018-10-24 14:12:27,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b692d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:27, skipping insertion in model container [2018-10-24 14:12:27,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:12:27" (1/1) ... [2018-10-24 14:12:27,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:12:27,936 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:12:29,533 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:12:29,538 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:12:30,147 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:12:30,180 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:12:30,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:30 WrapperNode [2018-10-24 14:12:30,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:12:30,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:12:30,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:12:30,182 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:12:30,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:30" (1/1) ... [2018-10-24 14:12:30,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:30" (1/1) ... [2018-10-24 14:12:31,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:12:31,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:12:31,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:12:31,031 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:12:31,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:30" (1/1) ... [2018-10-24 14:12:31,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:30" (1/1) ... [2018-10-24 14:12:31,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:30" (1/1) ... [2018-10-24 14:12:31,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:30" (1/1) ... [2018-10-24 14:12:31,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:30" (1/1) ... [2018-10-24 14:12:31,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:30" (1/1) ... [2018-10-24 14:12:31,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:30" (1/1) ... [2018-10-24 14:12:31,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:12:31,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:12:31,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:12:31,534 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:12:31,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:12:31,611 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:12:31,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:12:31,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:12:45,391 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:12:45,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:12:45 BoogieIcfgContainer [2018-10-24 14:12:45,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:12:45,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:12:45,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:12:45,397 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:12:45,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:12:27" (1/3) ... [2018-10-24 14:12:45,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba9318c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:12:45, skipping insertion in model container [2018-10-24 14:12:45,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:30" (2/3) ... [2018-10-24 14:12:45,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba9318c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:12:45, skipping insertion in model container [2018-10-24 14:12:45,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:12:45" (3/3) ... [2018-10-24 14:12:45,401 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label54_false-unreach-call.c [2018-10-24 14:12:45,412 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:12:45,422 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:12:45,440 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:12:45,485 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:12:45,486 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:12:45,486 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:12:45,486 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:12:45,486 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:12:45,487 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:12:45,487 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:12:45,487 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:12:45,487 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:12:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-10-24 14:12:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-24 14:12:45,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:12:45,540 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 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-10-24 14:12:45,542 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:12:45,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:12:45,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1880720510, now seen corresponding path program 1 times [2018-10-24 14:12:45,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:12:45,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:12:45,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:45,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:12:45,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:12:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:12:45,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:12:45,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:12:45,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:12:46,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:12:46,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:12:46,017 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-10-24 14:13:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:13:00,472 INFO L93 Difference]: Finished difference Result 3973 states and 7416 transitions. [2018-10-24 14:13:00,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:13:00,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-24 14:13:00,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:13:00,523 INFO L225 Difference]: With dead ends: 3973 [2018-10-24 14:13:00,523 INFO L226 Difference]: Without dead ends: 2867 [2018-10-24 14:13:00,531 INFO L605 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-10-24 14:13:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2018-10-24 14:13:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1938. [2018-10-24 14:13:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2018-10-24 14:13:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 3240 transitions. [2018-10-24 14:13:00,681 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 3240 transitions. Word has length 28 [2018-10-24 14:13:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:13:00,681 INFO L481 AbstractCegarLoop]: Abstraction has 1938 states and 3240 transitions. [2018-10-24 14:13:00,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:13:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 3240 transitions. [2018-10-24 14:13:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-24 14:13:00,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:13:00,690 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:13:00,690 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:13:00,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:13:00,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1373493925, now seen corresponding path program 1 times [2018-10-24 14:13:00,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:13:00,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:13:00,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:00,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:13:00,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:13:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:13:00,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:13:00,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:13:00,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:13:00,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:13:00,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:13:00,955 INFO L87 Difference]: Start difference. First operand 1938 states and 3240 transitions. Second operand 4 states. [2018-10-24 14:13:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:13:20,307 INFO L93 Difference]: Finished difference Result 7101 states and 12101 transitions. [2018-10-24 14:13:20,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:13:20,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-10-24 14:13:20,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:13:20,337 INFO L225 Difference]: With dead ends: 7101 [2018-10-24 14:13:20,338 INFO L226 Difference]: Without dead ends: 5165 [2018-10-24 14:13:20,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:13:20,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2018-10-24 14:13:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 3540. [2018-10-24 14:13:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3540 states. [2018-10-24 14:13:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 5445 transitions. [2018-10-24 14:13:20,427 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 5445 transitions. Word has length 100 [2018-10-24 14:13:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:13:20,428 INFO L481 AbstractCegarLoop]: Abstraction has 3540 states and 5445 transitions. [2018-10-24 14:13:20,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:13:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 5445 transitions. [2018-10-24 14:13:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-24 14:13:20,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:13:20,432 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:13:20,433 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:13:20,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:13:20,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1648295608, now seen corresponding path program 1 times [2018-10-24 14:13:20,433 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:13:20,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:13:20,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:20,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:13:20,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:13:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:13:20,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:13:20,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:13:20,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:13:20,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:13:20,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:13:20,705 INFO L87 Difference]: Start difference. First operand 3540 states and 5445 transitions. Second operand 4 states. [2018-10-24 14:13:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:13:36,363 INFO L93 Difference]: Finished difference Result 13554 states and 21081 transitions. [2018-10-24 14:13:36,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:13:36,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-10-24 14:13:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:13:36,413 INFO L225 Difference]: With dead ends: 13554 [2018-10-24 14:13:36,413 INFO L226 Difference]: Without dead ends: 10016 [2018-10-24 14:13:36,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:13:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10016 states. [2018-10-24 14:13:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10016 to 6718. [2018-10-24 14:13:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6718 states. [2018-10-24 14:13:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6718 states to 6718 states and 9885 transitions. [2018-10-24 14:13:36,561 INFO L78 Accepts]: Start accepts. Automaton has 6718 states and 9885 transitions. Word has length 114 [2018-10-24 14:13:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:13:36,562 INFO L481 AbstractCegarLoop]: Abstraction has 6718 states and 9885 transitions. [2018-10-24 14:13:36,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:13:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 6718 states and 9885 transitions. [2018-10-24 14:13:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-24 14:13:36,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:13:36,567 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:13:36,567 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:13:36,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:13:36,567 INFO L82 PathProgramCache]: Analyzing trace with hash -394755061, now seen corresponding path program 1 times [2018-10-24 14:13:36,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:13:36,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:13:36,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:36,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:13:36,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:13:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:13:36,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:13:36,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:13:36,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:13:36,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:13:36,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:13:36,749 INFO L87 Difference]: Start difference. First operand 6718 states and 9885 transitions. Second operand 4 states. [2018-10-24 14:13:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:13:49,380 INFO L93 Difference]: Finished difference Result 23854 states and 35012 transitions. [2018-10-24 14:13:49,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:13:49,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-10-24 14:13:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:13:49,434 INFO L225 Difference]: With dead ends: 23854 [2018-10-24 14:13:49,435 INFO L226 Difference]: Without dead ends: 17138 [2018-10-24 14:13:49,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:13:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17138 states. [2018-10-24 14:13:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17138 to 13037. [2018-10-24 14:13:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13037 states. [2018-10-24 14:13:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13037 states to 13037 states and 18976 transitions. [2018-10-24 14:13:49,707 INFO L78 Accepts]: Start accepts. Automaton has 13037 states and 18976 transitions. Word has length 132 [2018-10-24 14:13:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:13:49,708 INFO L481 AbstractCegarLoop]: Abstraction has 13037 states and 18976 transitions. [2018-10-24 14:13:49,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:13:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 13037 states and 18976 transitions. [2018-10-24 14:13:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-24 14:13:49,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:13:49,711 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:13:49,711 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:13:49,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:13:49,712 INFO L82 PathProgramCache]: Analyzing trace with hash -83044117, now seen corresponding path program 1 times [2018-10-24 14:13:49,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:13:49,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:13:49,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:49,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:13:49,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:13:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:13:50,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:13:50,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:13:50,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:13:50,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:13:50,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:13:50,120 INFO L87 Difference]: Start difference. First operand 13037 states and 18976 transitions. Second operand 4 states. [2018-10-24 14:14:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:14:02,469 INFO L93 Difference]: Finished difference Result 51334 states and 74903 transitions. [2018-10-24 14:14:02,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:14:02,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-10-24 14:14:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:14:02,540 INFO L225 Difference]: With dead ends: 51334 [2018-10-24 14:14:02,541 INFO L226 Difference]: Without dead ends: 38299 [2018-10-24 14:14:02,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-24 14:14:02,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38299 states. [2018-10-24 14:14:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38299 to 38259. [2018-10-24 14:14:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38259 states. [2018-10-24 14:14:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38259 states to 38259 states and 50689 transitions. [2018-10-24 14:14:03,239 INFO L78 Accepts]: Start accepts. Automaton has 38259 states and 50689 transitions. Word has length 162 [2018-10-24 14:14:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:14:03,239 INFO L481 AbstractCegarLoop]: Abstraction has 38259 states and 50689 transitions. [2018-10-24 14:14:03,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:14:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 38259 states and 50689 transitions. [2018-10-24 14:14:03,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-24 14:14:03,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:14:03,246 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:14:03,246 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:14:03,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:14:03,246 INFO L82 PathProgramCache]: Analyzing trace with hash 821999137, now seen corresponding path program 1 times [2018-10-24 14:14:03,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:14:03,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:14:03,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:03,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:14:03,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:14:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:14:03,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:14:03,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:14:03,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:14:03,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:14:03,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:14:03,998 INFO L87 Difference]: Start difference. First operand 38259 states and 50689 transitions. Second operand 4 states. [2018-10-24 14:14:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:14:14,812 INFO L93 Difference]: Finished difference Result 130933 states and 171774 transitions. [2018-10-24 14:14:14,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:14:14,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-10-24 14:14:14,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:14:14,965 INFO L225 Difference]: With dead ends: 130933 [2018-10-24 14:14:14,965 INFO L226 Difference]: Without dead ends: 92676 [2018-10-24 14:14:15,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-24 14:14:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92676 states. [2018-10-24 14:14:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92676 to 72143. [2018-10-24 14:14:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72143 states. [2018-10-24 14:14:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72143 states to 72143 states and 90430 transitions. [2018-10-24 14:14:16,509 INFO L78 Accepts]: Start accepts. Automaton has 72143 states and 90430 transitions. Word has length 166 [2018-10-24 14:14:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:14:16,509 INFO L481 AbstractCegarLoop]: Abstraction has 72143 states and 90430 transitions. [2018-10-24 14:14:16,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:14:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 72143 states and 90430 transitions. [2018-10-24 14:14:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-24 14:14:16,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:14:16,517 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 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-10-24 14:14:16,517 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:14:16,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:14:16,517 INFO L82 PathProgramCache]: Analyzing trace with hash 259007377, now seen corresponding path program 1 times [2018-10-24 14:14:16,517 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:14:16,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:14:16,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:16,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:14:16,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:14:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-10-24 14:14:16,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:14:16,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:14:16,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:14:16,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:14:16,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:14:16,810 INFO L87 Difference]: Start difference. First operand 72143 states and 90430 transitions. Second operand 3 states. [2018-10-24 14:14:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:14:26,222 INFO L93 Difference]: Finished difference Result 201016 states and 251696 transitions. [2018-10-24 14:14:26,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:14:26,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2018-10-24 14:14:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:14:26,398 INFO L225 Difference]: With dead ends: 201016 [2018-10-24 14:14:26,398 INFO L226 Difference]: Without dead ends: 128875 [2018-10-24 14:14:26,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:14:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128875 states. [2018-10-24 14:14:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128875 to 128084. [2018-10-24 14:14:28,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128084 states. [2018-10-24 14:14:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128084 states to 128084 states and 150897 transitions. [2018-10-24 14:14:28,724 INFO L78 Accepts]: Start accepts. Automaton has 128084 states and 150897 transitions. Word has length 260 [2018-10-24 14:14:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:14:28,725 INFO L481 AbstractCegarLoop]: Abstraction has 128084 states and 150897 transitions. [2018-10-24 14:14:28,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:14:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 128084 states and 150897 transitions. [2018-10-24 14:14:28,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-24 14:14:28,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:14:28,732 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-24 14:14:28,732 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:14:28,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:14:28,732 INFO L82 PathProgramCache]: Analyzing trace with hash -638506597, now seen corresponding path program 1 times [2018-10-24 14:14:28,732 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:14:28,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:14:28,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:28,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:14:28,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:14:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-24 14:14:29,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:14:29,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:14:29,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:14:29,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:14:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:14:29,146 INFO L87 Difference]: Start difference. First operand 128084 states and 150897 transitions. Second operand 5 states. [2018-10-24 14:14:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:14:42,223 INFO L93 Difference]: Finished difference Result 268007 states and 314360 transitions. [2018-10-24 14:14:42,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:14:42,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 264 [2018-10-24 14:14:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:14:42,376 INFO L225 Difference]: With dead ends: 268007 [2018-10-24 14:14:42,376 INFO L226 Difference]: Without dead ends: 139925 [2018-10-24 14:14:42,457 INFO L605 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-10-24 14:14:42,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139925 states. [2018-10-24 14:14:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139925 to 138328. [2018-10-24 14:14:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138328 states. [2018-10-24 14:14:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138328 states to 138328 states and 161451 transitions. [2018-10-24 14:14:43,818 INFO L78 Accepts]: Start accepts. Automaton has 138328 states and 161451 transitions. Word has length 264 [2018-10-24 14:14:43,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:14:43,819 INFO L481 AbstractCegarLoop]: Abstraction has 138328 states and 161451 transitions. [2018-10-24 14:14:43,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:14:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 138328 states and 161451 transitions. [2018-10-24 14:14:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-24 14:14:43,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:14:43,828 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:14:43,829 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:14:43,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:14:43,829 INFO L82 PathProgramCache]: Analyzing trace with hash -604590294, now seen corresponding path program 1 times [2018-10-24 14:14:43,829 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:14:43,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:14:43,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:43,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:14:43,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:14:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 14:14:44,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:14:44,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:14:44,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:14:44,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:14:44,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:14:44,295 INFO L87 Difference]: Start difference. First operand 138328 states and 161451 transitions. Second operand 5 states. [2018-10-24 14:15:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:15:07,261 INFO L93 Difference]: Finished difference Result 362067 states and 425536 transitions. [2018-10-24 14:15:07,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:15:07,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 328 [2018-10-24 14:15:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:15:07,493 INFO L225 Difference]: With dead ends: 362067 [2018-10-24 14:15:07,493 INFO L226 Difference]: Without dead ends: 224529 [2018-10-24 14:15:07,575 INFO L605 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-10-24 14:15:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224529 states. [2018-10-24 14:15:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224529 to 214864. [2018-10-24 14:15:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214864 states. [2018-10-24 14:15:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214864 states to 214864 states and 249636 transitions. [2018-10-24 14:15:10,714 INFO L78 Accepts]: Start accepts. Automaton has 214864 states and 249636 transitions. Word has length 328 [2018-10-24 14:15:10,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:15:10,715 INFO L481 AbstractCegarLoop]: Abstraction has 214864 states and 249636 transitions. [2018-10-24 14:15:10,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:15:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 214864 states and 249636 transitions. [2018-10-24 14:15:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-10-24 14:15:10,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:15:10,723 INFO L375 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-10-24 14:15:10,724 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:15:10,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:15:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1490097149, now seen corresponding path program 1 times [2018-10-24 14:15:10,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:15:10,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:15:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:15:10,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:15:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:15:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:15:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2018-10-24 14:15:12,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:15:12,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:15:12,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:15:12,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:15:12,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:15:12,357 INFO L87 Difference]: Start difference. First operand 214864 states and 249636 transitions. Second operand 4 states. [2018-10-24 14:15:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:15:25,531 INFO L93 Difference]: Finished difference Result 528281 states and 614630 transitions. [2018-10-24 14:15:25,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:15:25,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2018-10-24 14:15:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:15:25,882 INFO L225 Difference]: With dead ends: 528281 [2018-10-24 14:15:25,882 INFO L226 Difference]: Without dead ends: 314207 [2018-10-24 14:15:25,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:15:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314207 states. [2018-10-24 14:15:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314207 to 310213. [2018-10-24 14:15:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310213 states. [2018-10-24 14:15:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310213 states to 310213 states and 351116 transitions. [2018-10-24 14:15:36,019 INFO L78 Accepts]: Start accepts. Automaton has 310213 states and 351116 transitions. Word has length 361 [2018-10-24 14:15:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:15:36,019 INFO L481 AbstractCegarLoop]: Abstraction has 310213 states and 351116 transitions. [2018-10-24 14:15:36,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:15:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 310213 states and 351116 transitions. [2018-10-24 14:15:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-24 14:15:36,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:15:36,031 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:15:36,031 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:15:36,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:15:36,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1077182117, now seen corresponding path program 1 times [2018-10-24 14:15:36,032 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:15:36,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:15:36,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:15:36,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:15:36,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:15:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:15:36,466 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:15:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 14:15:36,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:15:36,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:15:36,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:15:36,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:15:36,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:15:36,689 INFO L87 Difference]: Start difference. First operand 310213 states and 351116 transitions. Second operand 4 states. [2018-10-24 14:15:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:15:50,205 INFO L93 Difference]: Finished difference Result 633031 states and 715879 transitions. [2018-10-24 14:15:50,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:15:50,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2018-10-24 14:15:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:15:50,491 INFO L225 Difference]: With dead ends: 633031 [2018-10-24 14:15:50,491 INFO L226 Difference]: Without dead ends: 282564 [2018-10-24 14:15:50,609 INFO L605 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-10-24 14:15:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282564 states. [2018-10-24 14:15:53,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282564 to 266802. [2018-10-24 14:15:53,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266802 states. [2018-10-24 14:15:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266802 states to 266802 states and 297621 transitions. [2018-10-24 14:15:54,107 INFO L78 Accepts]: Start accepts. Automaton has 266802 states and 297621 transitions. Word has length 409 [2018-10-24 14:15:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:15:54,107 INFO L481 AbstractCegarLoop]: Abstraction has 266802 states and 297621 transitions. [2018-10-24 14:15:54,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:15:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 266802 states and 297621 transitions. [2018-10-24 14:15:54,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-24 14:15:54,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:15:54,117 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:15:54,117 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:15:54,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:15:54,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1814472154, now seen corresponding path program 1 times [2018-10-24 14:15:54,117 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:15:54,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:15:54,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:15:54,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:15:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:15:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:15:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 431 proven. 5 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2018-10-24 14:15:55,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:15:55,289 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:15:55,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:15:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:15:55,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:15:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-10-24 14:15:55,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:15:55,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-24 14:15:55,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:15:55,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:15:55,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:15:55,786 INFO L87 Difference]: Start difference. First operand 266802 states and 297621 transitions. Second operand 5 states. [2018-10-24 14:16:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:16:07,962 INFO L93 Difference]: Finished difference Result 534372 states and 596669 transitions. [2018-10-24 14:16:07,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:16:07,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 466 [2018-10-24 14:16:07,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:16:08,330 INFO L225 Difference]: With dead ends: 534372 [2018-10-24 14:16:08,330 INFO L226 Difference]: Without dead ends: 267572 [2018-10-24 14:16:08,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 467 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 Received shutdown request... [2018-10-24 14:16:08,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267572 states. [2018-10-24 14:16:08,661 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:16:08,665 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:16:08,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:16:08 BoogieIcfgContainer [2018-10-24 14:16:08,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:16:08,666 INFO L168 Benchmark]: Toolchain (without parser) took 220926.25 ms. Allocated memory was 1.5 GB in the beginning and 4.7 GB in the end (delta: 3.1 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -13.4 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-10-24 14:16:08,667 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:16:08,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2438.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:16:08,669 INFO L168 Benchmark]: Boogie Procedure Inliner took 849.02 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 827.9 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 73.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:16:08,670 INFO L168 Benchmark]: Boogie Preprocessor took 502.35 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. [2018-10-24 14:16:08,670 INFO L168 Benchmark]: RCFGBuilder took 13859.03 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 230.2 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 50.2 MB). Peak memory consumption was 593.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:16:08,671 INFO L168 Benchmark]: TraceAbstraction took 203271.71 ms. Allocated memory was 2.6 GB in the beginning and 4.7 GB in the end (delta: 2.1 GB). Free memory was 2.1 GB in the beginning and 1.4 GB in the end (delta: 643.7 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-10-24 14:16:08,678 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2438.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 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 849.02 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 827.9 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 73.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 502.35 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13859.03 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 230.2 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 50.2 MB). Peak memory consumption was 593.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 203271.71 ms. Allocated memory was 2.6 GB in the beginning and 4.7 GB in the end (delta: 2.1 GB). Free memory was 2.1 GB in the beginning and 1.4 GB in the end (delta: 643.7 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 93). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 203.1s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 172.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10780 SDtfs, 25001 SDslu, 3712 SDs, 0 SdLazy, 63494 SolverSat, 14196 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 139.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 479 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310213occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 23.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 62335 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 3256 NumberOfCodeBlocks, 3256 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3243 ConstructedInterpolants, 0 QuantifiedInterpolants, 2422465 SizeOfPredicates, 1 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 3716/3721 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown