./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/derefAfterFree1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/derefAfterFree1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a759f8d678ad469b9fde9b60c61d539be5ffd1b82a7250e29929fb245cee5670 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:40,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:40,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:40,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:40,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:40,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:40,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:40,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:40,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:40,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:40,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:40,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:40,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:40,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:40,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:40,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:40,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:40,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:40,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:40,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:40,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:40,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:40,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:40,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:40,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:40,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:40,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:40,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:40,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:40,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:40,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:40,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:40,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:40,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:40,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:40,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:40,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:40,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:40,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:40,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:40,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:40,364 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-21 00:02:40,396 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:40,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:40,397 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:40,397 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:40,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:40,398 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:40,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:40,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:40,399 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:40,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:40,400 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:40,400 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:40,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:40,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:40,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:40,401 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:40,401 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:40,401 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:40,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:40,402 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:40,402 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:40,402 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:40,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:40,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:40,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:40,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:40,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:40,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:40,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:40,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:40,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a759f8d678ad469b9fde9b60c61d539be5ffd1b82a7250e29929fb245cee5670 [2022-02-21 00:02:40,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:40,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:40,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:40,681 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:40,681 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:40,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/derefAfterFree1.c [2022-02-21 00:02:40,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce5bff7f/d7d675d7d0f847daac2d3a0625cdaedc/FLAGde9643fb5 [2022-02-21 00:02:41,158 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:41,158 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/derefAfterFree1.c [2022-02-21 00:02:41,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce5bff7f/d7d675d7d0f847daac2d3a0625cdaedc/FLAGde9643fb5 [2022-02-21 00:02:41,180 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce5bff7f/d7d675d7d0f847daac2d3a0625cdaedc [2022-02-21 00:02:41,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:41,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:41,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:41,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:41,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:41,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f8131e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41, skipping insertion in model container [2022-02-21 00:02:41,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:41,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:41,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:41,418 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:41,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:41,443 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:41,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41 WrapperNode [2022-02-21 00:02:41,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:41,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:41,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:41,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:41,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,476 INFO L137 Inliner]: procedures = 10, calls = 6, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 17 [2022-02-21 00:02:41,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:41,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:41,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:41,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:41,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:41,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:41,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:41,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:41,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:41,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:41,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 00:02:41,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 00:02:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 00:02:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 00:02:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:41,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 00:02:41,615 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:41,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:41,757 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:41,762 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:41,765 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 00:02:41,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:41 BoogieIcfgContainer [2022-02-21 00:02:41,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:41,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:41,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:41,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:41,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:41" (1/3) ... [2022-02-21 00:02:41,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e983419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:41, skipping insertion in model container [2022-02-21 00:02:41,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (2/3) ... [2022-02-21 00:02:41,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e983419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:41, skipping insertion in model container [2022-02-21 00:02:41,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:41" (3/3) ... [2022-02-21 00:02:41,774 INFO L111 eAbstractionObserver]: Analyzing ICFG derefAfterFree1.c [2022-02-21 00:02:41,779 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:41,779 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 00:02:41,822 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:41,829 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 00:02:41,829 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 00:02:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 10 states have (on average 1.6) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 00:02:41,851 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:41,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 00:02:41,852 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2022-02-21 00:02:41,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2022-02-21 00:02:41,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:41,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136647] [2022-02-21 00:02:41,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {20#true} is VALID [2022-02-21 00:02:42,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;assume { :begin_inline_freePointer } true;freePointer_#in~p#1.base, freePointer_#in~p#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc freePointer_~p#1.base, freePointer_~p#1.offset;freePointer_~p#1.base, freePointer_~p#1.offset := freePointer_#in~p#1.base, freePointer_#in~p#1.offset; {22#(= |ULTIMATE.start_freePointer_~p#1.offset| 0)} is VALID [2022-02-21 00:02:42,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#(= |ULTIMATE.start_freePointer_~p#1.offset| 0)} assume !(0 == freePointer_~p#1.offset); {21#false} is VALID [2022-02-21 00:02:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:42,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:42,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136647] [2022-02-21 00:02:42,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136647] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:42,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:42,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:42,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617544331] [2022-02-21 00:02:42,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:42,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 00:02:42,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:42,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:42,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:42,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:42,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,087 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.6) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,114 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-02-21 00:02:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:42,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 00:02:42,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-21 00:02:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-21 00:02:42,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2022-02-21 00:02:42,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,146 INFO L225 Difference]: With dead ends: 16 [2022-02-21 00:02:42,147 INFO L226 Difference]: Without dead ends: 14 [2022-02-21 00:02:42,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,152 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:42,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-21 00:02:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 00:02:42,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:42,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,184 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,185 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,190 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2022-02-21 00:02:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2022-02-21 00:02:42,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-21 00:02:42,192 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-21 00:02:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,198 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2022-02-21 00:02:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2022-02-21 00:02:42,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:42,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2022-02-21 00:02:42,205 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 3 [2022-02-21 00:02:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:42,206 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2022-02-21 00:02:42,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,206 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2022-02-21 00:02:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 00:02:42,207 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:42,207 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 00:02:42,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:42,209 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2022-02-21 00:02:42,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2022-02-21 00:02:42,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:42,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272961392] [2022-02-21 00:02:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {83#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {83#true} is VALID [2022-02-21 00:02:42,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {83#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;assume { :begin_inline_freePointer } true;freePointer_#in~p#1.base, freePointer_#in~p#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc freePointer_~p#1.base, freePointer_~p#1.offset;freePointer_~p#1.base, freePointer_~p#1.offset := freePointer_#in~p#1.base, freePointer_#in~p#1.offset; {85#(<= (+ |ULTIMATE.start_freePointer_~p#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:02:42,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {85#(<= (+ |ULTIMATE.start_freePointer_~p#1.base| 1) |#StackHeapBarrier|)} assume 0 == freePointer_~p#1.offset; {85#(<= (+ |ULTIMATE.start_freePointer_~p#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:02:42,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {85#(<= (+ |ULTIMATE.start_freePointer_~p#1.base| 1) |#StackHeapBarrier|)} assume !(freePointer_~p#1.base < #StackHeapBarrier); {84#false} is VALID [2022-02-21 00:02:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:42,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:42,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272961392] [2022-02-21 00:02:42,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272961392] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:42,282 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:42,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:42,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512685102] [2022-02-21 00:02:42,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:42,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:42,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:42,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:42,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:42,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:42,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,298 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,317 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2022-02-21 00:02:42,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:42,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-21 00:02:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-21 00:02:42,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 13 transitions. [2022-02-21 00:02:42,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,352 INFO L225 Difference]: With dead ends: 13 [2022-02-21 00:02:42,353 INFO L226 Difference]: Without dead ends: 13 [2022-02-21 00:02:42,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,355 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:42,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-21 00:02:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 00:02:42,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:42,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,362 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,363 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,366 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2022-02-21 00:02:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-21 00:02:42,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-21 00:02:42,368 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-21 00:02:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,369 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2022-02-21 00:02:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-21 00:02:42,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:42,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2022-02-21 00:02:42,372 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 4 [2022-02-21 00:02:42,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:42,373 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2022-02-21 00:02:42,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-21 00:02:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 00:02:42,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:42,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 00:02:42,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:42,375 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2022-02-21 00:02:42,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:42,375 INFO L85 PathProgramCache]: Analyzing trace with hash 28692770, now seen corresponding path program 1 times [2022-02-21 00:02:42,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:42,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657758083] [2022-02-21 00:02:42,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {140#true} is VALID [2022-02-21 00:02:42,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;assume { :begin_inline_freePointer } true;freePointer_#in~p#1.base, freePointer_#in~p#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc freePointer_~p#1.base, freePointer_~p#1.offset;freePointer_~p#1.base, freePointer_~p#1.offset := freePointer_#in~p#1.base, freePointer_#in~p#1.offset; {142#(= (select |#valid| |ULTIMATE.start_freePointer_~p#1.base|) 1)} is VALID [2022-02-21 00:02:42,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#(= (select |#valid| |ULTIMATE.start_freePointer_~p#1.base|) 1)} assume 0 == freePointer_~p#1.offset; {142#(= (select |#valid| |ULTIMATE.start_freePointer_~p#1.base|) 1)} is VALID [2022-02-21 00:02:42,415 INFO L290 TraceCheckUtils]: 3: Hoare triple {142#(= (select |#valid| |ULTIMATE.start_freePointer_~p#1.base|) 1)} assume freePointer_~p#1.base < #StackHeapBarrier; {142#(= (select |#valid| |ULTIMATE.start_freePointer_~p#1.base|) 1)} is VALID [2022-02-21 00:02:42,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {142#(= (select |#valid| |ULTIMATE.start_freePointer_~p#1.base|) 1)} assume !(0 == freePointer_~p#1.base || 1 == #valid[freePointer_~p#1.base]); {141#false} is VALID [2022-02-21 00:02:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:42,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:42,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657758083] [2022-02-21 00:02:42,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657758083] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:42,417 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:42,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:42,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905872449] [2022-02-21 00:02:42,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:42,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 00:02:42,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:42,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:42,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:42,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:42,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,425 INFO L87 Difference]: Start difference. First operand 13 states and 12 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,448 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-21 00:02:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:42,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 00:02:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 00:02:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 00:02:42,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2022-02-21 00:02:42,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,478 INFO L225 Difference]: With dead ends: 12 [2022-02-21 00:02:42,478 INFO L226 Difference]: Without dead ends: 12 [2022-02-21 00:02:42,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,481 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:42,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-21 00:02:42,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 00:02:42,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:42,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,484 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,484 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,485 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-21 00:02:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-21 00:02:42,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-21 00:02:42,486 INFO L87 Difference]: Start difference. First operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-21 00:02:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,487 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-21 00:02:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-21 00:02:42,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:42,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2022-02-21 00:02:42,489 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 5 [2022-02-21 00:02:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:42,490 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2022-02-21 00:02:42,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-21 00:02:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 00:02:42,491 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:42,491 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:42,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:02:42,492 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2022-02-21 00:02:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:42,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949477, now seen corresponding path program 1 times [2022-02-21 00:02:42,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:42,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043153437] [2022-02-21 00:02:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:02:42,509 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 00:02:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:02:42,531 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 00:02:42,531 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 00:02:42,532 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION (5 of 6 remaining) [2022-02-21 00:02:42,534 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (4 of 6 remaining) [2022-02-21 00:02:42,534 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (3 of 6 remaining) [2022-02-21 00:02:42,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (2 of 6 remaining) [2022-02-21 00:02:42,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (1 of 6 remaining) [2022-02-21 00:02:42,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2022-02-21 00:02:42,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:02:42,538 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-21 00:02:42,541 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:02:42,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:02:42 BoogieIcfgContainer [2022-02-21 00:02:42,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:02:42,556 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:02:42,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:02:42,556 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:02:42,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:41" (3/4) ... [2022-02-21 00:02:42,558 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 00:02:42,585 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 00:02:42,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:02:42,587 INFO L158 Benchmark]: Toolchain (without parser) took 1400.60ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 67.2MB in the beginning and 89.8MB in the end (delta: -22.6MB). Peak memory consumption was 570.5kB. Max. memory is 16.1GB. [2022-02-21 00:02:42,587 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 107.0MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:42,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.63ms. Allocated memory is still 107.0MB. Free memory was 66.9MB in the beginning and 81.8MB in the end (delta: -14.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 00:02:42,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.08ms. Allocated memory is still 107.0MB. Free memory was 81.8MB in the beginning and 80.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:02:42,588 INFO L158 Benchmark]: Boogie Preprocessor took 29.67ms. Allocated memory is still 107.0MB. Free memory was 80.1MB in the beginning and 79.1MB in the end (delta: 972.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:42,589 INFO L158 Benchmark]: RCFGBuilder took 259.20ms. Allocated memory is still 107.0MB. Free memory was 79.1MB in the beginning and 69.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 00:02:42,589 INFO L158 Benchmark]: TraceAbstraction took 787.08ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 68.6MB in the beginning and 91.9MB in the end (delta: -23.3MB). Peak memory consumption was 809.2kB. Max. memory is 16.1GB. [2022-02-21 00:02:42,589 INFO L158 Benchmark]: Witness Printer took 29.56ms. Allocated memory is still 130.0MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:02:42,591 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 107.0MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.63ms. Allocated memory is still 107.0MB. Free memory was 66.9MB in the beginning and 81.8MB in the end (delta: -14.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.08ms. Allocated memory is still 107.0MB. Free memory was 81.8MB in the beginning and 80.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.67ms. Allocated memory is still 107.0MB. Free memory was 80.1MB in the beginning and 79.1MB in the end (delta: 972.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 259.20ms. Allocated memory is still 107.0MB. Free memory was 79.1MB in the beginning and 69.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 787.08ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 68.6MB in the beginning and 91.9MB in the end (delta: -23.3MB). Peak memory consumption was 809.2kB. Max. memory is 16.1GB. * Witness Printer took 29.56ms. Allocated memory is still 130.0MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L10] int* p = malloc(10 * sizeof(int)); [L12] CALL freePointer(p) [L6] free(p) VAL [p={2:0}, p={2:0}] [L6] free(p) VAL [p={2:0}, p={2:0}] [L6] free(p) [L12] RET freePointer(p) [L14] p[0] = 1 - UnprovableResult [Line: 6]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 6]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 6]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 9]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 32 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 31 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-21 00:02:42,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)