java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:15:15,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:15:15,302 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:15:15,314 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:15:15,314 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:15:15,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:15:15,316 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:15:15,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:15:15,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:15:15,320 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:15:15,321 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:15:15,322 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:15:15,323 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:15:15,323 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:15:15,325 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:15:15,325 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:15:15,326 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:15:15,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:15:15,330 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:15:15,332 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:15:15,333 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:15:15,334 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:15:15,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:15:15,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:15:15,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:15:15,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:15:15,339 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:15:15,340 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:15:15,341 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:15:15,342 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:15:15,342 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:15:15,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:15:15,343 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:15:15,343 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:15:15,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:15:15,345 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:15:15,345 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:15:15,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:15:15,362 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:15:15,363 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:15:15,363 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:15:15,366 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:15:15,366 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:15:15,366 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:15:15,366 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:15:15,367 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:15:15,367 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:15:15,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:15:15,367 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:15:15,367 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:15:15,368 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:15:15,368 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:15:15,368 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:15:15,368 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:15:15,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:15:15,368 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:15:15,370 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:15:15,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:15:15,370 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:15:15,371 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:15:15,371 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:15:15,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:15:15,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:15:15,371 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:15:15,372 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:15:15,372 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:15:15,373 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:15:15,373 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:15:15,373 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:15:15,373 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:15:15,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:15:15,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:15:15,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:15:15,457 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:15:15,458 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:15:15,459 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:15,526 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/015b85f02/3ed799f440144b019eae77e97760a37c/FLAGcb5593e13 [2018-11-23 11:15:16,092 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:15:16,093 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:16,108 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/015b85f02/3ed799f440144b019eae77e97760a37c/FLAGcb5593e13 [2018-11-23 11:15:16,371 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/015b85f02/3ed799f440144b019eae77e97760a37c [2018-11-23 11:15:16,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:15:16,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:15:16,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:16,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:15:16,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:15:16,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:16" (1/1) ... [2018-11-23 11:15:16,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d23952d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:16, skipping insertion in model container [2018-11-23 11:15:16,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:16" (1/1) ... [2018-11-23 11:15:16,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:15:16,455 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:15:16,893 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:16,917 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:15:16,983 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:17,166 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:15:17,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:17 WrapperNode [2018-11-23 11:15:17,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:17,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:17,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:15:17,168 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:15:17,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:17" (1/1) ... [2018-11-23 11:15:17,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:17" (1/1) ... [2018-11-23 11:15:17,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:17,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:15:17,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:15:17,210 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:15:17,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:17" (1/1) ... [2018-11-23 11:15:17,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:17" (1/1) ... [2018-11-23 11:15:17,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:17" (1/1) ... [2018-11-23 11:15:17,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:17" (1/1) ... [2018-11-23 11:15:17,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:17" (1/1) ... [2018-11-23 11:15:17,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:17" (1/1) ... [2018-11-23 11:15:17,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:17" (1/1) ... [2018-11-23 11:15:17,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:15:17,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:15:17,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:15:17,275 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:15:17,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:15:17,334 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-23 11:15:17,334 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-23 11:15:17,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:15:17,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:15:17,334 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-11-23 11:15:17,335 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-11-23 11:15:17,335 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:15:17,335 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:15:17,335 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-11-23 11:15:17,335 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-11-23 11:15:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:15:17,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:15:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:15:17,336 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:15:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:15:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:15:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:15:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:15:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-23 11:15:17,337 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-23 11:15:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:15:17,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:15:18,390 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:15:18,391 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:15:18,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:18 BoogieIcfgContainer [2018-11-23 11:15:18,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:15:18,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:15:18,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:15:18,396 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:15:18,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:15:16" (1/3) ... [2018-11-23 11:15:18,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b413693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:18, skipping insertion in model container [2018-11-23 11:15:18,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:17" (2/3) ... [2018-11-23 11:15:18,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b413693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:18, skipping insertion in model container [2018-11-23 11:15:18,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:18" (3/3) ... [2018-11-23 11:15:18,400 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:18,411 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:15:18,419 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:15:18,437 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:15:18,469 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:15:18,470 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:15:18,471 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:15:18,471 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:15:18,471 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:15:18,471 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:15:18,471 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:15:18,471 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:15:18,471 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:15:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 11:15:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:15:18,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:18,499 INFO L402 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] [2018-11-23 11:15:18,501 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:18,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:18,506 INFO L82 PathProgramCache]: Analyzing trace with hash 821800959, now seen corresponding path program 1 times [2018-11-23 11:15:18,510 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:18,511 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:15:18,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:18,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:18,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2018-11-23 11:15:18,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {53#true} is VALID [2018-11-23 11:15:18,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 11:15:18,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53#true} {53#true} #137#return; {53#true} is VALID [2018-11-23 11:15:18,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {53#true} call #t~ret15 := main(); {53#true} is VALID [2018-11-23 11:15:18,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {53#true} ~len~0 := 2bv32;~data~0 := 1bv32; {73#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:18,876 INFO L256 TraceCheckUtils]: 6: Hoare triple {73#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {53#true} is VALID [2018-11-23 11:15:18,889 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {80#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:18,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {80#(= dll_create_~len |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {84#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:18,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {84#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {84#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:18,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {84#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} assume true; {84#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:18,911 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {84#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} {73#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #127#return; {54#false} is VALID [2018-11-23 11:15:18,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {54#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {54#false} is VALID [2018-11-23 11:15:18,912 INFO L273 TraceCheckUtils]: 13: Hoare triple {54#false} assume !~bvsge32(~i~0, 0bv32); {54#false} is VALID [2018-11-23 11:15:18,913 INFO L273 TraceCheckUtils]: 14: Hoare triple {54#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {54#false} is VALID [2018-11-23 11:15:18,913 INFO L273 TraceCheckUtils]: 15: Hoare triple {54#false} assume !!~bvsle32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {54#false} is VALID [2018-11-23 11:15:18,914 INFO L256 TraceCheckUtils]: 16: Hoare triple {54#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {54#false} is VALID [2018-11-23 11:15:18,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {54#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {54#false} is VALID [2018-11-23 11:15:18,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {54#false} assume !~bvsgt32(~index, 0bv32); {54#false} is VALID [2018-11-23 11:15:18,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {54#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {54#false} is VALID [2018-11-23 11:15:18,915 INFO L273 TraceCheckUtils]: 20: Hoare triple {54#false} assume true; {54#false} is VALID [2018-11-23 11:15:18,916 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {54#false} {54#false} #131#return; {54#false} is VALID [2018-11-23 11:15:18,916 INFO L273 TraceCheckUtils]: 22: Hoare triple {54#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {54#false} is VALID [2018-11-23 11:15:18,916 INFO L273 TraceCheckUtils]: 23: Hoare triple {54#false} assume !false; {54#false} is VALID [2018-11-23 11:15:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:15:18,923 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:18,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:18,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:15:18,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:15:18,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:18,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:15:19,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:19,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:15:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:15:19,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:15:19,027 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 5 states. [2018-11-23 11:15:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:20,777 INFO L93 Difference]: Finished difference Result 93 states and 124 transitions. [2018-11-23 11:15:20,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:15:20,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:15:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2018-11-23 11:15:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2018-11-23 11:15:20,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 124 transitions. [2018-11-23 11:15:21,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:21,176 INFO L225 Difference]: With dead ends: 93 [2018-11-23 11:15:21,176 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:15:21,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:15:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:15:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-23 11:15:21,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:21,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 38 states. [2018-11-23 11:15:21,474 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 38 states. [2018-11-23 11:15:21,474 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 38 states. [2018-11-23 11:15:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:21,479 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 11:15:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:15:21,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:21,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:21,481 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 42 states. [2018-11-23 11:15:21,481 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 42 states. [2018-11-23 11:15:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:21,486 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 11:15:21,486 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:15:21,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:21,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:21,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:21,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:15:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 11:15:21,493 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 24 [2018-11-23 11:15:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:21,497 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 11:15:21,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:15:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 11:15:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:15:21,499 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:21,499 INFO L402 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] [2018-11-23 11:15:21,499 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:21,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1631243427, now seen corresponding path program 1 times [2018-11-23 11:15:21,501 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:21,501 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:15:21,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:21,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:21,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {399#true} is VALID [2018-11-23 11:15:21,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {399#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {399#true} is VALID [2018-11-23 11:15:21,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2018-11-23 11:15:21,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #137#return; {399#true} is VALID [2018-11-23 11:15:21,657 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret15 := main(); {399#true} is VALID [2018-11-23 11:15:21,658 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#true} ~len~0 := 2bv32;~data~0 := 1bv32; {399#true} is VALID [2018-11-23 11:15:21,658 INFO L256 TraceCheckUtils]: 6: Hoare triple {399#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {399#true} is VALID [2018-11-23 11:15:21,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {399#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {425#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:21,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {425#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {425#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:21,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {425#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {425#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:21,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {425#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {425#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:21,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {425#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {400#false} is VALID [2018-11-23 11:15:21,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {400#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {400#false} is VALID [2018-11-23 11:15:21,664 INFO L273 TraceCheckUtils]: 13: Hoare triple {400#false} assume !~bvsgt32(~len, 0bv32); {400#false} is VALID [2018-11-23 11:15:21,665 INFO L273 TraceCheckUtils]: 14: Hoare triple {400#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {400#false} is VALID [2018-11-23 11:15:21,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {400#false} assume true; {400#false} is VALID [2018-11-23 11:15:21,666 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {400#false} {399#true} #127#return; {400#false} is VALID [2018-11-23 11:15:21,666 INFO L273 TraceCheckUtils]: 17: Hoare triple {400#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {400#false} is VALID [2018-11-23 11:15:21,666 INFO L273 TraceCheckUtils]: 18: Hoare triple {400#false} assume !~bvsge32(~i~0, 0bv32); {400#false} is VALID [2018-11-23 11:15:21,667 INFO L273 TraceCheckUtils]: 19: Hoare triple {400#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {400#false} is VALID [2018-11-23 11:15:21,668 INFO L273 TraceCheckUtils]: 20: Hoare triple {400#false} assume !!~bvsle32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {400#false} is VALID [2018-11-23 11:15:21,668 INFO L256 TraceCheckUtils]: 21: Hoare triple {400#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {400#false} is VALID [2018-11-23 11:15:21,668 INFO L273 TraceCheckUtils]: 22: Hoare triple {400#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {400#false} is VALID [2018-11-23 11:15:21,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {400#false} assume !~bvsgt32(~index, 0bv32); {400#false} is VALID [2018-11-23 11:15:21,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {400#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {400#false} is VALID [2018-11-23 11:15:21,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {400#false} assume true; {400#false} is VALID [2018-11-23 11:15:21,669 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {400#false} {400#false} #131#return; {400#false} is VALID [2018-11-23 11:15:21,670 INFO L273 TraceCheckUtils]: 27: Hoare triple {400#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {400#false} is VALID [2018-11-23 11:15:21,670 INFO L273 TraceCheckUtils]: 28: Hoare triple {400#false} assume !false; {400#false} is VALID [2018-11-23 11:15:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:15:21,673 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:21,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:21,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:15:21,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 11:15:21,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:21,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:15:21,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:21,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:15:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:15:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:15:21,742 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 3 states. [2018-11-23 11:15:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:22,398 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-23 11:15:22,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:15:22,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 11:15:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:15:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 11:15:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:15:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 11:15:22,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-23 11:15:22,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:22,591 INFO L225 Difference]: With dead ends: 71 [2018-11-23 11:15:22,591 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:15:22,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:15:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:15:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 11:15:22,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:22,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 11:15:22,679 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 11:15:22,679 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 11:15:22,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:22,683 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 11:15:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 11:15:22,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:22,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:22,684 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 11:15:22,684 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 11:15:22,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:22,687 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 11:15:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 11:15:22,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:22,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:22,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:22,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:15:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-23 11:15:22,692 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2018-11-23 11:15:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:22,692 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-23 11:15:22,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:15:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:15:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:15:22,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:22,694 INFO L402 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] [2018-11-23 11:15:22,694 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:22,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:22,695 INFO L82 PathProgramCache]: Analyzing trace with hash -362901279, now seen corresponding path program 1 times [2018-11-23 11:15:22,695 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:22,695 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:15:22,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:22,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:22,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {728#true} call ULTIMATE.init(); {728#true} is VALID [2018-11-23 11:15:22,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {728#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {728#true} is VALID [2018-11-23 11:15:22,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {728#true} assume true; {728#true} is VALID [2018-11-23 11:15:22,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {728#true} {728#true} #137#return; {728#true} is VALID [2018-11-23 11:15:22,929 INFO L256 TraceCheckUtils]: 4: Hoare triple {728#true} call #t~ret15 := main(); {728#true} is VALID [2018-11-23 11:15:22,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {728#true} ~len~0 := 2bv32;~data~0 := 1bv32; {748#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:22,930 INFO L256 TraceCheckUtils]: 6: Hoare triple {748#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {728#true} is VALID [2018-11-23 11:15:22,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {755#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:22,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {755#(= dll_create_~len |dll_create_#in~len|)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {755#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:22,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {755#(= dll_create_~len |dll_create_#in~len|)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {755#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:22,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {755#(= dll_create_~len |dll_create_#in~len|)} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {755#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:22,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {755#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {755#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:22,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {755#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {771#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-23 11:15:22,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {771#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:22,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:22,947 INFO L273 TraceCheckUtils]: 15: Hoare triple {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:22,949 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {748#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #127#return; {729#false} is VALID [2018-11-23 11:15:22,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {729#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {729#false} is VALID [2018-11-23 11:15:22,950 INFO L273 TraceCheckUtils]: 18: Hoare triple {729#false} assume !~bvsge32(~i~0, 0bv32); {729#false} is VALID [2018-11-23 11:15:22,950 INFO L273 TraceCheckUtils]: 19: Hoare triple {729#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {729#false} is VALID [2018-11-23 11:15:22,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {729#false} assume !!~bvsle32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {729#false} is VALID [2018-11-23 11:15:22,950 INFO L256 TraceCheckUtils]: 21: Hoare triple {729#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {729#false} is VALID [2018-11-23 11:15:22,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {729#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {729#false} is VALID [2018-11-23 11:15:22,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {729#false} assume !~bvsgt32(~index, 0bv32); {729#false} is VALID [2018-11-23 11:15:22,951 INFO L273 TraceCheckUtils]: 24: Hoare triple {729#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {729#false} is VALID [2018-11-23 11:15:22,952 INFO L273 TraceCheckUtils]: 25: Hoare triple {729#false} assume true; {729#false} is VALID [2018-11-23 11:15:22,952 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {729#false} {729#false} #131#return; {729#false} is VALID [2018-11-23 11:15:22,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {729#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {729#false} is VALID [2018-11-23 11:15:22,953 INFO L273 TraceCheckUtils]: 28: Hoare triple {729#false} assume !false; {729#false} is VALID [2018-11-23 11:15:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:15:22,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:23,267 INFO L273 TraceCheckUtils]: 28: Hoare triple {729#false} assume !false; {729#false} is VALID [2018-11-23 11:15:23,268 INFO L273 TraceCheckUtils]: 27: Hoare triple {729#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {729#false} is VALID [2018-11-23 11:15:23,269 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {728#true} {729#false} #131#return; {729#false} is VALID [2018-11-23 11:15:23,269 INFO L273 TraceCheckUtils]: 25: Hoare triple {728#true} assume true; {728#true} is VALID [2018-11-23 11:15:23,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {728#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {728#true} is VALID [2018-11-23 11:15:23,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {728#true} assume !~bvsgt32(~index, 0bv32); {728#true} is VALID [2018-11-23 11:15:23,270 INFO L273 TraceCheckUtils]: 22: Hoare triple {728#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {728#true} is VALID [2018-11-23 11:15:23,271 INFO L256 TraceCheckUtils]: 21: Hoare triple {729#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {728#true} is VALID [2018-11-23 11:15:23,271 INFO L273 TraceCheckUtils]: 20: Hoare triple {729#false} assume !!~bvsle32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {729#false} is VALID [2018-11-23 11:15:23,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {729#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {729#false} is VALID [2018-11-23 11:15:23,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {729#false} assume !~bvsge32(~i~0, 0bv32); {729#false} is VALID [2018-11-23 11:15:23,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {729#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {729#false} is VALID [2018-11-23 11:15:23,290 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {857#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #127#return; {729#false} is VALID [2018-11-23 11:15:23,299 INFO L273 TraceCheckUtils]: 15: Hoare triple {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:23,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:23,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {870#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:23,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {874#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {870#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:15:23,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {874#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {874#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:15:23,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {874#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {874#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:15:23,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {874#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {874#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:15:23,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {874#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {874#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:15:23,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {874#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:15:23,313 INFO L256 TraceCheckUtils]: 6: Hoare triple {857#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {728#true} is VALID [2018-11-23 11:15:23,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {728#true} ~len~0 := 2bv32;~data~0 := 1bv32; {857#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:23,318 INFO L256 TraceCheckUtils]: 4: Hoare triple {728#true} call #t~ret15 := main(); {728#true} is VALID [2018-11-23 11:15:23,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {728#true} {728#true} #137#return; {728#true} is VALID [2018-11-23 11:15:23,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {728#true} assume true; {728#true} is VALID [2018-11-23 11:15:23,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {728#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {728#true} is VALID [2018-11-23 11:15:23,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {728#true} call ULTIMATE.init(); {728#true} is VALID [2018-11-23 11:15:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:15:23,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:15:23,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:15:23,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-23 11:15:23,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:23,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:15:23,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:23,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:15:23,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:15:23,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:15:23,450 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 9 states. [2018-11-23 11:15:25,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:25,311 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-23 11:15:25,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:15:25,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-23 11:15:25,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:15:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2018-11-23 11:15:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:15:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2018-11-23 11:15:25,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2018-11-23 11:15:25,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:25,552 INFO L225 Difference]: With dead ends: 71 [2018-11-23 11:15:25,552 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:15:25,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:15:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:15:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-23 11:15:25,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:25,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 43 states. [2018-11-23 11:15:25,592 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 43 states. [2018-11-23 11:15:25,592 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 43 states. [2018-11-23 11:15:25,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:25,596 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-23 11:15:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 11:15:25,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:25,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:25,597 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 47 states. [2018-11-23 11:15:25,597 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 47 states. [2018-11-23 11:15:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:25,600 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-23 11:15:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 11:15:25,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:25,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:25,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:25,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:15:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-23 11:15:25,604 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 29 [2018-11-23 11:15:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:25,605 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-23 11:15:25,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:15:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 11:15:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:15:25,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:25,606 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:25,607 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:25,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:25,607 INFO L82 PathProgramCache]: Analyzing trace with hash -196400895, now seen corresponding path program 1 times [2018-11-23 11:15:25,608 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:25,608 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:15:25,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:25,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:25,803 INFO L256 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1167#true} is VALID [2018-11-23 11:15:25,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {1167#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1167#true} is VALID [2018-11-23 11:15:25,804 INFO L273 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2018-11-23 11:15:25,804 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #137#return; {1167#true} is VALID [2018-11-23 11:15:25,804 INFO L256 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret15 := main(); {1167#true} is VALID [2018-11-23 11:15:25,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {1167#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1187#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:25,805 INFO L256 TraceCheckUtils]: 6: Hoare triple {1187#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1167#true} is VALID [2018-11-23 11:15:25,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {1167#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1167#true} is VALID [2018-11-23 11:15:25,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {1167#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1167#true} is VALID [2018-11-23 11:15:25,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {1167#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1167#true} is VALID [2018-11-23 11:15:25,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {1167#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1167#true} is VALID [2018-11-23 11:15:25,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {1167#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1167#true} is VALID [2018-11-23 11:15:25,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {1167#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1167#true} is VALID [2018-11-23 11:15:25,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {1167#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1167#true} is VALID [2018-11-23 11:15:25,808 INFO L273 TraceCheckUtils]: 14: Hoare triple {1167#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1167#true} is VALID [2018-11-23 11:15:25,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {1167#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1167#true} is VALID [2018-11-23 11:15:25,808 INFO L273 TraceCheckUtils]: 16: Hoare triple {1167#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {1167#true} is VALID [2018-11-23 11:15:25,809 INFO L273 TraceCheckUtils]: 17: Hoare triple {1167#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1167#true} is VALID [2018-11-23 11:15:25,809 INFO L273 TraceCheckUtils]: 18: Hoare triple {1167#true} assume !~bvsgt32(~len, 0bv32); {1167#true} is VALID [2018-11-23 11:15:25,810 INFO L273 TraceCheckUtils]: 19: Hoare triple {1167#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1167#true} is VALID [2018-11-23 11:15:25,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {1167#true} assume true; {1167#true} is VALID [2018-11-23 11:15:25,824 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1167#true} {1187#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #127#return; {1187#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:25,826 INFO L273 TraceCheckUtils]: 22: Hoare triple {1187#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {1239#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:25,827 INFO L273 TraceCheckUtils]: 23: Hoare triple {1239#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {1168#false} is VALID [2018-11-23 11:15:25,827 INFO L273 TraceCheckUtils]: 24: Hoare triple {1168#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1168#false} is VALID [2018-11-23 11:15:25,827 INFO L273 TraceCheckUtils]: 25: Hoare triple {1168#false} assume !!~bvsle32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1168#false} is VALID [2018-11-23 11:15:25,827 INFO L256 TraceCheckUtils]: 26: Hoare triple {1168#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1168#false} is VALID [2018-11-23 11:15:25,828 INFO L273 TraceCheckUtils]: 27: Hoare triple {1168#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1168#false} is VALID [2018-11-23 11:15:25,828 INFO L273 TraceCheckUtils]: 28: Hoare triple {1168#false} assume !~bvsgt32(~index, 0bv32); {1168#false} is VALID [2018-11-23 11:15:25,828 INFO L273 TraceCheckUtils]: 29: Hoare triple {1168#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1168#false} is VALID [2018-11-23 11:15:25,829 INFO L273 TraceCheckUtils]: 30: Hoare triple {1168#false} assume true; {1168#false} is VALID [2018-11-23 11:15:25,829 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1168#false} {1168#false} #131#return; {1168#false} is VALID [2018-11-23 11:15:25,829 INFO L273 TraceCheckUtils]: 32: Hoare triple {1168#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1168#false} is VALID [2018-11-23 11:15:25,829 INFO L273 TraceCheckUtils]: 33: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2018-11-23 11:15:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:15:25,832 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:25,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:25,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:15:25,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 11:15:25,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:25,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:15:25,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:25,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:15:25,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:15:25,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:15:25,882 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-11-23 11:15:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:26,531 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 11:15:26,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:15:26,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 11:15:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:15:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-23 11:15:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:15:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-23 11:15:26,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2018-11-23 11:15:26,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:26,684 INFO L225 Difference]: With dead ends: 48 [2018-11-23 11:15:26,685 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:15:26,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-11-23 11:15:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:15:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:15:26,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:26,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:15:26,687 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:15:26,687 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:15:26,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:26,688 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:15:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:15:26,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:26,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:26,689 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:15:26,689 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:15:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:26,689 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:15:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:15:26,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:26,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:26,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:26,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:15:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:15:26,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-11-23 11:15:26,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:26,690 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:15:26,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:15:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:15:26,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:26,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:15:26,901 INFO L451 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: true [2018-11-23 11:15:26,901 INFO L448 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2018-11-23 11:15:26,901 INFO L451 ceAbstractionStarter]: At program point dll_update_atENTRY(lines 606 612) the Hoare annotation is: true [2018-11-23 11:15:26,901 INFO L448 ceAbstractionStarter]: For program point dll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2018-11-23 11:15:26,901 INFO L448 ceAbstractionStarter]: For program point dll_update_atFINAL(lines 606 612) no Hoare annotation was computed. [2018-11-23 11:15:26,901 INFO L448 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-11-23 11:15:26,901 INFO L451 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-11-23 11:15:26,901 INFO L448 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-11-23 11:15:26,902 INFO L451 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2018-11-23 11:15:26,902 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:15:26,902 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:15:26,902 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:15:26,902 INFO L448 ceAbstractionStarter]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2018-11-23 11:15:26,902 INFO L451 ceAbstractionStarter]: At program point dll_createENTRY(lines 574 591) the Hoare annotation is: true [2018-11-23 11:15:26,902 INFO L451 ceAbstractionStarter]: At program point L576-2(lines 576 589) the Hoare annotation is: true [2018-11-23 11:15:26,902 INFO L448 ceAbstractionStarter]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2018-11-23 11:15:26,902 INFO L448 ceAbstractionStarter]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2018-11-23 11:15:26,902 INFO L451 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2018-11-23 11:15:26,903 INFO L448 ceAbstractionStarter]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2018-11-23 11:15:26,903 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2018-11-23 11:15:26,903 INFO L448 ceAbstractionStarter]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2018-11-23 11:15:26,903 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 580) no Hoare annotation was computed. [2018-11-23 11:15:26,903 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:15:26,903 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:15:26,903 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:15:26,903 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:15:26,904 INFO L451 ceAbstractionStarter]: At program point L600-2(lines 600 603) the Hoare annotation is: true [2018-11-23 11:15:26,904 INFO L448 ceAbstractionStarter]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2018-11-23 11:15:26,904 INFO L448 ceAbstractionStarter]: For program point dll_get_data_atFINAL(lines 599 605) no Hoare annotation was computed. [2018-11-23 11:15:26,904 INFO L451 ceAbstractionStarter]: At program point dll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2018-11-23 11:15:26,904 INFO L448 ceAbstractionStarter]: For program point dll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2018-11-23 11:15:26,904 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2018-11-23 11:15:26,904 INFO L448 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-11-23 11:15:26,904 INFO L444 ceAbstractionStarter]: At program point L624(line 624) the Hoare annotation is: false [2018-11-23 11:15:26,905 INFO L448 ceAbstractionStarter]: For program point L624-1(lines 624 626) no Hoare annotation was computed. [2018-11-23 11:15:26,905 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2018-11-23 11:15:26,905 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2018-11-23 11:15:26,905 INFO L444 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-11-23 11:15:26,905 INFO L448 ceAbstractionStarter]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2018-11-23 11:15:26,905 INFO L448 ceAbstractionStarter]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2018-11-23 11:15:26,905 INFO L444 ceAbstractionStarter]: At program point L622-3(lines 622 627) the Hoare annotation is: (and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:15:26,906 INFO L444 ceAbstractionStarter]: At program point L622-4(lines 622 627) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-11-23 11:15:26,906 INFO L444 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-11-23 11:15:26,906 INFO L444 ceAbstractionStarter]: At program point L618-2(lines 618 621) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-11-23 11:15:26,906 INFO L448 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2018-11-23 11:15:26,906 INFO L448 ceAbstractionStarter]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2018-11-23 11:15:26,906 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 613 632) the Hoare annotation is: true [2018-11-23 11:15:26,906 INFO L444 ceAbstractionStarter]: At program point L625(lines 613 632) the Hoare annotation is: false [2018-11-23 11:15:26,907 INFO L448 ceAbstractionStarter]: For program point dll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2018-11-23 11:15:26,907 INFO L451 ceAbstractionStarter]: At program point dll_destroyENTRY(lines 592 598) the Hoare annotation is: true [2018-11-23 11:15:26,907 INFO L451 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2018-11-23 11:15:26,907 INFO L448 ceAbstractionStarter]: For program point L593-3(lines 592 598) no Hoare annotation was computed. [2018-11-23 11:15:26,909 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:15:26,909 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2018-11-23 11:15:26,910 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2018-11-23 11:15:26,910 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:15:26,910 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2018-11-23 11:15:26,910 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2018-11-23 11:15:26,910 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2018-11-23 11:15:26,910 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:15:26,910 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2018-11-23 11:15:26,910 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2018-11-23 11:15:26,910 WARN L170 areAnnotationChecker]: L616-1 has no Hoare annotation [2018-11-23 11:15:26,911 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2018-11-23 11:15:26,911 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2018-11-23 11:15:26,911 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2018-11-23 11:15:26,911 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:15:26,911 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2018-11-23 11:15:26,911 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2018-11-23 11:15:26,911 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2018-11-23 11:15:26,911 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:15:26,912 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2018-11-23 11:15:26,912 WARN L170 areAnnotationChecker]: L616-1 has no Hoare annotation [2018-11-23 11:15:26,912 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2018-11-23 11:15:26,912 WARN L170 areAnnotationChecker]: dll_update_atFINAL has no Hoare annotation [2018-11-23 11:15:26,912 WARN L170 areAnnotationChecker]: dll_createFINAL has no Hoare annotation [2018-11-23 11:15:26,912 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2018-11-23 11:15:26,912 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2018-11-23 11:15:26,912 WARN L170 areAnnotationChecker]: dll_get_data_atFINAL has no Hoare annotation [2018-11-23 11:15:26,912 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2018-11-23 11:15:26,913 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2018-11-23 11:15:26,913 WARN L170 areAnnotationChecker]: dll_destroyEXIT has no Hoare annotation [2018-11-23 11:15:26,913 WARN L170 areAnnotationChecker]: dll_update_atEXIT has no Hoare annotation [2018-11-23 11:15:26,913 WARN L170 areAnnotationChecker]: dll_createEXIT has no Hoare annotation [2018-11-23 11:15:26,913 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2018-11-23 11:15:26,913 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2018-11-23 11:15:26,914 WARN L170 areAnnotationChecker]: dll_get_data_atEXIT has no Hoare annotation [2018-11-23 11:15:26,914 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2018-11-23 11:15:26,914 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2018-11-23 11:15:26,914 WARN L170 areAnnotationChecker]: L628 has no Hoare annotation [2018-11-23 11:15:26,914 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2018-11-23 11:15:26,914 WARN L170 areAnnotationChecker]: L584-2 has no Hoare annotation [2018-11-23 11:15:26,914 WARN L170 areAnnotationChecker]: L624-1 has no Hoare annotation [2018-11-23 11:15:26,914 WARN L170 areAnnotationChecker]: L624-1 has no Hoare annotation [2018-11-23 11:15:26,915 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:15:26,916 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 11:15:26,916 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:15:26,916 WARN L170 areAnnotationChecker]: L622-2 has no Hoare annotation [2018-11-23 11:15:26,916 WARN L170 areAnnotationChecker]: L628 has no Hoare annotation [2018-11-23 11:15:26,916 WARN L170 areAnnotationChecker]: L624-1 has no Hoare annotation [2018-11-23 11:15:26,917 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:15:26,917 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:15:26,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:15:26 BoogieIcfgContainer [2018-11-23 11:15:26,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:15:26,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:15:26,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:15:26,929 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:15:26,929 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:18" (3/4) ... [2018-11-23 11:15:26,934 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:15:26,942 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_update_at [2018-11-23 11:15:26,942 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-11-23 11:15:26,942 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:15:26,942 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2018-11-23 11:15:26,943 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_get_data_at [2018-11-23 11:15:26,943 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:15:26,943 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_destroy [2018-11-23 11:15:26,949 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-23 11:15:26,950 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-23 11:15:26,950 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:15:27,020 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i-witness.graphml [2018-11-23 11:15:27,020 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:15:27,022 INFO L168 Benchmark]: Toolchain (without parser) took 10641.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -309.6 MB). Peak memory consumption was 434.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:15:27,025 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:15:27,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.3 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:15:27,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:15:27,028 INFO L168 Benchmark]: Boogie Preprocessor took 64.35 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:15:27,028 INFO L168 Benchmark]: RCFGBuilder took 1117.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:15:27,029 INFO L168 Benchmark]: TraceAbstraction took 8535.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 419.9 MB). Peak memory consumption was 419.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:15:27,030 INFO L168 Benchmark]: Witness Printer took 92.25 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:15:27,040 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 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 784.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.3 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.35 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 1117.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8535.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 419.9 MB). Peak memory consumption was 419.9 MB. Max. memory is 7.1 GB. * Witness Printer took 92.25 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: 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: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ~bvadd64(len, 4294967294bv32) == 0bv32 - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: ~bvadd64(len, 4294967294bv32) == 0bv32 && ~bvadd64(i, 4294967295bv32) == 0bv32 - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 52 locations, 1 error locations. SAFE Result, 8.4s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 155 SDtfs, 67 SDslu, 379 SDs, 0 SdLazy, 91 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 4 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 40 PreInvPairs, 50 NumberOfFragments, 48 HoareAnnotationTreeSize, 40 FomulaSimplifications, 24 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 8631 SizeOfPredicates, 8 NumberOfNonLiveVariables, 364 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 8/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...