java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AbstractInterpretationC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 04:47:51,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 04:47:51,225 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 04:47:51,240 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 04:47:51,240 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 04:47:51,241 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 04:47:51,242 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 04:47:51,244 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 04:47:51,246 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 04:47:51,246 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 04:47:51,247 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 04:47:51,247 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 04:47:51,248 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 04:47:51,249 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 04:47:51,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 04:47:51,252 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 04:47:51,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 04:47:51,256 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 04:47:51,258 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 04:47:51,259 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 04:47:51,261 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 04:47:51,262 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 04:47:51,262 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 04:47:51,263 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 04:47:51,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 04:47:51,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 04:47:51,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 04:47:51,266 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 04:47:51,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 04:47:51,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 04:47:51,267 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 04:47:51,268 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_smtcomp.epf [2018-01-25 04:47:51,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 04:47:51,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 04:47:51,279 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 04:47:51,279 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 04:47:51,280 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 04:47:51,280 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 04:47:51,280 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 04:47:51,280 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 04:47:51,281 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 04:47:51,281 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 04:47:51,281 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 04:47:51,281 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 04:47:51,282 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 04:47:51,282 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 04:47:51,282 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 04:47:51,282 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 04:47:51,282 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 04:47:51,282 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 04:47:51,283 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 04:47:51,283 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 04:47:51,283 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 04:47:51,283 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 04:47:51,283 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 04:47:51,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 04:47:51,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 04:47:51,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 04:47:51,284 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 04:47:51,284 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 04:47:51,285 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 04:47:51,285 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-25 04:47:51,285 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 04:47:51,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 04:47:51,285 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 04:47:51,286 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 04:47:51,286 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 04:47:51,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 04:47:51,334 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 04:47:51,338 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 04:47:51,340 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 04:47:51,340 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 04:47:51,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-01-25 04:47:51,565 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 04:47:51,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 04:47:51,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 04:47:51,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 04:47:51,577 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 04:47:51,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 04:47:51" (1/1) ... [2018-01-25 04:47:51,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d434187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:51, skipping insertion in model container [2018-01-25 04:47:51,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 04:47:51" (1/1) ... [2018-01-25 04:47:51,600 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 04:47:51,654 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 04:47:51,762 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 04:47:51,781 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 04:47:51,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:51 WrapperNode [2018-01-25 04:47:51,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 04:47:51,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 04:47:51,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 04:47:51,791 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 04:47:51,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:51" (1/1) ... [2018-01-25 04:47:51,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:51" (1/1) ... [2018-01-25 04:47:51,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:51" (1/1) ... [2018-01-25 04:47:51,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:51" (1/1) ... [2018-01-25 04:47:51,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:51" (1/1) ... [2018-01-25 04:47:51,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:51" (1/1) ... [2018-01-25 04:47:51,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:51" (1/1) ... [2018-01-25 04:47:51,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 04:47:51,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 04:47:51,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 04:47:51,828 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 04:47:51,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:51" (1/1) ... No working directory specified, using /storage/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-01-25 04:47:51,879 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 04:47:51,879 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 04:47:51,879 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 04:47:51,879 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-01-25 04:47:51,879 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-01-25 04:47:51,879 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-01-25 04:47:51,880 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_unsafe_19 [2018-01-25 04:47:51,880 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-01-25 04:47:51,880 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 04:47:51,880 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 04:47:51,880 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 04:47:51,880 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 04:47:51,880 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 04:47:51,880 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 04:47:51,880 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 04:47:51,880 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 04:47:51,881 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 04:47:51,881 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 04:47:51,881 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 04:47:51,881 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-01-25 04:47:51,881 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-01-25 04:47:51,881 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-01-25 04:47:51,881 INFO L128 BoogieDeclarations]: Found specification of procedure probe_unsafe_19 [2018-01-25 04:47:51,882 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-01-25 04:47:51,882 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 04:47:51,882 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 04:47:51,882 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 04:47:51,882 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 04:47:52,146 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 04:47:52,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 04:47:52 BoogieIcfgContainer [2018-01-25 04:47:52,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 04:47:52,147 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-25 04:47:52,147 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-25 04:47:52,147 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-25 04:47:52,148 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 04:47:52" (1/1) ... [2018-01-25 04:47:52,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 04:48:02,352 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 04:48:02,369 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-25 04:48:02,393 INFO L268 AbstractInterpreter]: Visited 96 different actions 205 times. Merged at 39 different actions 62 times. Never widened. Found 8 fixpoints after 6 different actions. Largest state had 28 variables. [2018-01-25 04:48:02,395 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-25 04:48:02,396 INFO L168 Benchmark]: Toolchain (without parser) took 10830.36 ms. Allocated memory was 304.1 MB in the beginning and 931.7 MB in the end (delta: 627.6 MB). Free memory was 263.1 MB in the beginning and 888.3 MB in the end (delta: -625.2 MB). Peak memory consumption was 2.4 MB. Max. memory is 5.3 GB. [2018-01-25 04:48:02,397 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 04:48:02,397 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.57 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 250.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-25 04:48:02,397 INFO L168 Benchmark]: Boogie Preprocessor took 36.41 ms. Allocated memory is still 304.1 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 04:48:02,397 INFO L168 Benchmark]: RCFGBuilder took 318.73 ms. Allocated memory is still 304.1 MB. Free memory was 248.0 MB in the beginning and 224.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. [2018-01-25 04:48:02,398 INFO L168 Benchmark]: Abstract Interpretation took 10248.53 ms. Allocated memory was 304.1 MB in the beginning and 931.7 MB in the end (delta: 627.6 MB). Free memory was 224.3 MB in the beginning and 888.3 MB in the end (delta: -664.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 04:48:02,399 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.57 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 250.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.41 ms. Allocated memory is still 304.1 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 318.73 ms. Allocated memory is still 304.1 MB. Free memory was 248.0 MB in the beginning and 224.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 10248.53 ms. Allocated memory was 304.1 MB in the beginning and 931.7 MB in the end (delta: 627.6 MB). Free memory was 224.3 MB in the beginning and 888.3 MB in the end (delta: -664.0 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 83 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 1022 LocStat_NO_SUPPORTING_DISEQUALITIES : 320 LocStat_NO_DISJUNCTIONS : -166 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 114 TransStat_MAX_WEQGRAPH_SIZE : 4 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 185 TransStat_NO_SUPPORTING_DISEQUALITIES : 37 TransStat_NO_DISJUNCTIONS : 132 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.347929 RENAME_VARIABLES(MILLISECONDS) : 0.005069 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.246163 PROJECTAWAY(MILLISECONDS) : 0.232940 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.140206 DISJOIN(MILLISECONDS) : 0.229084 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.012513 ADD_EQUALITY(MILLISECONDS) : 0.013310 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005996 #CONJOIN_DISJUNCTIVE : 347 #RENAME_VARIABLES : 806 #UNFREEZE : 0 #CONJOIN : 727 #PROJECTAWAY : 602 #ADD_WEAK_EQUALITY : 17 #DISJOIN : 118 #RENAME_VARIABLES_DISJUNCTIVE : 755 #ADD_EQUALITY : 164 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 30 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] FCALL a->q - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND FALSE !(!a->q) [L1460] CALL f19(a) [L1440] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1440] EXPR ldv_malloc(sizeof(int)) [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) - UnprovableResult [Line: 1491]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL, EXPR probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND TRUE !a->q [L1474] RET return ret; [L1484] EXPR probe_unsafe_19(&a19) [L1484] int ret = probe_unsafe_19(&a19); [L1486] COND FALSE, RET !(ret==0) [L1492] entry_point() - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND FALSE !(!a->q) [L1460] CALL f19(a) [L1440] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1440] EXPR ldv_malloc(sizeof(int)) [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) [L1441] FCALL a->p - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) [L1440] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1440] EXPR ldv_malloc(sizeof(int)) [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) [L1441] FCALL a->p [L1441] COND FALSE !(a->p) [L1443] RET return - -3; [L1460] EXPR f19(a) [L1460] ret = f19(a) [L1461] COND TRUE \read(ret) [L1472] FCALL a->q - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) [L1440] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1440] EXPR ldv_malloc(sizeof(int)) [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) [L1441] FCALL a->p [L1441] COND FALSE !(a->p) [L1443] RET return - -3; [L1460] EXPR f19(a) [L1460] ret = f19(a) [L1461] COND TRUE \read(ret) [L1472] EXPR, FCALL a->q [L1472] FCALL free(a->q) - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) [L1440] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1440] EXPR ldv_malloc(sizeof(int)) [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) [L1441] FCALL a->p [L1441] COND FALSE !(a->p) [L1443] RET return - -3; [L1460] EXPR f19(a) [L1460] ret = f19(a) [L1461] COND TRUE \read(ret) [L1472] EXPR, FCALL a->q [L1472] FCALL free(a->q) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) [L1440] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1440] EXPR ldv_malloc(sizeof(int)) [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) [L1441] FCALL a->p [L1441] COND TRUE a->p [L1442] RET return 0; [L1460] EXPR f19(a) [L1460] ret = f19(a) [L1461] COND FALSE !(\read(ret)) [L1464] CALL, EXPR g19() [L1451] RET return __VERIFIER_nondet_int(); [L1464] EXPR g19() [L1464] COND TRUE !g19() [L1470] CALL f19_undo(a) [L1447] FCALL a->p - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL, EXPR probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) [L1440] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1440] EXPR ldv_malloc(sizeof(int)) [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) [L1441] FCALL a->p [L1441] COND TRUE a->p [L1442] RET return 0; [L1460] EXPR f19(a) [L1460] ret = f19(a) [L1461] COND FALSE !(\read(ret)) [L1464] CALL, EXPR g19() [L1451] RET return __VERIFIER_nondet_int(); [L1464] EXPR g19() [L1464] COND FALSE !(!g19()) [L1468] RET return 0; [L1484] EXPR probe_unsafe_19(&a19) [L1484] int ret = probe_unsafe_19(&a19); [L1486] COND TRUE ret==0 [L1487] CALL disconnect_19(&a19) [L1478] FCALL a->q - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL, EXPR probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) [L1440] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1440] EXPR ldv_malloc(sizeof(int)) [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) [L1441] FCALL a->p [L1441] COND TRUE a->p [L1442] RET return 0; [L1460] EXPR f19(a) [L1460] ret = f19(a) [L1461] COND FALSE !(\read(ret)) [L1464] CALL, EXPR g19() [L1451] RET return __VERIFIER_nondet_int(); [L1464] EXPR g19() [L1464] COND FALSE !(!g19()) [L1468] RET return 0; [L1484] EXPR probe_unsafe_19(&a19) [L1484] int ret = probe_unsafe_19(&a19); [L1486] COND TRUE ret==0 [L1487] CALL disconnect_19(&a19) [L1478] EXPR, FCALL a->q [L1478] FCALL free(a->q) - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL, EXPR probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) [L1440] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1440] EXPR ldv_malloc(sizeof(int)) [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) [L1441] FCALL a->p [L1441] COND TRUE a->p [L1442] RET return 0; [L1460] EXPR f19(a) [L1460] ret = f19(a) [L1461] COND FALSE !(\read(ret)) [L1464] CALL, EXPR g19() [L1451] RET return __VERIFIER_nondet_int(); [L1464] EXPR g19() [L1464] COND FALSE !(!g19()) [L1468] RET return 0; [L1484] EXPR probe_unsafe_19(&a19) [L1484] int ret = probe_unsafe_19(&a19); [L1486] COND TRUE ret==0 [L1487] CALL disconnect_19(&a19) [L1478] EXPR, FCALL a->q [L1478] FCALL free(a->q) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL, EXPR probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) [L1440] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1440] EXPR ldv_malloc(sizeof(int)) [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) [L1441] FCALL a->p [L1441] COND TRUE a->p [L1442] RET return 0; [L1460] EXPR f19(a) [L1460] ret = f19(a) [L1461] COND FALSE !(\read(ret)) [L1464] CALL, EXPR g19() [L1451] RET return __VERIFIER_nondet_int(); [L1464] EXPR g19() [L1464] COND FALSE !(!g19()) [L1468] RET return 0; [L1484] EXPR probe_unsafe_19(&a19) [L1484] int ret = probe_unsafe_19(&a19); [L1486] COND TRUE ret==0 [L1487] CALL disconnect_19(&a19) [L1478] EXPR, FCALL a->q [L1478] FCALL free(a->q) [L1479] CALL f19_undo(a) [L1447] FCALL a->p - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL, EXPR probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) [L1440] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1440] EXPR ldv_malloc(sizeof(int)) [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) [L1441] FCALL a->p [L1441] COND TRUE a->p [L1442] RET return 0; [L1460] EXPR f19(a) [L1460] ret = f19(a) [L1461] COND FALSE !(\read(ret)) [L1464] CALL, EXPR g19() [L1451] RET return __VERIFIER_nondet_int(); [L1464] EXPR g19() [L1464] COND FALSE !(!g19()) [L1468] RET return 0; [L1484] EXPR probe_unsafe_19(&a19) [L1484] int ret = probe_unsafe_19(&a19); [L1486] COND TRUE ret==0 [L1487] CALL disconnect_19(&a19) [L1478] EXPR, FCALL a->q [L1478] FCALL free(a->q) [L1479] CALL f19_undo(a) [L1447] EXPR, FCALL a->p [L1447] FCALL free(a->p) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL, EXPR probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) [L1440] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1440] EXPR ldv_malloc(sizeof(int)) [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) [L1441] FCALL a->p [L1441] COND TRUE a->p [L1442] RET return 0; [L1460] EXPR f19(a) [L1460] ret = f19(a) [L1461] COND FALSE !(\read(ret)) [L1464] CALL, EXPR g19() [L1451] RET return __VERIFIER_nondet_int(); [L1464] EXPR g19() [L1464] COND TRUE !g19() [L1470] CALL f19_undo(a) [L1447] EXPR, FCALL a->p [L1447] RET, FCALL free(a->p) [L1470] f19_undo(a) [L1472] EXPR, FCALL a->q [L1472] FCALL free(a->q) [L1474] RET return ret; [L1484] EXPR probe_unsafe_19(&a19) [L1484] int ret = probe_unsafe_19(&a19); [L1486] COND TRUE ret==0 [L1487] CALL disconnect_19(&a19) [L1478] FCALL a->q - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; [L1484] CALL, EXPR probe_unsafe_19(&a19) [L1455] int ret = - -3; [L1457] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(int)) [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) [L1458] EXPR, FCALL a->q [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) [L1440] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1440] EXPR ldv_malloc(sizeof(int)) [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) [L1441] FCALL a->p [L1441] COND TRUE a->p [L1442] RET return 0; [L1460] EXPR f19(a) [L1460] ret = f19(a) [L1461] COND FALSE !(\read(ret)) [L1464] CALL, EXPR g19() [L1451] RET return __VERIFIER_nondet_int(); [L1464] EXPR g19() [L1464] COND TRUE !g19() [L1470] CALL f19_undo(a) [L1447] EXPR, FCALL a->p [L1447] RET, FCALL free(a->p) [L1470] f19_undo(a) [L1472] EXPR, FCALL a->q [L1472] FCALL free(a->q) [L1474] RET return ret; [L1484] EXPR probe_unsafe_19(&a19) [L1484] int ret = probe_unsafe_19(&a19); [L1486] COND TRUE ret==0 [L1487] CALL disconnect_19(&a19) [L1478] EXPR, FCALL a->q [L1478] FCALL free(a->q) [L1479] CALL f19_undo(a) [L1447] EXPR, FCALL a->p [L1447] FCALL free(a->p) - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_smtcomp.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-25_04-48-02-408.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_smtcomp.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-25_04-48-02-408.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_smtcomp.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_04-48-02-408.csv Received shutdown request...