./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0158-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/test-0158-3.i -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 56731b349541148adf5e7b09b4f62a37ef34decefedcd97d69429e6620dcb1d4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:36:49,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:36:49,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:36:49,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:36:49,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:36:49,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:36:49,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:36:49,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:36:49,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:36:49,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:36:49,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:36:49,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:36:49,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:36:49,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:36:49,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:36:49,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:36:49,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:36:49,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:36:49,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:36:49,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:36:49,217 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:36:49,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:36:49,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:36:49,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:36:49,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:36:49,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:36:49,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:36:49,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:36:49,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:36:49,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:36:49,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:36:49,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:36:49,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:36:49,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:36:49,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:36:49,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:36:49,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:36:49,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:36:49,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:36:49,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:36:49,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:36:49,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:36:49,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:36:49,276 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:36:49,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:36:49,276 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:36:49,277 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:36:49,277 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:36:49,277 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:36:49,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:36:49,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:36:49,278 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:36:49,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:36:49,278 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:36:49,278 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:36:49,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:36:49,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:36:49,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:36:49,279 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:36:49,279 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:36:49,279 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:36:49,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:36:49,279 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:36:49,280 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:36:49,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:36:49,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:36:49,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:36:49,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:36:49,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:36:49,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:36:49,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:36:49,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:36:49,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:36:49,281 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 -> 56731b349541148adf5e7b09b4f62a37ef34decefedcd97d69429e6620dcb1d4 [2022-07-20 05:36:49,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:36:49,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:36:49,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:36:49,527 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:36:49,530 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:36:49,531 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0158-3.i [2022-07-20 05:36:49,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601d97557/bb3e78269f8b477fbeffccbafdd915b7/FLAG1ea6b9641 [2022-07-20 05:36:50,017 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:36:50,018 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0158-3.i [2022-07-20 05:36:50,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601d97557/bb3e78269f8b477fbeffccbafdd915b7/FLAG1ea6b9641 [2022-07-20 05:36:50,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601d97557/bb3e78269f8b477fbeffccbafdd915b7 [2022-07-20 05:36:50,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:36:50,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:36:50,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:36:50,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:36:50,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:36:50,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:36:50" (1/1) ... [2022-07-20 05:36:50,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d297f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:50, skipping insertion in model container [2022-07-20 05:36:50,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:36:50" (1/1) ... [2022-07-20 05:36:50,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:36:50,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:36:50,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:36:50,636 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:36:50,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:36:50,727 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:36:50,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:50 WrapperNode [2022-07-20 05:36:50,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:36:50,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:36:50,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:36:50,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:36:50,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:50" (1/1) ... [2022-07-20 05:36:50,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:50" (1/1) ... [2022-07-20 05:36:50,787 INFO L137 Inliner]: procedures = 174, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2022-07-20 05:36:50,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:36:50,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:36:50,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:36:50,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:36:50,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:50" (1/1) ... [2022-07-20 05:36:50,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:50" (1/1) ... [2022-07-20 05:36:50,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:50" (1/1) ... [2022-07-20 05:36:50,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:50" (1/1) ... [2022-07-20 05:36:50,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:50" (1/1) ... [2022-07-20 05:36:50,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:50" (1/1) ... [2022-07-20 05:36:50,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:50" (1/1) ... [2022-07-20 05:36:50,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:36:50,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:36:50,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:36:50,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:36:50,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:50" (1/1) ... [2022-07-20 05:36:50,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:36:50,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:36:50,854 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-07-20 05:36:50,859 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-07-20 05:36:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:36:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:36:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:36:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:36:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 05:36:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:36:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:36:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 05:36:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:36:50,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:36:51,022 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:36:51,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:36:51,187 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:36:51,191 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:36:51,192 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 05:36:51,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:51 BoogieIcfgContainer [2022-07-20 05:36:51,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:36:51,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:36:51,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:36:51,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:36:51,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:36:50" (1/3) ... [2022-07-20 05:36:51,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f6871a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:36:51, skipping insertion in model container [2022-07-20 05:36:51,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:50" (2/3) ... [2022-07-20 05:36:51,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f6871a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:36:51, skipping insertion in model container [2022-07-20 05:36:51,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:51" (3/3) ... [2022-07-20 05:36:51,201 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0158-3.i [2022-07-20 05:36:51,214 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:36:51,214 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-07-20 05:36:51,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:36:51,277 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@54d0ec70, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7677bd64 [2022-07-20 05:36:51,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-07-20 05:36:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 17 states have (on average 2.0) internal successors, (34), 34 states have internal predecessors, (34), 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-07-20 05:36:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:36:51,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:51,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:36:51,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-20 05:36:51,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:51,304 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 05:36:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:51,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242006813] [2022-07-20 05:36:51,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:51,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:51,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:51,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242006813] [2022-07-20 05:36:51,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242006813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:51,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:51,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:36:51,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524262413] [2022-07-20 05:36:51,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:51,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:36:51,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:51,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:36:51,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:36:51,568 INFO L87 Difference]: Start difference. First operand has 35 states, 17 states have (on average 2.0) internal successors, (34), 34 states have internal predecessors, (34), 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-07-20 05:36:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:51,628 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2022-07-20 05:36:51,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:36:51,632 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-07-20 05:36:51,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:51,639 INFO L225 Difference]: With dead ends: 30 [2022-07-20 05:36:51,639 INFO L226 Difference]: Without dead ends: 28 [2022-07-20 05:36:51,641 INFO L412 NwaCegarLoop]: 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-07-20 05:36:51,645 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:51,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 22 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-20 05:36:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-20 05:36:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.6875) internal successors, (27), 27 states have internal predecessors, (27), 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-07-20 05:36:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2022-07-20 05:36:51,677 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 3 [2022-07-20 05:36:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:51,677 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2022-07-20 05:36:51,677 INFO L496 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-07-20 05:36:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2022-07-20 05:36:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:36:51,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:51,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:36:51,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:36:51,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-20 05:36:51,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:51,681 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 05:36:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:51,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6114536] [2022-07-20 05:36:51,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:51,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:51,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:51,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6114536] [2022-07-20 05:36:51,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6114536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:51,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:51,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:36:51,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091219580] [2022-07-20 05:36:51,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:51,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:36:51,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:51,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:36:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:36:51,754 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. 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-07-20 05:36:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:51,771 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2022-07-20 05:36:51,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:36:51,772 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-07-20 05:36:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:51,772 INFO L225 Difference]: With dead ends: 23 [2022-07-20 05:36:51,773 INFO L226 Difference]: Without dead ends: 23 [2022-07-20 05:36:51,773 INFO L412 NwaCegarLoop]: 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-07-20 05:36:51,774 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:51,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 17 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:51,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-20 05:36:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-20 05:36:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 22 states have internal predecessors, (22), 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-07-20 05:36:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2022-07-20 05:36:51,778 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 3 [2022-07-20 05:36:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:51,778 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2022-07-20 05:36:51,778 INFO L496 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-07-20 05:36:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2022-07-20 05:36:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:36:51,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:51,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:51,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:36:51,782 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-20 05:36:51,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1056666061, now seen corresponding path program 1 times [2022-07-20 05:36:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:51,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961820839] [2022-07-20 05:36:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:51,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:51,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961820839] [2022-07-20 05:36:51,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961820839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:51,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:51,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:36:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734231255] [2022-07-20 05:36:51,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:51,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:36:51,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:51,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:36:51,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:36:51,902 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-07-20 05:36:51,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:51,944 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-07-20 05:36:51,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:36:51,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-07-20 05:36:51,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:51,945 INFO L225 Difference]: With dead ends: 22 [2022-07-20 05:36:51,945 INFO L226 Difference]: Without dead ends: 22 [2022-07-20 05:36:51,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:36:51,947 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:51,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 37 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-20 05:36:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-20 05:36:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 21 states have internal predecessors, (21), 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-07-20 05:36:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2022-07-20 05:36:51,951 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 10 [2022-07-20 05:36:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:51,951 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2022-07-20 05:36:51,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-07-20 05:36:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-07-20 05:36:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:36:51,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:51,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:51,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:36:51,953 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-20 05:36:51,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:51,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1603090424, now seen corresponding path program 1 times [2022-07-20 05:36:51,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:51,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075901161] [2022-07-20 05:36:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:51,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:52,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:52,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075901161] [2022-07-20 05:36:52,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075901161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:52,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:52,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:36:52,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947734603] [2022-07-20 05:36:52,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:52,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:36:52,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:52,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:36:52,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:36:52,055 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-07-20 05:36:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:52,118 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-07-20 05:36:52,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:36:52,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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) Word has length 11 [2022-07-20 05:36:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:52,119 INFO L225 Difference]: With dead ends: 21 [2022-07-20 05:36:52,119 INFO L226 Difference]: Without dead ends: 21 [2022-07-20 05:36:52,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:36:52,120 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:52,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-20 05:36:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-20 05:36:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 20 states have internal predecessors, (20), 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-07-20 05:36:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2022-07-20 05:36:52,126 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 11 [2022-07-20 05:36:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:52,126 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2022-07-20 05:36:52,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-07-20 05:36:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2022-07-20 05:36:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:36:52,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:52,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:52,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:36:52,127 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-20 05:36:52,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:52,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1843804463, now seen corresponding path program 1 times [2022-07-20 05:36:52,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:52,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333562586] [2022-07-20 05:36:52,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:52,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:52,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:52,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333562586] [2022-07-20 05:36:52,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333562586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:52,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:52,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:36:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060818231] [2022-07-20 05:36:52,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:52,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:36:52,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:52,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:36:52,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:36:52,214 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-07-20 05:36:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:52,250 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2022-07-20 05:36:52,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:36:52,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) Word has length 12 [2022-07-20 05:36:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:52,251 INFO L225 Difference]: With dead ends: 20 [2022-07-20 05:36:52,251 INFO L226 Difference]: Without dead ends: 20 [2022-07-20 05:36:52,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:36:52,252 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:52,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-20 05:36:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-20 05:36:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 19 states have internal predecessors, (19), 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-07-20 05:36:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2022-07-20 05:36:52,256 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 12 [2022-07-20 05:36:52,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:52,256 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2022-07-20 05:36:52,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-07-20 05:36:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2022-07-20 05:36:52,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:36:52,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:52,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:52,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:36:52,258 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-20 05:36:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:52,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1323363562, now seen corresponding path program 1 times [2022-07-20 05:36:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:52,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447781714] [2022-07-20 05:36:52,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:52,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:52,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:52,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447781714] [2022-07-20 05:36:52,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447781714] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:52,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:52,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:36:52,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91455802] [2022-07-20 05:36:52,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:52,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:36:52,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:52,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:36:52,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:36:52,327 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-07-20 05:36:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:52,371 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-07-20 05:36:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:36:52,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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) Word has length 13 [2022-07-20 05:36:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:52,372 INFO L225 Difference]: With dead ends: 19 [2022-07-20 05:36:52,372 INFO L226 Difference]: Without dead ends: 19 [2022-07-20 05:36:52,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:36:52,373 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:52,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 31 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-20 05:36:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-20 05:36:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 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-07-20 05:36:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2022-07-20 05:36:52,376 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 13 [2022-07-20 05:36:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:52,377 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2022-07-20 05:36:52,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-07-20 05:36:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2022-07-20 05:36:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:36:52,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:52,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:52,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:36:52,378 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-20 05:36:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:52,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1925402479, now seen corresponding path program 1 times [2022-07-20 05:36:52,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:52,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074205958] [2022-07-20 05:36:52,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:52,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:52,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:52,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074205958] [2022-07-20 05:36:52,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074205958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:52,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:52,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:36:52,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69113303] [2022-07-20 05:36:52,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:52,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:36:52,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:52,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:36:52,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:36:52,446 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-07-20 05:36:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:52,518 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-07-20 05:36:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:36:52,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2022-07-20 05:36:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:52,521 INFO L225 Difference]: With dead ends: 18 [2022-07-20 05:36:52,521 INFO L226 Difference]: Without dead ends: 18 [2022-07-20 05:36:52,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:36:52,524 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:52,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-20 05:36:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-20 05:36:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 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-07-20 05:36:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2022-07-20 05:36:52,527 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 14 [2022-07-20 05:36:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:52,528 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2022-07-20 05:36:52,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-07-20 05:36:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-07-20 05:36:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:36:52,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:52,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:52,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:36:52,529 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-20 05:36:52,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash 442065356, now seen corresponding path program 1 times [2022-07-20 05:36:52,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:52,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625563920] [2022-07-20 05:36:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:52,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:36:52,567 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 05:36:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:36:52,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 05:36:52,621 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 05:36:52,622 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (16 of 17 remaining) [2022-07-20 05:36:52,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2022-07-20 05:36:52,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2022-07-20 05:36:52,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2022-07-20 05:36:52,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2022-07-20 05:36:52,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2022-07-20 05:36:52,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2022-07-20 05:36:52,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2022-07-20 05:36:52,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2022-07-20 05:36:52,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2022-07-20 05:36:52,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2022-07-20 05:36:52,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (5 of 17 remaining) [2022-07-20 05:36:52,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (4 of 17 remaining) [2022-07-20 05:36:52,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (3 of 17 remaining) [2022-07-20 05:36:52,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (2 of 17 remaining) [2022-07-20 05:36:52,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (1 of 17 remaining) [2022-07-20 05:36:52,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2022-07-20 05:36:52,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:36:52,630 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:52,637 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 05:36:52,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:36:52 BoogieIcfgContainer [2022-07-20 05:36:52,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 05:36:52,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 05:36:52,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 05:36:52,664 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 05:36:52,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:51" (3/4) ... [2022-07-20 05:36:52,668 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-20 05:36:52,695 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 05:36:52,696 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 05:36:52,696 INFO L158 Benchmark]: Toolchain (without parser) took 2344.32ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 68.6MB in the beginning and 61.0MB in the end (delta: 7.6MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2022-07-20 05:36:52,696 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 75.5MB. Free memory was 44.6MB in the beginning and 44.6MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:52,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.00ms. Allocated memory is still 92.3MB. Free memory was 68.4MB in the beginning and 49.7MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-20 05:36:52,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.25ms. Allocated memory is still 92.3MB. Free memory was 49.6MB in the beginning and 47.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:36:52,697 INFO L158 Benchmark]: Boogie Preprocessor took 24.98ms. Allocated memory is still 92.3MB. Free memory was 47.7MB in the beginning and 46.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:36:52,698 INFO L158 Benchmark]: RCFGBuilder took 379.15ms. Allocated memory is still 92.3MB. Free memory was 46.4MB in the beginning and 68.0MB in the end (delta: -21.5MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-07-20 05:36:52,698 INFO L158 Benchmark]: TraceAbstraction took 1468.57ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 67.5MB in the beginning and 63.1MB in the end (delta: 4.4MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2022-07-20 05:36:52,698 INFO L158 Benchmark]: Witness Printer took 32.05ms. Allocated memory is still 111.1MB. Free memory was 63.1MB in the beginning and 61.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:52,700 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 75.5MB. Free memory was 44.6MB in the beginning and 44.6MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.00ms. Allocated memory is still 92.3MB. Free memory was 68.4MB in the beginning and 49.7MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.25ms. Allocated memory is still 92.3MB. Free memory was 49.6MB in the beginning and 47.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.98ms. Allocated memory is still 92.3MB. Free memory was 47.7MB in the beginning and 46.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 379.15ms. Allocated memory is still 92.3MB. Free memory was 46.4MB in the beginning and 68.0MB in the end (delta: -21.5MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1468.57ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 67.5MB in the beginning and 63.1MB in the end (delta: 4.4MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Witness Printer took 32.05ms. Allocated memory is still 111.1MB. Free memory was 63.1MB in the beginning and 61.0MB in the end (delta: 2.1MB). There was no memory consumed. 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: 655]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L642-L649] union { void *p0; struct { char c[2]; void *p1; void *p2; } str; } data; [L650] data.p0 = malloc(37U) VAL [data={8:0}, malloc(37U)={5:0}] [L651] data.str.p2 = &data VAL [data={8:0}] [L652] EXPR data.p0 VAL [data={8:0}, data.p0={5:0}] [L652] void *ptr = data.p0; [L653] data.str.c[1] = sizeof data.str.p1 VAL [data={8:0}, ptr={5:0}] [L654] EXPR data.p0 VAL [data={8:0}, data.p0={5:0}, ptr={5:0}] [L654] free(data.p0) VAL [data={8:0}, data.p0={5:0}, ptr={5:0}] [L654] free(data.p0) VAL [data={8:0}, data.p0={5:0}, ptr={5:0}] [L654] free(data.p0) [L655] free(ptr) VAL [data={8:0}, ptr={5:0}] [L655] free(ptr) VAL [data={8:0}, ptr={5:0}] [L655] free(ptr) VAL [data={8:0}, ptr={5:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 654]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 654]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 654]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 640]: 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, 35 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 85 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-07-20 05:36:52,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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-free)