java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 19:24:41,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 19:24:41,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 19:24:41,648 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 19:24:41,648 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 19:24:41,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 19:24:41,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 19:24:41,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 19:24:41,653 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 19:24:41,654 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 19:24:41,655 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 19:24:41,655 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 19:24:41,656 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 19:24:41,662 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 19:24:41,665 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 19:24:41,666 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 19:24:41,667 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 19:24:41,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 19:24:41,672 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 19:24:41,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 19:24:41,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 19:24:41,681 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 19:24:41,685 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 19:24:41,685 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 19:24:41,686 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 19:24:41,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 19:24:41,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 19:24:41,689 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 19:24:41,690 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 19:24:41,693 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 19:24:41,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 19:24:41,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 19:24:41,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 19:24:41,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 19:24:41,698 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 19:24:41,699 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 19:24:41,699 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 19:24:41,729 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 19:24:41,730 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 19:24:41,730 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 19:24:41,731 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 19:24:41,731 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 19:24:41,731 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 19:24:41,731 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 19:24:41,732 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 19:24:41,732 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 19:24:41,732 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 19:24:41,732 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 19:24:41,732 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 19:24:41,733 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 19:24:41,733 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 19:24:41,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 19:24:41,733 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 19:24:41,735 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 19:24:41,735 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 19:24:41,735 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 19:24:41,735 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 19:24:41,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 19:24:41,736 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 19:24:41,736 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 19:24:41,736 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 19:24:41,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 19:24:41,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 19:24:41,737 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 19:24:41,737 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 19:24:41,737 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 19:24:41,737 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 19:24:41,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 19:24:41,738 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 19:24:41,738 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 19:24:41,738 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 19:24:41,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 19:24:41,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 19:24:41,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 19:24:41,817 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 19:24:41,817 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 19:24:41,818 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c [2018-10-24 19:24:41,885 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc4a32b0b/de219dcf486843f0ac40cfe0bcf64eaf/FLAG0901877ca [2018-10-24 19:24:42,505 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 19:24:42,506 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c [2018-10-24 19:24:42,525 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc4a32b0b/de219dcf486843f0ac40cfe0bcf64eaf/FLAG0901877ca [2018-10-24 19:24:42,551 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc4a32b0b/de219dcf486843f0ac40cfe0bcf64eaf [2018-10-24 19:24:42,565 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 19:24:42,567 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 19:24:42,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 19:24:42,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 19:24:42,573 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 19:24:42,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:24:42" (1/1) ... [2018-10-24 19:24:42,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e73589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:42, skipping insertion in model container [2018-10-24 19:24:42,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:24:42" (1/1) ... [2018-10-24 19:24:42,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 19:24:42,682 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 19:24:43,227 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 19:24:43,236 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 19:24:43,337 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 19:24:43,356 INFO L193 MainTranslator]: Completed translation [2018-10-24 19:24:43,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:43 WrapperNode [2018-10-24 19:24:43,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 19:24:43,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 19:24:43,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 19:24:43,358 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 19:24:43,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:43" (1/1) ... [2018-10-24 19:24:43,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:43" (1/1) ... [2018-10-24 19:24:43,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 19:24:43,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 19:24:43,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 19:24:43,583 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 19:24:43,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:43" (1/1) ... [2018-10-24 19:24:43,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:43" (1/1) ... [2018-10-24 19:24:43,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:43" (1/1) ... [2018-10-24 19:24:43,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:43" (1/1) ... [2018-10-24 19:24:43,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:43" (1/1) ... [2018-10-24 19:24:43,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:43" (1/1) ... [2018-10-24 19:24:43,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:43" (1/1) ... [2018-10-24 19:24:43,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 19:24:43,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 19:24:43,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 19:24:43,649 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 19:24:43,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 19:24:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 19:24:43,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 19:24:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 19:24:43,748 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 19:24:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 19:24:43,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 19:24:43,750 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 19:24:43,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 19:24:47,004 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 19:24:47,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:24:47 BoogieIcfgContainer [2018-10-24 19:24:47,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 19:24:47,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 19:24:47,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 19:24:47,013 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 19:24:47,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:24:42" (1/3) ... [2018-10-24 19:24:47,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c50fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:24:47, skipping insertion in model container [2018-10-24 19:24:47,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:43" (2/3) ... [2018-10-24 19:24:47,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c50fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:24:47, skipping insertion in model container [2018-10-24 19:24:47,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:24:47" (3/3) ... [2018-10-24 19:24:47,023 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label14_true-unreach-call_false-termination.c [2018-10-24 19:24:47,034 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 19:24:47,048 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 19:24:47,068 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 19:24:47,107 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 19:24:47,107 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 19:24:47,108 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 19:24:47,108 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 19:24:47,108 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 19:24:47,108 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 19:24:47,108 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 19:24:47,109 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 19:24:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-24 19:24:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-24 19:24:47,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:24:47,159 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] [2018-10-24 19:24:47,162 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:24:47,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:24:47,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1648799080, now seen corresponding path program 1 times [2018-10-24 19:24:47,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:24:47,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:24:47,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:24:47,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:24:47,226 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:24:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:24:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:24:47,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:24:47,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 19:24:47,839 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:24:47,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 19:24:47,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 19:24:47,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:24:47,865 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-24 19:24:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:24:49,591 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-24 19:24:49,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 19:24:49,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-10-24 19:24:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:24:49,614 INFO L225 Difference]: With dead ends: 621 [2018-10-24 19:24:49,614 INFO L226 Difference]: Without dead ends: 382 [2018-10-24 19:24:49,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:24:49,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-24 19:24:49,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-24 19:24:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-24 19:24:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-24 19:24:49,705 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 124 [2018-10-24 19:24:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:24:49,706 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-24 19:24:49,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 19:24:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-24 19:24:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-24 19:24:49,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:24:49,714 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] [2018-10-24 19:24:49,715 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:24:49,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:24:49,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1971063541, now seen corresponding path program 1 times [2018-10-24 19:24:49,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:24:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:24:49,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:24:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:24:49,718 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:24:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:24:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:24:50,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:24:50,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:24:50,149 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:24:50,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:24:50,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:24:50,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:24:50,152 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-24 19:24:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:24:51,608 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-24 19:24:51,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:24:51,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-10-24 19:24:51,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:24:51,615 INFO L225 Difference]: With dead ends: 903 [2018-10-24 19:24:51,616 INFO L226 Difference]: Without dead ends: 381 [2018-10-24 19:24:51,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:24:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-24 19:24:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-24 19:24:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-24 19:24:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-24 19:24:51,645 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 133 [2018-10-24 19:24:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:24:51,646 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-24 19:24:51,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:24:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-24 19:24:51,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-24 19:24:51,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:24:51,650 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 19:24:51,650 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:24:51,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:24:51,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1740193815, now seen corresponding path program 1 times [2018-10-24 19:24:51,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:24:51,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:24:51,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:24:51,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:24:51,653 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:24:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:24:52,146 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-10-24 19:24:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:24:52,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:24:52,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:24:52,318 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:24:52,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:24:52,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:24:52,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:24:52,321 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-24 19:24:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:24:54,211 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-24 19:24:54,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:24:54,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-10-24 19:24:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:24:54,222 INFO L225 Difference]: With dead ends: 901 [2018-10-24 19:24:54,222 INFO L226 Difference]: Without dead ends: 380 [2018-10-24 19:24:54,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:24:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-24 19:24:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-24 19:24:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-24 19:24:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-24 19:24:54,245 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 139 [2018-10-24 19:24:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:24:54,245 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-24 19:24:54,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:24:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-24 19:24:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-24 19:24:54,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:24:54,249 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 19:24:54,249 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:24:54,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:24:54,250 INFO L82 PathProgramCache]: Analyzing trace with hash -295510606, now seen corresponding path program 1 times [2018-10-24 19:24:54,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:24:54,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:24:54,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:24:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:24:54,252 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:24:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:24:54,493 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 19:24:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:24:54,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:24:54,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 19:24:54,858 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:24:54,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 19:24:54,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 19:24:54,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 19:24:54,860 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-24 19:24:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:24:58,180 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-24 19:24:58,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 19:24:58,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2018-10-24 19:24:58,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:24:58,185 INFO L225 Difference]: With dead ends: 1193 [2018-10-24 19:24:58,185 INFO L226 Difference]: Without dead ends: 819 [2018-10-24 19:24:58,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 19:24:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-24 19:24:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-24 19:24:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-24 19:24:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-24 19:24:58,225 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 147 [2018-10-24 19:24:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:24:58,225 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-24 19:24:58,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 19:24:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-24 19:24:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-24 19:24:58,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:24:58,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:24:58,230 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:24:58,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:24:58,230 INFO L82 PathProgramCache]: Analyzing trace with hash -431421266, now seen corresponding path program 1 times [2018-10-24 19:24:58,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:24:58,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:24:58,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:24:58,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:24:58,232 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:24:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:24:58,648 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-24 19:24:58,850 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 19:24:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:24:58,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:24:58,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:24:58,904 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:24:58,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:24:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:24:58,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:24:58,905 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-24 19:25:00,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:25:00,040 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-24 19:25:00,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:25:00,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2018-10-24 19:25:00,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:25:00,056 INFO L225 Difference]: With dead ends: 1753 [2018-10-24 19:25:00,057 INFO L226 Difference]: Without dead ends: 804 [2018-10-24 19:25:00,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:25:00,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-24 19:25:00,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-24 19:25:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-24 19:25:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-24 19:25:00,085 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 149 [2018-10-24 19:25:00,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:25:00,085 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-24 19:25:00,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:25:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-24 19:25:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-24 19:25:00,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:25:00,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:25:00,090 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:25:00,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:25:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1643086762, now seen corresponding path program 1 times [2018-10-24 19:25:00,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:25:00,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:25:00,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:25:00,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:25:00,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:25:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:25:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:25:00,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:25:00,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:25:00,369 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:25:00,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:25:00,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:25:00,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:25:00,370 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-24 19:25:01,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:25:01,336 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-24 19:25:01,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:25:01,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-10-24 19:25:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:25:01,349 INFO L225 Difference]: With dead ends: 1747 [2018-10-24 19:25:01,349 INFO L226 Difference]: Without dead ends: 801 [2018-10-24 19:25:01,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:25:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-24 19:25:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-24 19:25:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-24 19:25:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-24 19:25:01,378 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 151 [2018-10-24 19:25:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:25:01,378 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-24 19:25:01,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:25:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-24 19:25:01,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-24 19:25:01,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:25:01,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:25:01,383 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:25:01,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:25:01,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1909626462, now seen corresponding path program 1 times [2018-10-24 19:25:01,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:25:01,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:25:01,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:25:01,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:25:01,385 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:25:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:25:01,575 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 19:25:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:25:01,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:25:01,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 19:25:01,622 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:25:01,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 19:25:01,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 19:25:01,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 19:25:01,623 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-24 19:25:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:25:03,597 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-24 19:25:03,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 19:25:03,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-10-24 19:25:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:25:03,608 INFO L225 Difference]: With dead ends: 2381 [2018-10-24 19:25:03,608 INFO L226 Difference]: Without dead ends: 1586 [2018-10-24 19:25:03,613 INFO L605 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-10-24 19:25:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-24 19:25:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-24 19:25:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-24 19:25:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-24 19:25:03,665 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 155 [2018-10-24 19:25:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:25:03,666 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-24 19:25:03,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 19:25:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-24 19:25:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-24 19:25:03,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:25:03,673 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 19:25:03,674 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:25:03,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:25:03,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1663549744, now seen corresponding path program 1 times [2018-10-24 19:25:03,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:25:03,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:25:03,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:25:03,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:25:03,676 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:25:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:25:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:25:04,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 19:25:04,075 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 19:25:04,076 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-10-24 19:25:04,078 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [663], [665], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-24 19:25:04,153 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 19:25:04,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 19:25:39,919 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 19:25:39,921 INFO L272 AbstractInterpreter]: Visited 128 different actions 250 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-24 19:25:39,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:25:39,928 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 19:25:47,801 INFO L232 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 82.44% of their original sizes. [2018-10-24 19:25:47,802 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 19:26:50,475 INFO L413 sIntCurrentIteration]: We have 189 unified AI predicates [2018-10-24 19:26:50,475 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 19:26:50,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 19:26:50,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-10-24 19:26:50,476 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:26:50,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-24 19:26:50,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-24 19:26:50,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-10-24 19:26:50,478 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 22 states. Received shutdown request... [2018-10-24 19:28:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 19:28:51,279 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 19:28:51,285 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 19:28:51,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:28:51 BoogieIcfgContainer [2018-10-24 19:28:51,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 19:28:51,286 INFO L168 Benchmark]: Toolchain (without parser) took 248719.79 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-24 19:28:51,287 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 19:28:51,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-24 19:28:51,289 INFO L168 Benchmark]: Boogie Procedure Inliner took 224.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-24 19:28:51,289 INFO L168 Benchmark]: Boogie Preprocessor took 65.28 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-10-24 19:28:51,290 INFO L168 Benchmark]: RCFGBuilder took 3356.82 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.9 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. [2018-10-24 19:28:51,291 INFO L168 Benchmark]: TraceAbstraction took 244275.86 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -747.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-24 19:28:51,296 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.22 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 788.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 224.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.28 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 3356.82 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.9 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244275.86 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -747.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 523]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 523). Cancelled while BasicCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 22 states, 22 states before enhancement),while ReachableStatesComputation was computing reachable states (534 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. TIMEOUT Result, 244.1s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 133.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 905 SDtfs, 4537 SDslu, 741 SDs, 0 SdLazy, 5668 SolverSat, 1118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 251 GetRequests, 181 SyntacticMatches, 16 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 69.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1558occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 35.8s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9951003635214165 AbsIntWeakeningRatio, 0.1746031746031746 AbsIntAvgWeakeningVarsNumRemoved, 379.04232804232805 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1188 NumberOfCodeBlocks, 1188 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1180 ConstructedInterpolants, 0 QuantifiedInterpolants, 1212975 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 201/203 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown