./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i --full-output --rcfgbuilder.size.of.a.code.block LoopFreeBlock --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0210da8c Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 --rcfgbuilder.size.of.a.code.block LoopFreeBlock ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0210da8 [2018-10-22 10:17:42,511 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 10:17:42,513 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 10:17:42,527 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 10:17:42,529 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 10:17:42,530 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 10:17:42,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 10:17:42,534 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 10:17:42,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 10:17:42,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 10:17:42,538 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 10:17:42,538 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 10:17:42,539 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 10:17:42,541 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 10:17:42,542 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 10:17:42,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 10:17:42,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 10:17:42,546 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 10:17:42,548 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 10:17:42,549 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 10:17:42,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 10:17:42,552 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 10:17:42,555 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 10:17:42,555 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 10:17:42,555 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 10:17:42,556 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 10:17:42,557 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 10:17:42,558 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 10:17:42,559 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 10:17:42,561 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 10:17:42,561 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 10:17:42,562 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 10:17:42,562 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 10:17:42,562 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 10:17:42,564 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 10:17:42,564 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 10:17:42,565 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-22 10:17:42,593 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 10:17:42,594 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 10:17:42,595 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 10:17:42,595 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-22 10:17:42,595 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-22 10:17:42,595 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-22 10:17:42,595 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-22 10:17:42,595 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-22 10:17:42,596 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-22 10:17:42,596 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-22 10:17:42,596 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-22 10:17:42,597 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 10:17:42,598 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-22 10:17:42,598 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 10:17:42,598 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-22 10:17:42,598 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 10:17:42,598 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 10:17:42,598 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 10:17:42,599 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 10:17:42,599 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-22 10:17:42,599 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 10:17:42,599 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 10:17:42,599 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 10:17:42,600 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 10:17:42,601 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 10:17:42,601 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 10:17:42,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 10:17:42,601 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 10:17:42,601 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 10:17:42,602 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 10:17:42,602 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-22 10:17:42,602 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 10:17:42,602 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 10:17:42,602 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 10:17:42,603 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UTaipan-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock [2018-10-22 10:17:42,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 10:17:42,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 10:17:42,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 10:17:42,694 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 10:17:42,694 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 10:17:42,695 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-10-22 10:17:42,752 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/78ddc7880/d6ceb3f2e0b64c8b8489d3c317d63260/FLAG02490e224 [2018-10-22 10:17:43,169 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 10:17:43,172 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-10-22 10:17:43,182 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/78ddc7880/d6ceb3f2e0b64c8b8489d3c317d63260/FLAG02490e224 [2018-10-22 10:17:43,196 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/78ddc7880/d6ceb3f2e0b64c8b8489d3c317d63260 [2018-10-22 10:17:43,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 10:17:43,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-22 10:17:43,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 10:17:43,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 10:17:43,208 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 10:17:43,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 10:17:43" (1/1) ... [2018-10-22 10:17:43,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6515ce94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:43, skipping insertion in model container [2018-10-22 10:17:43,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 10:17:43" (1/1) ... [2018-10-22 10:17:43,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 10:17:43,249 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 10:17:43,452 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 10:17:43,456 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 10:17:43,474 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 10:17:43,487 INFO L193 MainTranslator]: Completed translation [2018-10-22 10:17:43,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:43 WrapperNode [2018-10-22 10:17:43,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 10:17:43,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 10:17:43,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 10:17:43,488 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 10:17:43,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:43" (1/1) ... [2018-10-22 10:17:43,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:43" (1/1) ... [2018-10-22 10:17:43,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 10:17:43,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 10:17:43,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 10:17:43,506 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 10:17:43,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:43" (1/1) ... [2018-10-22 10:17:43,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:43" (1/1) ... [2018-10-22 10:17:43,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:43" (1/1) ... [2018-10-22 10:17:43,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:43" (1/1) ... [2018-10-22 10:17:43,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:43" (1/1) ... [2018-10-22 10:17:43,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:43" (1/1) ... [2018-10-22 10:17:43,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:43" (1/1) ... [2018-10-22 10:17:43,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 10:17:43,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 10:17:43,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 10:17:43,529 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 10:17:43,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17: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-22 10:17:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-22 10:17:43,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-22 10:17:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 10:17:43,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 10:17:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-22 10:17:43,653 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-22 10:17:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-22 10:17:43,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-22 10:17:44,129 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 10:17:44,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:17:44 BoogieIcfgContainer [2018-10-22 10:17:44,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 10:17:44,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 10:17:44,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 10:17:44,135 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 10:17:44,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 10:17:43" (1/3) ... [2018-10-22 10:17:44,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb50f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 10:17:44, skipping insertion in model container [2018-10-22 10:17:44,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:43" (2/3) ... [2018-10-22 10:17:44,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb50f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 10:17:44, skipping insertion in model container [2018-10-22 10:17:44,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:17:44" (3/3) ... [2018-10-22 10:17:44,140 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle_true-unreach-call_true-termination.i [2018-10-22 10:17:44,150 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 10:17:44,158 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 10:17:44,175 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 10:17:44,209 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 10:17:44,210 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 10:17:44,210 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 10:17:44,210 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 10:17:44,211 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 10:17:44,211 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 10:17:44,211 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 10:17:44,211 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 10:17:44,212 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 10:17:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-10-22 10:17:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-22 10:17:44,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:44,239 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:44,242 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:44,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1882881554, now seen corresponding path program 1 times [2018-10-22 10:17:44,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:44,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:44,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:44,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:44,297 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:44,358 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-22 10:17:44,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 10:17:44,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 10:17:44,360 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:17:44,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 10:17:44,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 10:17:44,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 10:17:44,380 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-10-22 10:17:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:44,405 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2018-10-22 10:17:44,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 10:17:44,406 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-10-22 10:17:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:44,416 INFO L225 Difference]: With dead ends: 56 [2018-10-22 10:17:44,416 INFO L226 Difference]: Without dead ends: 27 [2018-10-22 10:17:44,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 10:17:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-22 10:17:44,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-22 10:17:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-22 10:17:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-10-22 10:17:44,469 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2018-10-22 10:17:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:44,470 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-10-22 10:17:44,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 10:17:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-10-22 10:17:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-22 10:17:44,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:44,473 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:44,473 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:44,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:44,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1377822722, now seen corresponding path program 1 times [2018-10-22 10:17:44,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:44,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:44,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:44,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:44,476 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:44,769 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-22 10:17:44,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 10:17:44,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-22 10:17:44,770 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:17:44,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-22 10:17:44,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-22 10:17:44,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-22 10:17:44,774 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 5 states. [2018-10-22 10:17:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:45,083 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-10-22 10:17:45,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-22 10:17:45,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-22 10:17:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:45,085 INFO L225 Difference]: With dead ends: 33 [2018-10-22 10:17:45,086 INFO L226 Difference]: Without dead ends: 31 [2018-10-22 10:17:45,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-22 10:17:45,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-22 10:17:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-22 10:17:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-22 10:17:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-10-22 10:17:45,104 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 14 [2018-10-22 10:17:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:45,104 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-10-22 10:17:45,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-22 10:17:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-10-22 10:17:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-22 10:17:45,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:45,105 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:45,106 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:45,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:45,106 INFO L82 PathProgramCache]: Analyzing trace with hash 80039262, now seen corresponding path program 1 times [2018-10-22 10:17:45,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:45,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:45,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:45,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:45,110 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:17:45,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:45,413 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:17:45,418 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-10-22 10:17:45,420 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [32], [59], [62], [64], [67], [69], [70], [71], [72], [82], [83], [84], [90], [91] [2018-10-22 10:17:45,465 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:17:45,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:17:45,626 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:17:45,627 INFO L272 AbstractInterpreter]: Visited 17 different actions 21 times. Never merged. Never widened. Never found a fixpoint. Largest state had 8 variables. [2018-10-22 10:17:45,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:45,636 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:17:45,779 INFO L232 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 66.25% of their original sizes. [2018-10-22 10:17:45,779 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:17:46,049 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:17:46,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:17:46,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2018-10-22 10:17:46,051 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:17:46,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-22 10:17:46,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-22 10:17:46,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-22 10:17:46,052 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 9 states. [2018-10-22 10:17:47,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:47,133 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2018-10-22 10:17:47,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 10:17:47,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-10-22 10:17:47,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:47,134 INFO L225 Difference]: With dead ends: 50 [2018-10-22 10:17:47,135 INFO L226 Difference]: Without dead ends: 48 [2018-10-22 10:17:47,135 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-10-22 10:17:47,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-22 10:17:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-10-22 10:17:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-22 10:17:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2018-10-22 10:17:47,154 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 19 [2018-10-22 10:17:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:47,155 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-10-22 10:17:47,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-22 10:17:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2018-10-22 10:17:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-22 10:17:47,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:47,157 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:47,157 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:47,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:47,158 INFO L82 PathProgramCache]: Analyzing trace with hash -819048106, now seen corresponding path program 1 times [2018-10-22 10:17:47,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:47,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:47,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:47,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:47,160 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-22 10:17:47,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:47,557 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:17:47,558 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-10-22 10:17:47,559 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [34], [39], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [90], [91], [93] [2018-10-22 10:17:47,563 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:17:47,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:17:47,616 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:17:47,616 INFO L272 AbstractInterpreter]: Visited 21 different actions 29 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-10-22 10:17:47,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:47,620 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:17:47,685 INFO L232 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 59.05% of their original sizes. [2018-10-22 10:17:47,685 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:17:48,480 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:17:48,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:17:48,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2018-10-22 10:17:48,480 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:17:48,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-22 10:17:48,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-22 10:17:48,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-10-22 10:17:48,483 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand 12 states. [2018-10-22 10:17:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:50,076 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2018-10-22 10:17:50,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-22 10:17:50,077 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-10-22 10:17:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:50,079 INFO L225 Difference]: With dead ends: 67 [2018-10-22 10:17:50,079 INFO L226 Difference]: Without dead ends: 65 [2018-10-22 10:17:50,080 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-10-22 10:17:50,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-22 10:17:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2018-10-22 10:17:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-22 10:17:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2018-10-22 10:17:50,097 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 26 [2018-10-22 10:17:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:50,098 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-10-22 10:17:50,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-22 10:17:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-10-22 10:17:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-22 10:17:50,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:50,101 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:50,101 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:50,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:50,102 INFO L82 PathProgramCache]: Analyzing trace with hash -255171336, now seen corresponding path program 1 times [2018-10-22 10:17:50,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:50,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:50,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:50,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:50,104 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-22 10:17:50,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:50,276 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:17:50,276 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-22 10:17:50,276 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [32], [52], [59], [62], [64], [67], [69], [70], [71], [72], [82], [83], [84], [85], [86], [87], [88], [90], [91] [2018-10-22 10:17:50,279 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:17:50,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:17:50,299 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:17:50,300 INFO L272 AbstractInterpreter]: Visited 22 different actions 34 times. Never merged. Never widened. Never found a fixpoint. Largest state had 9 variables. [2018-10-22 10:17:50,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:50,324 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:17:50,365 INFO L232 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 71.18% of their original sizes. [2018-10-22 10:17:50,366 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:17:50,870 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:17:50,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:17:50,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-10-22 10:17:50,871 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:17:50,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-22 10:17:50,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-22 10:17:50,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-22 10:17:50,873 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 10 states. [2018-10-22 10:17:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:52,114 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2018-10-22 10:17:52,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-22 10:17:52,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-10-22 10:17:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:52,117 INFO L225 Difference]: With dead ends: 75 [2018-10-22 10:17:52,118 INFO L226 Difference]: Without dead ends: 68 [2018-10-22 10:17:52,118 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-10-22 10:17:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-22 10:17:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-10-22 10:17:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-22 10:17:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-10-22 10:17:52,134 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 30 [2018-10-22 10:17:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:52,135 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-10-22 10:17:52,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-22 10:17:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-10-22 10:17:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-22 10:17:52,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:52,137 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:52,138 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:52,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:52,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1583545222, now seen corresponding path program 1 times [2018-10-22 10:17:52,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:52,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:52,140 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-22 10:17:52,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:52,298 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:17:52,298 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-22 10:17:52,298 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [34], [39], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80], [90], [91], [93] [2018-10-22 10:17:52,300 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:17:52,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:17:52,317 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:17:52,317 INFO L272 AbstractInterpreter]: Visited 23 different actions 35 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-10-22 10:17:52,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:52,351 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:17:52,387 INFO L232 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 66.67% of their original sizes. [2018-10-22 10:17:52,387 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:17:52,666 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:17:52,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:17:52,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2018-10-22 10:17:52,667 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:17:52,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-22 10:17:52,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-22 10:17:52,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-22 10:17:52,668 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 12 states. [2018-10-22 10:17:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:53,969 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-10-22 10:17:53,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-22 10:17:53,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-10-22 10:17:53,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:53,970 INFO L225 Difference]: With dead ends: 76 [2018-10-22 10:17:53,970 INFO L226 Difference]: Without dead ends: 74 [2018-10-22 10:17:53,972 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-10-22 10:17:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-22 10:17:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-10-22 10:17:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-22 10:17:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2018-10-22 10:17:53,988 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 31 [2018-10-22 10:17:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:53,988 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2018-10-22 10:17:53,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-22 10:17:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-10-22 10:17:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-22 10:17:53,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:53,991 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:53,991 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:53,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:53,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1219310412, now seen corresponding path program 1 times [2018-10-22 10:17:53,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:53,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:53,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:53,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:53,994 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-22 10:17:54,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:54,611 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:17:54,611 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-10-22 10:17:54,612 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [34], [39], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80], [81], [90], [91], [93] [2018-10-22 10:17:54,614 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:17:54,614 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:17:54,739 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:17:54,740 INFO L272 AbstractInterpreter]: Visited 24 different actions 232 times. Merged at 8 different actions 56 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 10 variables. [2018-10-22 10:17:54,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:54,747 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:17:54,808 INFO L232 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 70.26% of their original sizes. [2018-10-22 10:17:54,809 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:17:55,439 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:17:55,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:17:55,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [8] total 22 [2018-10-22 10:17:55,440 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:17:55,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-22 10:17:55,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-22 10:17:55,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-10-22 10:17:55,443 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 16 states. [2018-10-22 10:17:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:56,741 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-10-22 10:17:56,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-22 10:17:56,741 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-10-22 10:17:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:56,746 INFO L225 Difference]: With dead ends: 80 [2018-10-22 10:17:56,746 INFO L226 Difference]: Without dead ends: 76 [2018-10-22 10:17:56,747 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-10-22 10:17:56,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-22 10:17:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-22 10:17:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-22 10:17:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-10-22 10:17:56,767 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 50 [2018-10-22 10:17:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:56,769 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-10-22 10:17:56,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-22 10:17:56,769 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-10-22 10:17:56,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-22 10:17:56,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:56,772 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:56,772 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:56,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:56,772 INFO L82 PathProgramCache]: Analyzing trace with hash -244973226, now seen corresponding path program 1 times [2018-10-22 10:17:56,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:56,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:56,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:56,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:56,775 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-22 10:17:57,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:57,007 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:17:57,007 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-10-22 10:17:57,007 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [32], [34], [39], [52], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86], [87], [88], [90], [91], [93] [2018-10-22 10:17:57,010 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:17:57,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:17:57,169 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:17:57,170 INFO L272 AbstractInterpreter]: Visited 33 different actions 432 times. Merged at 13 different actions 91 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 11 variables. [2018-10-22 10:17:57,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:57,197 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:17:57,244 INFO L232 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 67.94% of their original sizes. [2018-10-22 10:17:57,245 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:17:57,680 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:17:57,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:17:57,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 23 [2018-10-22 10:17:57,681 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:17:57,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-22 10:17:57,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-22 10:17:57,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-10-22 10:17:57,682 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 14 states. [2018-10-22 10:17:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:59,420 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2018-10-22 10:17:59,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-22 10:17:59,421 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-10-22 10:17:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:59,422 INFO L225 Difference]: With dead ends: 76 [2018-10-22 10:17:59,422 INFO L226 Difference]: Without dead ends: 0 [2018-10-22 10:17:59,424 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-10-22 10:17:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-22 10:17:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-22 10:17:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-22 10:17:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-22 10:17:59,428 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-10-22 10:17:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:59,430 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-22 10:17:59,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-22 10:17:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-22 10:17:59,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-22 10:17:59,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-22 10:17:59,582 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 160 [2018-10-22 10:17:59,690 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 154 [2018-10-22 10:17:59,804 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 184 [2018-10-22 10:17:59,929 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 184 [2018-10-22 10:18:02,295 WARN L179 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 159 DAG size of output: 30 [2018-10-22 10:18:02,979 WARN L179 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 31 [2018-10-22 10:18:05,020 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 183 DAG size of output: 33 [2018-10-22 10:18:05,126 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2018-10-22 10:18:06,153 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 183 DAG size of output: 33 [2018-10-22 10:18:06,343 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2018-10-22 10:18:06,948 WARN L179 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 31 [2018-10-22 10:18:07,182 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 22 [2018-10-22 10:18:07,416 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 22 [2018-10-22 10:18:07,419 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-22 10:18:07,419 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-22 10:18:07,420 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-22 10:18:07,420 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-22 10:18:07,420 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-22 10:18:07,420 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-22 10:18:07,420 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse1 (<= main_~bufferlen~0 .cse3)) (.cse2 (<= (+ main_~buflim~0 3) main_~inlen~0)) (.cse0 (<= .cse3 main_~bufferlen~0))) (or (and (<= main_~in~0 main_~buf~0) (<= main_~buf~0 main_~in~0) .cse0 .cse1 (<= (+ main_~buf~0 1) main_~buflim~0) (<= 2 (+ main_~buf~0 main_~in~0)) .cse2 (<= (* 2 main_~inlen~0) 4294967294)) (and .cse1 (= main_~buf~0 0) (= main_~in~0 0) .cse2 .cse0 (<= 1 (+ main_~in~0 main_~buflim~0)) (<= main_~inlen~0 (+ main_~buf~0 2147483647)))))) [2018-10-22 10:18:07,420 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse1 (<= main_~bufferlen~0 .cse3)) (.cse2 (<= (+ main_~buflim~0 3) main_~inlen~0)) (.cse0 (<= .cse3 main_~bufferlen~0))) (or (and (<= main_~in~0 main_~buf~0) (<= main_~buf~0 main_~in~0) .cse0 .cse1 (<= (+ main_~buf~0 1) main_~buflim~0) (<= 2 (+ main_~buf~0 main_~in~0)) .cse2 (<= (* 2 main_~inlen~0) 4294967294)) (and .cse1 (= main_~buf~0 0) (= main_~in~0 0) .cse2 .cse0 (<= 1 (+ main_~in~0 main_~buflim~0)) (<= main_~inlen~0 (+ main_~buf~0 2147483647)))))) [2018-10-22 10:18:07,421 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2018-10-22 10:18:07,423 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-10-22 10:18:07,423 INFO L425 ceAbstractionStarter]: For program point L23-2(lines 23 34) no Hoare annotation was computed. [2018-10-22 10:18:07,423 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-10-22 10:18:07,424 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 34) the Hoare annotation is: (let ((.cse4 (* 2 main_~inlen~0)) (.cse5 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse5)) (.cse1 (<= .cse5 main_~bufferlen~0)) (.cse2 (<= .cse4 4294967294)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~in~0 main_~buf~0) .cse0 (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) .cse1 (<= 2 (* 2 main_~in~0)) .cse2 .cse3) (and (<= 2 .cse4) .cse0 (= main_~in~0 0) .cse1 .cse2 .cse3 (= main_~buf~0 0) (<= (+ main_~in~0 main_~buflim~0) 2147483644))))) [2018-10-22 10:18:07,424 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-10-22 10:18:07,425 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= (* 2 main_~inlen~0) 4294967294) (<= main_~in~0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 (* 2 main_~in~0)))) [2018-10-22 10:18:07,425 INFO L421 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= (* 2 main_~inlen~0) 4294967294) (<= main_~in~0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 (* 2 main_~in~0)))) [2018-10-22 10:18:07,425 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-22 10:18:07,425 INFO L428 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2018-10-22 10:18:07,425 INFO L421 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse4 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse4)) (.cse1 (<= (+ main_~buflim~0 3) main_~inlen~0)) (.cse2 (<= .cse4 main_~bufferlen~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~in~0 main_~buf~0) .cse0 (<= main_~buf~0 main_~in~0) .cse1 .cse2 (<= 2 (* 2 main_~in~0)) (<= (* 2 main_~inlen~0) 4294967294) .cse3) (and .cse0 (= main_~buf~0 0) (= main_~in~0 0) .cse1 .cse2 (<= main_~inlen~0 (+ main_~buf~0 2147483647)) .cse3)))) [2018-10-22 10:18:07,425 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-10-22 10:18:07,426 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-10-22 10:18:07,426 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2018-10-22 10:18:07,426 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2018-10-22 10:18:07,426 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse4 (* 2 main_~inlen~0))) (let ((.cse0 (<= 2 .cse4)) (.cse1 (<= .cse4 4294967294))) (or (let ((.cse2 (+ main_~buf~0 main_~bufferlen~0))) (and .cse0 (= main_~buf~0 1) .cse1 (<= 3 .cse2) (<= .cse2 2147483647))) (let ((.cse3 (* 2 main_~in~0))) (and (<= (* 2 main_~bufferlen~0) 4294967292) .cse0 (<= 2 .cse3) (<= .cse3 4294967288) .cse1 (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 2 (* 2 main_~buf~0))))))) [2018-10-22 10:18:07,426 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse4 (* 2 main_~inlen~0))) (let ((.cse0 (<= 2 .cse4)) (.cse1 (<= .cse4 4294967294))) (or (let ((.cse2 (+ main_~buf~0 main_~bufferlen~0))) (and .cse0 (= main_~buf~0 1) .cse1 (<= 3 .cse2) (<= .cse2 2147483647))) (let ((.cse3 (* 2 main_~in~0))) (and (<= (* 2 main_~bufferlen~0) 4294967292) .cse0 (<= 2 .cse3) (<= .cse3 4294967288) .cse1 (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 2 (* 2 main_~buf~0))))))) [2018-10-22 10:18:07,426 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-10-22 10:18:07,426 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2018-10-22 10:18:07,426 INFO L425 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2018-10-22 10:18:07,426 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-22 10:18:07,431 INFO L421 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse4 (* 2 main_~inlen~0)) (.cse5 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse5)) (.cse1 (<= .cse5 main_~bufferlen~0)) (.cse2 (<= .cse4 4294967294)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~in~0 main_~buf~0) .cse0 (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) .cse1 (<= 2 (* 2 main_~in~0)) .cse2 .cse3) (and (<= 2 .cse4) .cse0 (= main_~in~0 0) .cse1 .cse2 .cse3 (= main_~buf~0 0) (<= (+ main_~in~0 main_~buflim~0) 2147483644))))) [2018-10-22 10:18:07,431 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-22 10:18:07,431 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-22 10:18:07,431 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-22 10:18:07,431 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-22 10:18:07,431 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-22 10:18:07,432 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-22 10:18:07,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 10:18:07 BoogieIcfgContainer [2018-10-22 10:18:07,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 10:18:07,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-22 10:18:07,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-22 10:18:07,453 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-22 10:18:07,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:17:44" (3/4) ... [2018-10-22 10:18:07,459 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-22 10:18:07,465 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-22 10:18:07,465 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-22 10:18:07,466 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-22 10:18:07,471 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-10-22 10:18:07,471 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-10-22 10:18:07,472 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-22 10:18:07,529 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-22 10:18:07,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-22 10:18:07,530 INFO L168 Benchmark]: Toolchain (without parser) took 24329.66 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 352.8 MB). Free memory was 954.5 MB in the beginning and 1.0 GB in the end (delta: -69.4 MB). Peak memory consumption was 283.4 MB. Max. memory is 11.5 GB. [2018-10-22 10:18:07,532 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:18:07,532 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.44 ms. Allocated memory is still 1.0 GB. Free memory was 954.5 MB in the beginning and 943.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-22 10:18:07,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.09 ms. Allocated memory is still 1.0 GB. Free memory is still 943.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:18:07,534 INFO L168 Benchmark]: Boogie Preprocessor took 22.76 ms. Allocated memory is still 1.0 GB. Free memory is still 943.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:18:07,534 INFO L168 Benchmark]: RCFGBuilder took 601.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-10-22 10:18:07,536 INFO L168 Benchmark]: TraceAbstraction took 23321.12 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.5 MB). Peak memory consumption was 491.0 MB. Max. memory is 11.5 GB. [2018-10-22 10:18:07,537 INFO L168 Benchmark]: Witness Printer took 76.81 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2018-10-22 10:18:07,541 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 284.44 ms. Allocated memory is still 1.0 GB. Free memory was 954.5 MB in the beginning and 943.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.09 ms. Allocated memory is still 1.0 GB. Free memory is still 943.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.76 ms. Allocated memory is still 1.0 GB. Free memory is still 943.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 601.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23321.12 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.5 MB). Peak memory consumption was 491.0 MB. Max. memory is 11.5 GB. * Witness Printer took 76.81 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((in <= buf && bufferlen <= buflim + 2) && buf <= in) && buflim + 3 <= inlen) && buflim + 2 <= bufferlen) && 2 <= 2 * in) && 2 * inlen <= 4294967294) && buf + 2 <= bufferlen) || ((((((bufferlen <= buflim + 2 && buf == 0) && in == 0) && buflim + 3 <= inlen) && buflim + 2 <= bufferlen) && inlen <= buf + 2147483647) && buf + 2 <= bufferlen) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. SAFE Result, 23.2s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 8.6s AutomataDifference, 0.0s DeadEndRemovalTime, 7.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 324 SDslu, 780 SDs, 0 SdLazy, 257 SolverSat, 424 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 245 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 6 AbstIntIterations, 6 AbstIntStrong, 0.9025165874430581 AbsIntWeakeningRatio, 0.5686274509803921 AbsIntAvgWeakeningVarsNumRemoved, 9.808823529411764 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 42 PreInvPairs, 66 NumberOfFragments, 562 HoareAnnotationTreeSize, 42 FomulaSimplifications, 5176 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 15 FomulaSimplificationsInter, 4370 FormulaSimplificationTreeSizeReductionInter, 7.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 25992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 157/225 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...