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/Problem03_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 18:56:59,338 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 18:56:59,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 18:56:59,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 18:56:59,355 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 18:56:59,356 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 18:56:59,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 18:56:59,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 18:56:59,361 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 18:56:59,362 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 18:56:59,363 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 18:56:59,363 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 18:56:59,364 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 18:56:59,366 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 18:56:59,367 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 18:56:59,368 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 18:56:59,369 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 18:56:59,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 18:56:59,378 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 18:56:59,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 18:56:59,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 18:56:59,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 18:56:59,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 18:56:59,389 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 18:56:59,389 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 18:56:59,390 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 18:56:59,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 18:56:59,392 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 18:56:59,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 18:56:59,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 18:56:59,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 18:56:59,394 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 18:56:59,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 18:56:59,397 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 18:56:59,398 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 18:56:59,398 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 18:56:59,399 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-07 18:56:59,420 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 18:56:59,420 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 18:56:59,421 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 18:56:59,421 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 18:56:59,424 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 18:56:59,424 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 18:56:59,424 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 18:56:59,424 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 18:56:59,425 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 18:56:59,425 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 18:56:59,425 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 18:56:59,425 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 18:56:59,425 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 18:56:59,426 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 18:56:59,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 18:56:59,427 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 18:56:59,427 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 18:56:59,427 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 18:56:59,428 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 18:56:59,428 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 18:56:59,428 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 18:56:59,428 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 18:56:59,428 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 18:56:59,429 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 18:56:59,429 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 18:56:59,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:56:59,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 18:56:59,430 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 18:56:59,430 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 18:56:59,430 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 18:56:59,430 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 18:56:59,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 18:56:59,431 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 18:56:59,431 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 18:56:59,431 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 18:56:59,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 18:56:59,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 18:56:59,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 18:56:59,534 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 18:56:59,534 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 18:56:59,535 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-11-07 18:56:59,606 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a6c58fc/21b7e10ac93147e095f96a9b464aa227/FLAG0cf4f00a4 [2018-11-07 18:57:00,293 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 18:57:00,294 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-11-07 18:57:00,317 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a6c58fc/21b7e10ac93147e095f96a9b464aa227/FLAG0cf4f00a4 [2018-11-07 18:57:00,339 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a6c58fc/21b7e10ac93147e095f96a9b464aa227 [2018-11-07 18:57:00,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 18:57:00,355 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 18:57:00,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 18:57:00,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 18:57:00,361 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 18:57:00,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:57:00" (1/1) ... [2018-11-07 18:57:00,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4688d22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:00, skipping insertion in model container [2018-11-07 18:57:00,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:57:00" (1/1) ... [2018-11-07 18:57:00,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 18:57:00,482 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 18:57:01,298 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:57:01,304 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 18:57:01,763 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:57:01,786 INFO L193 MainTranslator]: Completed translation [2018-11-07 18:57:01,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:01 WrapperNode [2018-11-07 18:57:01,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 18:57:01,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 18:57:01,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 18:57:01,789 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 18:57:01,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:01" (1/1) ... [2018-11-07 18:57:02,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:01" (1/1) ... [2018-11-07 18:57:02,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 18:57:02,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 18:57:02,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 18:57:02,020 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 18:57:02,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:01" (1/1) ... [2018-11-07 18:57:02,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:01" (1/1) ... [2018-11-07 18:57:02,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:01" (1/1) ... [2018-11-07 18:57:02,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:01" (1/1) ... [2018-11-07 18:57:02,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:01" (1/1) ... [2018-11-07 18:57:02,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:01" (1/1) ... [2018-11-07 18:57:02,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:01" (1/1) ... [2018-11-07 18:57:02,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 18:57:02,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 18:57:02,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 18:57:02,177 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 18:57:02,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:01" (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-07 18:57:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 18:57:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 18:57:02,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 18:57:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 18:57:02,250 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 18:57:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 18:57:02,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 18:57:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 18:57:02,251 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 18:57:07,062 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 18:57:07,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:07 BoogieIcfgContainer [2018-11-07 18:57:07,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 18:57:07,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 18:57:07,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 18:57:07,069 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 18:57:07,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:57:00" (1/3) ... [2018-11-07 18:57:07,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34047870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:57:07, skipping insertion in model container [2018-11-07 18:57:07,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:01" (2/3) ... [2018-11-07 18:57:07,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34047870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:57:07, skipping insertion in model container [2018-11-07 18:57:07,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:07" (3/3) ... [2018-11-07 18:57:07,073 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label53_true-unreach-call.c [2018-11-07 18:57:07,085 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 18:57:07,095 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 18:57:07,114 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 18:57:07,158 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 18:57:07,159 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 18:57:07,159 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 18:57:07,159 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 18:57:07,159 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 18:57:07,159 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 18:57:07,160 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 18:57:07,160 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 18:57:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-11-07 18:57:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-07 18:57:07,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:57:07,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:57:07,249 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:57:07,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:57:07,258 INFO L82 PathProgramCache]: Analyzing trace with hash 390618596, now seen corresponding path program 1 times [2018-11-07 18:57:07,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:57:07,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:07,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:57:07,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:07,326 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:57:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:57:08,300 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-11-07 18:57:08,706 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-07 18:57:08,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:57:08,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 18:57:08,709 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:57:08,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 18:57:08,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 18:57:08,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 18:57:08,735 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-11-07 18:57:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:57:12,517 INFO L93 Difference]: Finished difference Result 1066 states and 1924 transitions. [2018-11-07 18:57:12,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:57:12,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-11-07 18:57:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:57:12,546 INFO L225 Difference]: With dead ends: 1066 [2018-11-07 18:57:12,546 INFO L226 Difference]: Without dead ends: 748 [2018-11-07 18:57:12,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 18:57:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-11-07 18:57:12,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 527. [2018-11-07 18:57:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-11-07 18:57:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 902 transitions. [2018-11-07 18:57:12,656 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 902 transitions. Word has length 201 [2018-11-07 18:57:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:57:12,657 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 902 transitions. [2018-11-07 18:57:12,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 18:57:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 902 transitions. [2018-11-07 18:57:12,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-07 18:57:12,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:57:12,666 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:57:12,667 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:57:12,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:57:12,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1605931427, now seen corresponding path program 1 times [2018-11-07 18:57:12,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:57:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:12,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:57:12,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:12,669 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:57:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:57:12,974 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 18:57:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:57:13,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:57:13,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:57:13,082 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:57:13,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:57:13,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:57:13,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:57:13,085 INFO L87 Difference]: Start difference. First operand 527 states and 902 transitions. Second operand 6 states. [2018-11-07 18:57:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:57:16,048 INFO L93 Difference]: Finished difference Result 1590 states and 2793 transitions. [2018-11-07 18:57:16,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 18:57:16,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2018-11-07 18:57:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:57:16,060 INFO L225 Difference]: With dead ends: 1590 [2018-11-07 18:57:16,060 INFO L226 Difference]: Without dead ends: 1069 [2018-11-07 18:57:16,066 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-07 18:57:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-11-07 18:57:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-11-07 18:57:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-11-07 18:57:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1746 transitions. [2018-11-07 18:57:16,139 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1746 transitions. Word has length 211 [2018-11-07 18:57:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:57:16,139 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1746 transitions. [2018-11-07 18:57:16,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:57:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1746 transitions. [2018-11-07 18:57:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-07 18:57:16,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:57:16,147 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:57:16,147 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:57:16,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:57:16,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1477255851, now seen corresponding path program 1 times [2018-11-07 18:57:16,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:57:16,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:16,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:57:16,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:16,149 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:57:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:57:16,429 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:57:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:57:16,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:57:16,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:57:16,582 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:57:16,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:57:16,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:57:16,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:57:16,583 INFO L87 Difference]: Start difference. First operand 1024 states and 1746 transitions. Second operand 5 states. [2018-11-07 18:57:19,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:57:19,612 INFO L93 Difference]: Finished difference Result 3166 states and 5674 transitions. [2018-11-07 18:57:19,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:57:19,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2018-11-07 18:57:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:57:19,640 INFO L225 Difference]: With dead ends: 3166 [2018-11-07 18:57:19,640 INFO L226 Difference]: Without dead ends: 2148 [2018-11-07 18:57:19,649 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 18:57:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-11-07 18:57:19,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-11-07 18:57:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-11-07 18:57:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3422 transitions. [2018-11-07 18:57:19,765 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3422 transitions. Word has length 212 [2018-11-07 18:57:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:57:19,767 INFO L480 AbstractCegarLoop]: Abstraction has 2105 states and 3422 transitions. [2018-11-07 18:57:19,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:57:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3422 transitions. [2018-11-07 18:57:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-07 18:57:19,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:57:19,778 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:57:19,778 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:57:19,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:57:19,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1229236448, now seen corresponding path program 1 times [2018-11-07 18:57:19,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:57:19,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:19,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:57:19,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:19,780 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:57:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:57:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:57:20,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:57:20,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:57:20,257 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:57:20,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:57:20,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:57:20,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:57:20,259 INFO L87 Difference]: Start difference. First operand 2105 states and 3422 transitions. Second operand 3 states. [2018-11-07 18:57:22,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:57:22,193 INFO L93 Difference]: Finished difference Result 6108 states and 10330 transitions. [2018-11-07 18:57:22,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:57:22,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-11-07 18:57:22,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:57:22,221 INFO L225 Difference]: With dead ends: 6108 [2018-11-07 18:57:22,221 INFO L226 Difference]: Without dead ends: 4009 [2018-11-07 18:57:22,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:57:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-11-07 18:57:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3973. [2018-11-07 18:57:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-11-07 18:57:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6514 transitions. [2018-11-07 18:57:22,359 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6514 transitions. Word has length 214 [2018-11-07 18:57:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:57:22,360 INFO L480 AbstractCegarLoop]: Abstraction has 3973 states and 6514 transitions. [2018-11-07 18:57:22,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:57:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6514 transitions. [2018-11-07 18:57:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-07 18:57:22,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:57:22,378 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:57:22,378 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:57:22,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:57:22,378 INFO L82 PathProgramCache]: Analyzing trace with hash -565100084, now seen corresponding path program 1 times [2018-11-07 18:57:22,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:57:22,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:22,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:57:22,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:22,380 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:57:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:57:22,857 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-07 18:57:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:57:23,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:57:23,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 18:57:23,081 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:57:23,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 18:57:23,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 18:57:23,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 18:57:23,082 INFO L87 Difference]: Start difference. First operand 3973 states and 6514 transitions. Second operand 7 states. [2018-11-07 18:57:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:57:25,264 INFO L93 Difference]: Finished difference Result 12096 states and 22014 transitions. [2018-11-07 18:57:25,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:57:25,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 220 [2018-11-07 18:57:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:57:25,338 INFO L225 Difference]: With dead ends: 12096 [2018-11-07 18:57:25,339 INFO L226 Difference]: Without dead ends: 8129 [2018-11-07 18:57:25,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:57:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-11-07 18:57:25,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7942. [2018-11-07 18:57:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2018-11-07 18:57:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 13503 transitions. [2018-11-07 18:57:25,675 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 13503 transitions. Word has length 220 [2018-11-07 18:57:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:57:25,676 INFO L480 AbstractCegarLoop]: Abstraction has 7942 states and 13503 transitions. [2018-11-07 18:57:25,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 18:57:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 13503 transitions. [2018-11-07 18:57:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-07 18:57:25,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:57:25,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:57:25,707 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:57:25,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:57:25,708 INFO L82 PathProgramCache]: Analyzing trace with hash -314712711, now seen corresponding path program 1 times [2018-11-07 18:57:25,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:57:25,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:25,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:57:25,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:25,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:57:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:57:25,953 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:57:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:57:25,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:57:25,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:57:25,995 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:57:25,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:57:25,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:57:25,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:57:25,996 INFO L87 Difference]: Start difference. First operand 7942 states and 13503 transitions. Second operand 6 states. [2018-11-07 18:57:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:57:28,394 INFO L93 Difference]: Finished difference Result 22960 states and 42530 transitions. [2018-11-07 18:57:28,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:57:28,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2018-11-07 18:57:28,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:57:28,489 INFO L225 Difference]: With dead ends: 22960 [2018-11-07 18:57:28,489 INFO L226 Difference]: Without dead ends: 15024 [2018-11-07 18:57:28,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:57:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2018-11-07 18:57:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14866. [2018-11-07 18:57:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2018-11-07 18:57:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 24364 transitions. [2018-11-07 18:57:29,026 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 24364 transitions. Word has length 225 [2018-11-07 18:57:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:57:29,027 INFO L480 AbstractCegarLoop]: Abstraction has 14866 states and 24364 transitions. [2018-11-07 18:57:29,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:57:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 24364 transitions. [2018-11-07 18:57:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-07 18:57:29,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:57:29,093 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:57:29,094 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:57:29,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:57:29,094 INFO L82 PathProgramCache]: Analyzing trace with hash 732116718, now seen corresponding path program 1 times [2018-11-07 18:57:29,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:57:29,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:29,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:57:29,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:29,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:57:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:57:29,614 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-07 18:57:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 18:57:29,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:57:29,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:57:29,863 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:57:29,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:57:29,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:57:29,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:57:29,865 INFO L87 Difference]: Start difference. First operand 14866 states and 24364 transitions. Second operand 6 states. [2018-11-07 18:57:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:57:34,456 INFO L93 Difference]: Finished difference Result 31818 states and 52440 transitions. [2018-11-07 18:57:34,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 18:57:34,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2018-11-07 18:57:34,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:57:34,525 INFO L225 Difference]: With dead ends: 31818 [2018-11-07 18:57:34,526 INFO L226 Difference]: Without dead ends: 16918 [2018-11-07 18:57:34,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:57:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16918 states. [2018-11-07 18:57:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16918 to 16916. [2018-11-07 18:57:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16916 states. [2018-11-07 18:57:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16916 states to 16916 states and 26691 transitions. [2018-11-07 18:57:34,981 INFO L78 Accepts]: Start accepts. Automaton has 16916 states and 26691 transitions. Word has length 249 [2018-11-07 18:57:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:57:34,982 INFO L480 AbstractCegarLoop]: Abstraction has 16916 states and 26691 transitions. [2018-11-07 18:57:34,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:57:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 16916 states and 26691 transitions. [2018-11-07 18:57:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-11-07 18:57:35,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:57:35,052 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, 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] [2018-11-07 18:57:35,052 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:57:35,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:57:35,054 INFO L82 PathProgramCache]: Analyzing trace with hash 646437938, now seen corresponding path program 1 times [2018-11-07 18:57:35,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:57:35,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:35,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:57:35,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:57:35,055 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:57:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:57:35,825 WARN L179 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 11 [2018-11-07 18:57:36,315 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:57:36,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:57:36,315 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:57:36,316 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 281 with the following transitions: [2018-11-07 18:57:36,319 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [334], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1069], [1071], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 18:57:36,377 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:57:36,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:57:37,838 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:57:37,840 INFO L272 AbstractInterpreter]: Visited 201 different actions 201 times. Never merged. Never widened. Never found a fixpoint. Largest state had 88 variables. [2018-11-07 18:57:37,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:57:37,874 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:57:39,588 INFO L227 lantSequenceWeakener]: Weakened 274 states. On average, predicates are now at 73.45% of their original sizes. [2018-11-07 18:57:39,588 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:57:40,089 INFO L415 sIntCurrentIteration]: We unified 279 AI predicates to 279 [2018-11-07 18:57:40,089 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:57:40,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:57:40,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-11-07 18:57:40,090 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:57:40,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 18:57:40,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 18:57:40,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-07 18:57:40,092 INFO L87 Difference]: Start difference. First operand 16916 states and 26691 transitions. Second operand 14 states. [2018-11-07 18:58:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:58:07,568 INFO L93 Difference]: Finished difference Result 34036 states and 53646 transitions. [2018-11-07 18:58:07,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 18:58:07,568 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 280 [2018-11-07 18:58:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:58:07,631 INFO L225 Difference]: With dead ends: 34036 [2018-11-07 18:58:07,631 INFO L226 Difference]: Without dead ends: 17126 [2018-11-07 18:58:07,677 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 282 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-11-07 18:58:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17126 states. [2018-11-07 18:58:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17126 to 17124. [2018-11-07 18:58:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17124 states. [2018-11-07 18:58:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17124 states to 17124 states and 26909 transitions. [2018-11-07 18:58:08,083 INFO L78 Accepts]: Start accepts. Automaton has 17124 states and 26909 transitions. Word has length 280 [2018-11-07 18:58:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:58:08,084 INFO L480 AbstractCegarLoop]: Abstraction has 17124 states and 26909 transitions. [2018-11-07 18:58:08,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 18:58:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 17124 states and 26909 transitions. [2018-11-07 18:58:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-07 18:58:08,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:58:08,122 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:58:08,122 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:58:08,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:58:08,123 INFO L82 PathProgramCache]: Analyzing trace with hash 277054773, now seen corresponding path program 1 times [2018-11-07 18:58:08,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:58:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:58:08,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:58:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:58:08,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:58:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:58:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:58:09,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:58:09,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:58:09,125 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-11-07 18:58:09,126 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [334], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1069], [1071], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 18:58:09,136 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:58:09,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:58:10,985 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:58:10,985 INFO L272 AbstractInterpreter]: Visited 205 different actions 406 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-07 18:58:10,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:58:10,993 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:58:12,883 INFO L227 lantSequenceWeakener]: Weakened 137 states. On average, predicates are now at 77.75% of their original sizes. [2018-11-07 18:58:12,884 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:58:13,741 INFO L415 sIntCurrentIteration]: We unified 291 AI predicates to 291 [2018-11-07 18:58:13,741 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:58:13,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:58:13,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [9] total 28 [2018-11-07 18:58:13,742 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:58:13,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 18:58:13,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 18:58:13,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-11-07 18:58:13,743 INFO L87 Difference]: Start difference. First operand 17124 states and 26909 transitions. Second operand 21 states. [2018-11-07 18:59:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:59:24,011 INFO L93 Difference]: Finished difference Result 35292 states and 55220 transitions. [2018-11-07 18:59:24,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 18:59:24,012 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 292 [2018-11-07 18:59:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:59:24,074 INFO L225 Difference]: With dead ends: 35292 [2018-11-07 18:59:24,075 INFO L226 Difference]: Without dead ends: 18382 [2018-11-07 18:59:24,103 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 300 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2018-11-07 18:59:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18382 states. [2018-11-07 18:59:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18382 to 18378. [2018-11-07 18:59:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18378 states. [2018-11-07 18:59:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18378 states to 18378 states and 28293 transitions. [2018-11-07 18:59:24,466 INFO L78 Accepts]: Start accepts. Automaton has 18378 states and 28293 transitions. Word has length 292 [2018-11-07 18:59:24,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:59:24,467 INFO L480 AbstractCegarLoop]: Abstraction has 18378 states and 28293 transitions. [2018-11-07 18:59:24,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 18:59:24,467 INFO L276 IsEmpty]: Start isEmpty. Operand 18378 states and 28293 transitions. [2018-11-07 18:59:24,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-07 18:59:24,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:59:24,504 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 18:59:24,504 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:59:24,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:59:24,505 INFO L82 PathProgramCache]: Analyzing trace with hash 281948138, now seen corresponding path program 1 times [2018-11-07 18:59:24,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:59:24,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:59:24,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:59:24,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:59:24,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:59:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:59:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:59:24,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:59:24,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:59:24,882 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:59:24,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:59:24,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:59:24,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:59:24,883 INFO L87 Difference]: Start difference. First operand 18378 states and 28293 transitions. Second operand 3 states. [2018-11-07 18:59:27,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:59:27,541 INFO L93 Difference]: Finished difference Result 46833 states and 75354 transitions. [2018-11-07 18:59:27,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:59:27,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2018-11-07 18:59:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:59:27,645 INFO L225 Difference]: With dead ends: 46833 [2018-11-07 18:59:27,645 INFO L226 Difference]: Without dead ends: 29923 [2018-11-07 18:59:27,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:59:27,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29923 states. [2018-11-07 18:59:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29923 to 29804. [2018-11-07 18:59:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29804 states. [2018-11-07 18:59:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29804 states to 29804 states and 44615 transitions. [2018-11-07 18:59:28,665 INFO L78 Accepts]: Start accepts. Automaton has 29804 states and 44615 transitions. Word has length 308 [2018-11-07 18:59:28,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:59:28,665 INFO L480 AbstractCegarLoop]: Abstraction has 29804 states and 44615 transitions. [2018-11-07 18:59:28,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:59:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 29804 states and 44615 transitions. [2018-11-07 18:59:28,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-07 18:59:28,720 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:59:28,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:59:28,720 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:59:28,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:59:28,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2134481765, now seen corresponding path program 1 times [2018-11-07 18:59:28,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:59:28,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:59:28,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:59:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:59:28,722 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:59:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:59:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:59:29,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:59:29,366 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:59:29,366 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 331 with the following transitions: [2018-11-07 18:59:29,366 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [95], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [436], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1069], [1071], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 18:59:29,380 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:59:29,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:59:32,252 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:59:32,252 INFO L272 AbstractInterpreter]: Visited 206 different actions 615 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 88 variables. [2018-11-07 18:59:32,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:59:32,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:59:32,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:59:32,261 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 18:59:32,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:59:32,273 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:59:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:59:32,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:59:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:59:33,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:59:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:59:33,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:59:33,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-11-07 18:59:33,485 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:59:33,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 18:59:33,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 18:59:33,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 18:59:33,486 INFO L87 Difference]: Start difference. First operand 29804 states and 44615 transitions. Second operand 7 states. [2018-11-07 18:59:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:59:39,903 INFO L93 Difference]: Finished difference Result 99698 states and 172643 transitions. [2018-11-07 18:59:39,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 18:59:39,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 330 [2018-11-07 18:59:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:59:40,578 INFO L225 Difference]: With dead ends: 99698 [2018-11-07 18:59:40,579 INFO L226 Difference]: Without dead ends: 71362 [2018-11-07 18:59:40,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 659 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:59:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71362 states. [2018-11-07 18:59:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71362 to 69487. [2018-11-07 18:59:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69487 states. [2018-11-07 18:59:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69487 states to 69487 states and 101163 transitions. [2018-11-07 18:59:43,146 INFO L78 Accepts]: Start accepts. Automaton has 69487 states and 101163 transitions. Word has length 330 [2018-11-07 18:59:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:59:43,147 INFO L480 AbstractCegarLoop]: Abstraction has 69487 states and 101163 transitions. [2018-11-07 18:59:43,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 18:59:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 69487 states and 101163 transitions. [2018-11-07 18:59:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-11-07 18:59:43,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:59:43,768 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:59:43,769 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:59:43,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:59:43,769 INFO L82 PathProgramCache]: Analyzing trace with hash 877879966, now seen corresponding path program 1 times [2018-11-07 18:59:43,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:59:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:59:43,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:59:43,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:59:43,771 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:59:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:59:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 170 proven. 63 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-07 18:59:44,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:59:44,428 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:59:44,428 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 336 with the following transitions: [2018-11-07 18:59:44,430 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [64], [65], [68], [73], [75], [76], [80], [84], [88], [92], [95], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [240], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1069], [1071], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 18:59:44,437 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:59:44,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:59:47,528 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:59:47,529 INFO L272 AbstractInterpreter]: Visited 207 different actions 407 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-07 18:59:47,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:59:47,556 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:59:49,487 INFO L227 lantSequenceWeakener]: Weakened 330 states. On average, predicates are now at 72.91% of their original sizes. [2018-11-07 18:59:49,487 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:59:49,939 INFO L415 sIntCurrentIteration]: We unified 334 AI predicates to 334 [2018-11-07 18:59:49,939 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:59:49,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:59:49,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-07 18:59:49,940 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:59:49,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 18:59:49,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 18:59:49,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-11-07 18:59:49,942 INFO L87 Difference]: Start difference. First operand 69487 states and 101163 transitions. Second operand 19 states. [2018-11-07 19:00:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 19:00:43,239 INFO L93 Difference]: Finished difference Result 135418 states and 194320 transitions. [2018-11-07 19:00:43,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 19:00:43,239 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 335 [2018-11-07 19:00:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 19:00:43,580 INFO L225 Difference]: With dead ends: 135418 [2018-11-07 19:00:43,581 INFO L226 Difference]: Without dead ends: 85341 [2018-11-07 19:00:43,705 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 343 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2018-11-07 19:00:43,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85341 states. Received shutdown request... [2018-11-07 19:00:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85341 to 85071. [2018-11-07 19:00:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85071 states. [2018-11-07 19:00:45,142 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 19:00:45,147 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 19:00:45,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:00:45 BoogieIcfgContainer [2018-11-07 19:00:45,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 19:00:45,148 INFO L168 Benchmark]: Toolchain (without parser) took 224795.04 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 396.1 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-11-07 19:00:45,149 INFO L168 Benchmark]: CDTParser took 0.26 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-07 19:00:45,149 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1431.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-11-07 19:00:45,150 INFO L168 Benchmark]: Boogie Procedure Inliner took 231.51 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -880.3 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2018-11-07 19:00:45,151 INFO L168 Benchmark]: Boogie Preprocessor took 156.36 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 19:00:45,151 INFO L168 Benchmark]: RCFGBuilder took 4887.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 259.8 MB). Peak memory consumption was 259.8 MB. Max. memory is 7.1 GB. [2018-11-07 19:00:45,152 INFO L168 Benchmark]: TraceAbstraction took 218082.20 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 1.0 GB in the end (delta: 932.0 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-11-07 19:00:45,156 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.26 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 1431.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 231.51 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -880.3 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 156.36 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4887.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 259.8 MB). Peak memory consumption was 259.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 218082.20 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 1.0 GB in the end (delta: 932.0 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: 1617]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1617). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 218.0s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 183.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2522 SDtfs, 14136 SDslu, 3452 SDs, 0 SdLazy, 21096 SolverSat, 2521 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 114.3s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1656 GetRequests, 1536 SyntacticMatches, 8 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69487occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.4s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9992272757510863 AbsIntWeakeningRatio, 0.2168141592920354 AbsIntAvgWeakeningVarsNumRemoved, 56.716814159292035 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 2692 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 3407 NumberOfCodeBlocks, 3407 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3723 ConstructedInterpolants, 0 QuantifiedInterpolants, 4225966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1147 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 948/1104 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown