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/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label52_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 19:00:06,371 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 19:00:06,373 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 19:00:06,392 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 19:00:06,392 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 19:00:06,394 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 19:00:06,395 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 19:00:06,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 19:00:06,399 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 19:00:06,399 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 19:00:06,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 19:00:06,401 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 19:00:06,402 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 19:00:06,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 19:00:06,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 19:00:06,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 19:00:06,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 19:00:06,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 19:00:06,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 19:00:06,416 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 19:00:06,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 19:00:06,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 19:00:06,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 19:00:06,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 19:00:06,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 19:00:06,424 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 19:00:06,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 19:00:06,426 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 19:00:06,427 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 19:00:06,428 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 19:00:06,428 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 19:00:06,429 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 19:00:06,429 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 19:00:06,429 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 19:00:06,430 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 19:00:06,431 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 19:00:06,431 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 19:00:06,446 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 19:00:06,446 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 19:00:06,447 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 19:00:06,447 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 19:00:06,448 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 19:00:06,448 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 19:00:06,448 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 19:00:06,448 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 19:00:06,449 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 19:00:06,449 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 19:00:06,449 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 19:00:06,449 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 19:00:06,449 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 19:00:06,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 19:00:06,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 19:00:06,451 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 19:00:06,451 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 19:00:06,451 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 19:00:06,451 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 19:00:06,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 19:00:06,452 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 19:00:06,452 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 19:00:06,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 19:00:06,452 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 19:00:06,452 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 19:00:06,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 19:00:06,453 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 19:00:06,453 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 19:00:06,453 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 19:00:06,453 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 19:00:06,454 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 19:00:06,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 19:00:06,454 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 19:00:06,454 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 19:00:06,455 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 19:00:06,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 19:00:06,513 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 19:00:06,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 19:00:06,520 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 19:00:06,521 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 19:00:06,522 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label52_true-unreach-call.c [2018-11-12 19:00:06,588 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657a7325e/1a1722a73d1044deb5b26cf84c78d100/FLAGd672dc2cf [2018-11-12 19:00:07,423 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 19:00:07,424 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label52_true-unreach-call.c [2018-11-12 19:00:07,456 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657a7325e/1a1722a73d1044deb5b26cf84c78d100/FLAGd672dc2cf [2018-11-12 19:00:07,474 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657a7325e/1a1722a73d1044deb5b26cf84c78d100 [2018-11-12 19:00:07,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 19:00:07,488 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 19:00:07,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 19:00:07,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 19:00:07,494 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 19:00:07,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:00:07" (1/1) ... [2018-11-12 19:00:07,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2015b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:07, skipping insertion in model container [2018-11-12 19:00:07,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:00:07" (1/1) ... [2018-11-12 19:00:07,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 19:00:07,687 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 19:00:09,114 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:00:09,119 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 19:00:09,890 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:00:09,934 INFO L193 MainTranslator]: Completed translation [2018-11-12 19:00:09,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:09 WrapperNode [2018-11-12 19:00:09,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 19:00:09,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 19:00:09,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 19:00:09,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 19:00:09,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:09" (1/1) ... [2018-11-12 19:00:10,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:09" (1/1) ... [2018-11-12 19:00:10,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 19:00:10,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 19:00:10,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 19:00:10,389 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 19:00:10,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:09" (1/1) ... [2018-11-12 19:00:10,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:09" (1/1) ... [2018-11-12 19:00:10,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:09" (1/1) ... [2018-11-12 19:00:10,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:09" (1/1) ... [2018-11-12 19:00:10,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:09" (1/1) ... [2018-11-12 19:00:10,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:09" (1/1) ... [2018-11-12 19:00:10,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:09" (1/1) ... [2018-11-12 19:00:10,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 19:00:10,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 19:00:10,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 19:00:10,681 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 19:00:10,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:09" (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-12 19:00:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 19:00:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 19:00:10,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 19:00:10,749 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-11-12 19:00:10,749 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-11-12 19:00:10,749 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-12 19:00:10,750 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-12 19:00:10,750 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-12 19:00:10,750 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-12 19:00:10,750 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 19:00:10,750 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 19:00:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 19:00:10,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 19:00:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 19:00:10,752 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 19:00:20,849 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 19:00:20,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:00:20 BoogieIcfgContainer [2018-11-12 19:00:20,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 19:00:20,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 19:00:20,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 19:00:20,860 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 19:00:20,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:00:07" (1/3) ... [2018-11-12 19:00:20,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427b18b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:00:20, skipping insertion in model container [2018-11-12 19:00:20,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:09" (2/3) ... [2018-11-12 19:00:20,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427b18b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:00:20, skipping insertion in model container [2018-11-12 19:00:20,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:00:20" (3/3) ... [2018-11-12 19:00:20,865 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label52_true-unreach-call.c [2018-11-12 19:00:20,875 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 19:00:20,889 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 19:00:20,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 19:00:20,957 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 19:00:20,957 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 19:00:20,957 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 19:00:20,957 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 19:00:20,958 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 19:00:20,958 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 19:00:20,958 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 19:00:20,958 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 19:00:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-11-12 19:00:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-12 19:00:21,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:00:21,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:00:21,022 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:00:21,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:00:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash -774157709, now seen corresponding path program 1 times [2018-11-12 19:00:21,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:00:21,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:00:21,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:00:21,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:00:21,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:00:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:00:21,606 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:00:21,765 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-12 19:00:21,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:00:21,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:00:21,768 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:00:21,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:00:21,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:00:21,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:00:21,793 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-11-12 19:00:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:00:30,666 INFO L93 Difference]: Finished difference Result 3093 states and 5715 transitions. [2018-11-12 19:00:30,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:00:30,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-12 19:00:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:00:30,705 INFO L225 Difference]: With dead ends: 3093 [2018-11-12 19:00:30,706 INFO L226 Difference]: Without dead ends: 1971 [2018-11-12 19:00:30,719 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:00:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2018-11-12 19:00:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1957. [2018-11-12 19:00:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1957 states. [2018-11-12 19:00:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3535 transitions. [2018-11-12 19:00:30,912 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3535 transitions. Word has length 71 [2018-11-12 19:00:30,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:00:30,914 INFO L480 AbstractCegarLoop]: Abstraction has 1957 states and 3535 transitions. [2018-11-12 19:00:30,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:00:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3535 transitions. [2018-11-12 19:00:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-12 19:00:30,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:00:30,931 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 19:00:30,931 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:00:30,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:00:30,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1438454356, now seen corresponding path program 1 times [2018-11-12 19:00:30,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:00:30,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:00:30,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:00:30,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:00:30,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:00:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:00:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:00:31,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:00:31,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:00:31,416 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:00:31,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:00:31,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:00:31,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:00:31,419 INFO L87 Difference]: Start difference. First operand 1957 states and 3535 transitions. Second operand 6 states. [2018-11-12 19:00:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:00:46,526 INFO L93 Difference]: Finished difference Result 5630 states and 10205 transitions. [2018-11-12 19:00:46,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:00:46,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2018-11-12 19:00:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:00:46,557 INFO L225 Difference]: With dead ends: 5630 [2018-11-12 19:00:46,557 INFO L226 Difference]: Without dead ends: 3679 [2018-11-12 19:00:46,566 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 19:00:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2018-11-12 19:00:46,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3636. [2018-11-12 19:00:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3636 states. [2018-11-12 19:00:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5828 transitions. [2018-11-12 19:00:46,675 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5828 transitions. Word has length 154 [2018-11-12 19:00:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:00:46,676 INFO L480 AbstractCegarLoop]: Abstraction has 3636 states and 5828 transitions. [2018-11-12 19:00:46,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:00:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5828 transitions. [2018-11-12 19:00:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-12 19:00:46,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:00:46,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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 19:00:46,692 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:00:46,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:00:46,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1449223166, now seen corresponding path program 1 times [2018-11-12 19:00:46,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:00:46,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:00:46,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:00:46,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:00:46,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:00:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:00:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:00:46,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:00:46,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 19:00:46,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:00:46,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 19:00:46,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 19:00:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 19:00:46,927 INFO L87 Difference]: Start difference. First operand 3636 states and 5828 transitions. Second operand 5 states. [2018-11-12 19:01:03,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:01:03,099 INFO L93 Difference]: Finished difference Result 13450 states and 21898 transitions. [2018-11-12 19:01:03,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 19:01:03,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2018-11-12 19:01:03,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:01:03,152 INFO L225 Difference]: With dead ends: 13450 [2018-11-12 19:01:03,153 INFO L226 Difference]: Without dead ends: 9820 [2018-11-12 19:01:03,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:01:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9820 states. [2018-11-12 19:01:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9820 to 9623. [2018-11-12 19:01:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9623 states. [2018-11-12 19:01:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9623 states to 9623 states and 14633 transitions. [2018-11-12 19:01:03,432 INFO L78 Accepts]: Start accepts. Automaton has 9623 states and 14633 transitions. Word has length 161 [2018-11-12 19:01:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:01:03,432 INFO L480 AbstractCegarLoop]: Abstraction has 9623 states and 14633 transitions. [2018-11-12 19:01:03,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 19:01:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 9623 states and 14633 transitions. [2018-11-12 19:01:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-12 19:01:03,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:01:03,440 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 19:01:03,440 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:01:03,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:01:03,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2036148572, now seen corresponding path program 1 times [2018-11-12 19:01:03,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:01:03,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:01:03,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:01:03,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:01:03,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:01:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:01:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:01:03,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:01:03,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 19:01:03,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:01:03,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 19:01:03,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 19:01:03,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 19:01:03,832 INFO L87 Difference]: Start difference. First operand 9623 states and 14633 transitions. Second operand 5 states. [2018-11-12 19:01:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:01:13,076 INFO L93 Difference]: Finished difference Result 28946 states and 45937 transitions. [2018-11-12 19:01:13,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 19:01:13,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2018-11-12 19:01:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:01:13,169 INFO L225 Difference]: With dead ends: 28946 [2018-11-12 19:01:13,170 INFO L226 Difference]: Without dead ends: 19329 [2018-11-12 19:01:13,198 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:01:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19329 states. [2018-11-12 19:01:13,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19329 to 18999. [2018-11-12 19:01:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18999 states. [2018-11-12 19:01:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18999 states to 18999 states and 27487 transitions. [2018-11-12 19:01:13,708 INFO L78 Accepts]: Start accepts. Automaton has 18999 states and 27487 transitions. Word has length 170 [2018-11-12 19:01:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:01:13,708 INFO L480 AbstractCegarLoop]: Abstraction has 18999 states and 27487 transitions. [2018-11-12 19:01:13,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 19:01:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 18999 states and 27487 transitions. [2018-11-12 19:01:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-12 19:01:13,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:01:13,719 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 19:01:13,720 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:01:13,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:01:13,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1111253638, now seen corresponding path program 1 times [2018-11-12 19:01:13,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:01:13,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:01:13,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:01:13,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:01:13,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:01:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:01:14,013 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:01:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:01:14,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:01:14,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:01:14,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:01:14,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:01:14,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:01:14,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:01:14,415 INFO L87 Difference]: Start difference. First operand 18999 states and 27487 transitions. Second operand 6 states. [2018-11-12 19:01:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:01:26,691 INFO L93 Difference]: Finished difference Result 58216 states and 91373 transitions. [2018-11-12 19:01:26,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:01:26,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2018-11-12 19:01:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:01:26,854 INFO L225 Difference]: With dead ends: 58216 [2018-11-12 19:01:26,855 INFO L226 Difference]: Without dead ends: 39223 [2018-11-12 19:01:26,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 19:01:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39223 states. [2018-11-12 19:01:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39223 to 39047. [2018-11-12 19:01:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39047 states. [2018-11-12 19:01:27,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39047 states to 39047 states and 54715 transitions. [2018-11-12 19:01:27,753 INFO L78 Accepts]: Start accepts. Automaton has 39047 states and 54715 transitions. Word has length 181 [2018-11-12 19:01:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:01:27,754 INFO L480 AbstractCegarLoop]: Abstraction has 39047 states and 54715 transitions. [2018-11-12 19:01:27,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:01:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 39047 states and 54715 transitions. [2018-11-12 19:01:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-12 19:01:27,764 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:01:27,765 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 19:01:27,765 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:01:27,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:01:27,765 INFO L82 PathProgramCache]: Analyzing trace with hash -747971991, now seen corresponding path program 1 times [2018-11-12 19:01:27,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:01:27,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:01:27,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:01:27,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:01:27,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:01:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:01:28,035 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:01:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:01:28,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:01:28,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:01:28,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:01:28,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:01:28,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:01:28,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:01:28,236 INFO L87 Difference]: Start difference. First operand 39047 states and 54715 transitions. Second operand 6 states. [2018-11-12 19:01:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:01:36,433 INFO L93 Difference]: Finished difference Result 98710 states and 156662 transitions. [2018-11-12 19:01:36,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:01:36,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2018-11-12 19:01:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:01:36,711 INFO L225 Difference]: With dead ends: 98710 [2018-11-12 19:01:36,712 INFO L226 Difference]: Without dead ends: 59669 [2018-11-12 19:01:36,816 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 19:01:36,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59669 states. [2018-11-12 19:01:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59669 to 59442. [2018-11-12 19:01:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59442 states. [2018-11-12 19:01:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59442 states to 59442 states and 85231 transitions. [2018-11-12 19:01:38,102 INFO L78 Accepts]: Start accepts. Automaton has 59442 states and 85231 transitions. Word has length 190 [2018-11-12 19:01:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:01:38,103 INFO L480 AbstractCegarLoop]: Abstraction has 59442 states and 85231 transitions. [2018-11-12 19:01:38,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:01:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 59442 states and 85231 transitions. [2018-11-12 19:01:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-12 19:01:38,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:01:38,145 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 19:01:38,152 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:01:38,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:01:38,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1403677423, now seen corresponding path program 1 times [2018-11-12 19:01:38,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:01:38,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:01:38,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:01:38,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:01:38,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:01:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:01:38,511 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:01:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:01:38,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:01:38,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:01:38,966 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:01:38,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:01:38,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:01:38,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:01:38,967 INFO L87 Difference]: Start difference. First operand 59442 states and 85231 transitions. Second operand 6 states. [2018-11-12 19:01:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:01:46,987 INFO L93 Difference]: Finished difference Result 124489 states and 183187 transitions. [2018-11-12 19:01:46,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:01:46,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-11-12 19:01:46,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:01:47,221 INFO L225 Difference]: With dead ends: 124489 [2018-11-12 19:01:47,221 INFO L226 Difference]: Without dead ends: 65053 [2018-11-12 19:01:47,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 19:01:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65053 states. [2018-11-12 19:01:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65053 to 64927. [2018-11-12 19:01:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64927 states. [2018-11-12 19:01:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64927 states to 64927 states and 87972 transitions. [2018-11-12 19:01:49,144 INFO L78 Accepts]: Start accepts. Automaton has 64927 states and 87972 transitions. Word has length 265 [2018-11-12 19:01:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:01:49,145 INFO L480 AbstractCegarLoop]: Abstraction has 64927 states and 87972 transitions. [2018-11-12 19:01:49,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:01:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 64927 states and 87972 transitions. [2018-11-12 19:01:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-12 19:01:49,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:01:49,175 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 19:01:49,175 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:01:49,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:01:49,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2001119171, now seen corresponding path program 1 times [2018-11-12 19:01:49,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:01:49,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:01:49,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:01:49,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:01:49,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:01:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:01:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:01:49,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:01:49,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 19:01:49,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:01:49,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 19:01:49,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 19:01:49,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 19:01:49,583 INFO L87 Difference]: Start difference. First operand 64927 states and 87972 transitions. Second operand 5 states. [2018-11-12 19:02:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:02:05,066 INFO L93 Difference]: Finished difference Result 165884 states and 236667 transitions. [2018-11-12 19:02:05,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 19:02:05,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 271 [2018-11-12 19:02:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:02:05,434 INFO L225 Difference]: With dead ends: 165884 [2018-11-12 19:02:05,435 INFO L226 Difference]: Without dead ends: 100963 [2018-11-12 19:02:05,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:02:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100963 states. [2018-11-12 19:02:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100963 to 100796. [2018-11-12 19:02:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100796 states. [2018-11-12 19:02:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100796 states to 100796 states and 143272 transitions. [2018-11-12 19:02:07,127 INFO L78 Accepts]: Start accepts. Automaton has 100796 states and 143272 transitions. Word has length 271 [2018-11-12 19:02:07,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:02:07,128 INFO L480 AbstractCegarLoop]: Abstraction has 100796 states and 143272 transitions. [2018-11-12 19:02:07,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 19:02:07,128 INFO L276 IsEmpty]: Start isEmpty. Operand 100796 states and 143272 transitions. [2018-11-12 19:02:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-12 19:02:07,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:02:07,155 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:02:07,155 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:02:07,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:02:07,156 INFO L82 PathProgramCache]: Analyzing trace with hash -227591905, now seen corresponding path program 1 times [2018-11-12 19:02:07,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:02:07,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:07,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:02:07,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:07,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:02:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:02:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 205 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:02:07,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:02:07,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:02:07,791 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-11-12 19:02:07,793 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3043], [3051], [3059], [3067], [3075], [3083], [3091], [3095], [3097], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3221], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3363], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-11-12 19:02:07,860 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:02:07,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:02:08,778 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:02:08,782 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Performed 2828 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2828 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 26 variables. [2018-11-12 19:02:08,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:02:08,826 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:02:11,054 INFO L227 lantSequenceWeakener]: Weakened 258 states. On average, predicates are now at 71.77% of their original sizes. [2018-11-12 19:02:11,055 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:02:11,955 INFO L415 sIntCurrentIteration]: We unified 281 AI predicates to 281 [2018-11-12 19:02:11,955 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:02:11,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:02:11,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2018-11-12 19:02:11,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:02:11,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 19:02:11,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 19:02:11,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-12 19:02:11,959 INFO L87 Difference]: Start difference. First operand 100796 states and 143272 transitions. Second operand 11 states. [2018-11-12 19:02:25,501 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:03:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:22,658 INFO L93 Difference]: Finished difference Result 201588 states and 286571 transitions. [2018-11-12 19:03:22,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 19:03:22,659 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 282 [2018-11-12 19:03:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:22,936 INFO L225 Difference]: With dead ends: 201588 [2018-11-12 19:03:22,936 INFO L226 Difference]: Without dead ends: 100798 [2018-11-12 19:03:23,074 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 286 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-11-12 19:03:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100798 states. [2018-11-12 19:03:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100798 to 100793. [2018-11-12 19:03:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100793 states. [2018-11-12 19:03:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100793 states to 100793 states and 143218 transitions. [2018-11-12 19:03:24,678 INFO L78 Accepts]: Start accepts. Automaton has 100793 states and 143218 transitions. Word has length 282 [2018-11-12 19:03:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:24,678 INFO L480 AbstractCegarLoop]: Abstraction has 100793 states and 143218 transitions. [2018-11-12 19:03:24,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 19:03:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 100793 states and 143218 transitions. [2018-11-12 19:03:24,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-11-12 19:03:24,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:24,710 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:03:24,710 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:24,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:24,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1307204526, now seen corresponding path program 1 times [2018-11-12 19:03:24,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:24,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:24,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:24,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:24,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 296 proven. 172 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:03:25,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:03:25,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:03:25,675 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 384 with the following transitions: [2018-11-12 19:03:25,676 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3043], [3051], [3059], [3067], [3075], [3083], [3091], [3095], [3097], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3221], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3363], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-11-12 19:03:25,687 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:03:25,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:03:27,785 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:03:27,785 INFO L272 AbstractInterpreter]: Visited 128 different actions 371 times. Merged at 5 different actions 9 times. Never widened. Performed 5583 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5583 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-12 19:03:27,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:27,812 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:03:28,874 INFO L227 lantSequenceWeakener]: Weakened 129 states. On average, predicates are now at 71.41% of their original sizes. [2018-11-12 19:03:28,875 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:03:31,342 INFO L415 sIntCurrentIteration]: We unified 382 AI predicates to 382 [2018-11-12 19:03:31,343 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:03:31,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:03:31,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [11] total 22 [2018-11-12 19:03:31,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:31,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 19:03:31,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 19:03:31,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-12 19:03:31,345 INFO L87 Difference]: Start difference. First operand 100793 states and 143218 transitions. Second operand 13 states. Received shutdown request... [2018-11-12 19:03:33,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 19:03:33,378 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 19:03:33,384 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 19:03:33,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:03:33 BoogieIcfgContainer [2018-11-12 19:03:33,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 19:03:33,386 INFO L168 Benchmark]: Toolchain (without parser) took 205898.54 ms. Allocated memory was 1.5 GB in the beginning and 5.4 GB in the end (delta: 3.9 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -694.4 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2018-11-12 19:03:33,387 INFO L168 Benchmark]: CDTParser took 0.20 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-11-12 19:03:33,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2445.37 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-11-12 19:03:33,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 453.01 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 820.0 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. [2018-11-12 19:03:33,389 INFO L168 Benchmark]: Boogie Preprocessor took 291.48 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2018-11-12 19:03:33,390 INFO L168 Benchmark]: RCFGBuilder took 10169.49 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 187.2 MB). Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: -23.0 MB). Peak memory consumption was 680.1 MB. Max. memory is 7.1 GB. [2018-11-12 19:03:33,391 INFO L168 Benchmark]: TraceAbstraction took 192533.95 ms. Allocated memory was 2.6 GB in the beginning and 5.4 GB in the end (delta: 2.9 GB). Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 166.9 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-12 19:03:33,397 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.20 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 2445.37 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 453.01 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 820.0 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 291.48 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10169.49 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 187.2 MB). Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: -23.0 MB). Peak memory consumption was 680.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192533.95 ms. Allocated memory was 2.6 GB in the beginning and 5.4 GB in the end (delta: 2.9 GB). Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 166.9 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 204]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 204). Cancelled while BasicCegarLoop was constructing difference of abstraction (100793states) and FLOYD_HOARE automaton (currently 9 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (67 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. TIMEOUT Result, 192.4s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 168.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4452 SDtfs, 30663 SDslu, 4292 SDs, 0 SdLazy, 52699 SolverSat, 10897 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 107.1s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 746 GetRequests, 611 SyntacticMatches, 58 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100796occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.1s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9979652714435322 AbsIntWeakeningRatio, 0.09954751131221719 AbsIntAvgWeakeningVarsNumRemoved, 6.306184012066365 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 1285 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2128 NumberOfCodeBlocks, 2128 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2118 ConstructedInterpolants, 0 QuantifiedInterpolants, 2575987 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 954/1139 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown