./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_1.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 --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 bd16a09b8249550fe27ec1d3745982255d6ee9946403f6860cbcc4680185e804 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:04:12,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:04:13,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 18:04:13,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:04:13,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:04:13,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:04:13,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:04:13,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:04:13,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:04:13,085 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:04:13,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:04:13,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:04:13,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:04:13,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:04:13,088 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:04:13,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:04:13,089 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:04:13,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:04:13,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:04:13,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:04:13,090 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:04:13,090 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:04:13,093 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:04:13,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:04:13,093 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:04:13,094 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:04:13,094 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:04:13,094 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:04:13,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:04:13,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:04:13,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:04:13,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:04:13,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:04:13,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:04:13,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:04:13,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:04:13,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:04:13,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:04:13,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:04:13,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:04:13,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:04:13,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:04:13,097 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> bd16a09b8249550fe27ec1d3745982255d6ee9946403f6860cbcc4680185e804 [2024-10-14 18:04:13,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:04:13,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:04:13,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:04:13,336 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:04:13,336 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:04:13,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_1.i [2024-10-14 18:04:14,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:04:14,785 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:04:14,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_1.i [2024-10-14 18:04:14,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940f11875/2f423b53da634c879a9e820a50bb6701/FLAG1bc8b880b [2024-10-14 18:04:15,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940f11875/2f423b53da634c879a9e820a50bb6701 [2024-10-14 18:04:15,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:04:15,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:04:15,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:04:15,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:04:15,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:04:15,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:04:15" (1/1) ... [2024-10-14 18:04:15,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@663b26e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:15, skipping insertion in model container [2024-10-14 18:04:15,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:04:15" (1/1) ... [2024-10-14 18:04:15,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:04:15,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:04:15,602 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 18:04:15,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7c9452c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:15, skipping insertion in model container [2024-10-14 18:04:15,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:04:15,603 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 18:04:15,605 INFO L158 Benchmark]: Toolchain (without parser) took 470.40ms. Allocated memory is still 192.9MB. Free memory was 126.6MB in the beginning and 157.9MB in the end (delta: -31.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 18:04:15,605 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 18:04:15,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.75ms. Allocated memory is still 192.9MB. Free memory was 126.1MB in the beginning and 157.9MB in the end (delta: -31.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 18:04:15,607 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.75ms. Allocated memory is still 192.9MB. Free memory was 126.1MB in the beginning and 157.9MB in the end (delta: -31.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 bd16a09b8249550fe27ec1d3745982255d6ee9946403f6860cbcc4680185e804 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:04:17,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:04:17,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 18:04:17,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:04:17,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:04:17,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:04:17,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:04:17,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:04:17,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:04:17,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:04:17,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:04:17,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:04:17,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:04:17,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:04:17,701 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:04:17,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:04:17,703 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:04:17,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:04:17,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:04:17,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:04:17,707 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:04:17,708 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:04:17,708 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:04:17,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:04:17,708 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:04:17,708 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 18:04:17,708 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:04:17,709 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 18:04:17,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:04:17,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:04:17,709 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:04:17,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:04:17,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:04:17,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:04:17,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:04:17,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:04:17,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:04:17,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:04:17,719 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 18:04:17,720 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 18:04:17,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:04:17,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:04:17,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:04:17,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:04:17,721 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 18:04:17,721 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> bd16a09b8249550fe27ec1d3745982255d6ee9946403f6860cbcc4680185e804 [2024-10-14 18:04:18,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:04:18,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:04:18,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:04:18,030 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:04:18,031 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:04:18,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_1.i [2024-10-14 18:04:19,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:04:19,775 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:04:19,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_1.i [2024-10-14 18:04:19,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69655ffb/ab56810359be4844af72ebe20537dbc7/FLAG24ccf9bb4 [2024-10-14 18:04:20,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69655ffb/ab56810359be4844af72ebe20537dbc7 [2024-10-14 18:04:20,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:04:20,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:04:20,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:04:20,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:04:20,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:04:20,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da7d59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20, skipping insertion in model container [2024-10-14 18:04:20,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:04:20,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:04:20,570 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 18:04:20,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:04:20,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:04:20,648 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:04:20,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:04:20,756 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:04:20,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20 WrapperNode [2024-10-14 18:04:20,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:04:20,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:04:20,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:04:20,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:04:20,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,814 INFO L138 Inliner]: procedures = 169, calls = 79, calls flagged for inlining = 25, calls inlined = 7, statements flattened = 65 [2024-10-14 18:04:20,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:04:20,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:04:20,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:04:20,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:04:20,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,848 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 4, 0]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 2 writes are split as follows [0, 2, 0]. [2024-10-14 18:04:20,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:04:20,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:04:20,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:04:20,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:04:20,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20" (1/1) ... [2024-10-14 18:04:20,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:04:20,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:04:20,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 18:04:20,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 18:04:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-14 18:04:20,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-14 18:04:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:04:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 18:04:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:04:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 18:04:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 18:04:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:04:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 18:04:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 18:04:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:04:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 18:04:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 18:04:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 18:04:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:04:20,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:04:21,087 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:04:21,090 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:04:21,270 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-10-14 18:04:21,270 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:04:21,312 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:04:21,312 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 18:04:21,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:04:21 BoogieIcfgContainer [2024-10-14 18:04:21,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:04:21,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:04:21,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:04:21,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:04:21,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:04:20" (1/3) ... [2024-10-14 18:04:21,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39182729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:04:21, skipping insertion in model container [2024-10-14 18:04:21,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:20" (2/3) ... [2024-10-14 18:04:21,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39182729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:04:21, skipping insertion in model container [2024-10-14 18:04:21,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:04:21" (3/3) ... [2024-10-14 18:04:21,320 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1.i [2024-10-14 18:04:21,333 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:04:21,333 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-10-14 18:04:21,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:04:21,387 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72665c50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:04:21,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-14 18:04:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.9) internal successors, (38), 33 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:21,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 18:04:21,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:21,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:21,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 18:04:21,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:21,412 INFO L85 PathProgramCache]: Analyzing trace with hash -154140781, now seen corresponding path program 1 times [2024-10-14 18:04:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:21,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204357505] [2024-10-14 18:04:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:21,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:21,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:21,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:21,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 18:04:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:21,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:04:21,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:04:21,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:21,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:21,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204357505] [2024-10-14 18:04:21,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204357505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:21,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:04:21,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586766075] [2024-10-14 18:04:21,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:21,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:04:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:21,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:04:21,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:04:21,615 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.9) internal successors, (38), 33 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:21,682 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-10-14 18:04:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:04:21,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-14 18:04:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:21,689 INFO L225 Difference]: With dead ends: 36 [2024-10-14 18:04:21,689 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 18:04:21,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:04:21,694 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:21,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 107 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:04:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 18:04:21,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-10-14 18:04:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.8) internal successors, (36), 31 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-10-14 18:04:21,719 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 10 [2024-10-14 18:04:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:21,719 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-10-14 18:04:21,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-10-14 18:04:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:04:21,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:21,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:21,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 18:04:21,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:21,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 18:04:21,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash -483396847, now seen corresponding path program 1 times [2024-10-14 18:04:21,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:21,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462856334] [2024-10-14 18:04:21,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:21,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:21,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:21,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:21,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 18:04:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:21,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 18:04:21,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:04:22,053 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:22,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:22,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462856334] [2024-10-14 18:04:22,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462856334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:22,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:22,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:04:22,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907713218] [2024-10-14 18:04:22,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:22,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:04:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:22,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:04:22,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:04:22,056 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:22,147 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2024-10-14 18:04:22,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:04:22,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 18:04:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:22,150 INFO L225 Difference]: With dead ends: 47 [2024-10-14 18:04:22,150 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 18:04:22,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:04:22,153 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:22,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 88 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:04:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 18:04:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2024-10-14 18:04:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 37 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:04:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-10-14 18:04:22,163 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2024-10-14 18:04:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:22,163 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-10-14 18:04:22,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-10-14 18:04:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:04:22,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:22,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:22,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 18:04:22,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:22,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 18:04:22,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:22,368 INFO L85 PathProgramCache]: Analyzing trace with hash -483345175, now seen corresponding path program 1 times [2024-10-14 18:04:22,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:22,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594256561] [2024-10-14 18:04:22,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:22,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:22,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:22,370 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:22,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 18:04:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:22,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 18:04:22,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:22,555 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-14 18:04:22,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:04:22,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:04:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:04:22,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:22,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:22,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594256561] [2024-10-14 18:04:22,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594256561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:22,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:22,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:04:22,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435921439] [2024-10-14 18:04:22,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:22,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:04:22,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:22,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:04:22,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-10-14 18:04:22,676 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:22,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:22,759 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-10-14 18:04:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:04:22,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 18:04:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:22,760 INFO L225 Difference]: With dead ends: 46 [2024-10-14 18:04:22,760 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 18:04:22,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-10-14 18:04:22,761 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:22,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 75 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 56 Unchecked, 0.1s Time] [2024-10-14 18:04:22,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 18:04:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-10-14 18:04:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 38 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:04:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-10-14 18:04:22,765 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 11 [2024-10-14 18:04:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:22,765 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-10-14 18:04:22,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-10-14 18:04:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:04:22,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:22,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:22,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 18:04:22,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:22,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 18:04:22,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:22,968 INFO L85 PathProgramCache]: Analyzing trace with hash -483345176, now seen corresponding path program 1 times [2024-10-14 18:04:22,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:22,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694613632] [2024-10-14 18:04:22,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:22,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:22,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:22,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:22,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 18:04:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:23,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 18:04:23,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:23,050 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-10-14 18:04:23,090 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-14 18:04:23,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-14 18:04:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:04:23,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:23,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:23,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694613632] [2024-10-14 18:04:23,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694613632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:23,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:23,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:04:23,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921066711] [2024-10-14 18:04:23,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:23,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:04:23,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:23,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:04:23,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-14 18:04:23,136 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:23,184 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-10-14 18:04:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:04:23,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 18:04:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:23,186 INFO L225 Difference]: With dead ends: 42 [2024-10-14 18:04:23,186 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 18:04:23,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-14 18:04:23,187 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:23,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 55 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 41 Unchecked, 0.0s Time] [2024-10-14 18:04:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 18:04:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-10-14 18:04:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 35 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:04:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-10-14 18:04:23,196 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 11 [2024-10-14 18:04:23,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:23,196 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-10-14 18:04:23,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-10-14 18:04:23,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:04:23,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:23,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:23,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 18:04:23,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:23,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 18:04:23,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:23,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1259413488, now seen corresponding path program 1 times [2024-10-14 18:04:23,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:23,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998222668] [2024-10-14 18:04:23,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:23,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:23,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:23,403 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:23,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 18:04:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:23,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 18:04:23,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:04:23,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:23,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:23,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998222668] [2024-10-14 18:04:23,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998222668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:23,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:23,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:04:23,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879426855] [2024-10-14 18:04:23,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:23,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:04:23,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:23,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:04:23,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:04:23,477 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:23,515 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-10-14 18:04:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:04:23,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 18:04:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:23,516 INFO L225 Difference]: With dead ends: 35 [2024-10-14 18:04:23,516 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 18:04:23,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:04:23,517 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:23,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:04:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 18:04:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-14 18:04:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:04:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-10-14 18:04:23,521 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 11 [2024-10-14 18:04:23,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:23,521 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-10-14 18:04:23,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:23,521 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-10-14 18:04:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:04:23,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:23,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:23,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 18:04:23,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:23,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 18:04:23,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1257588294, now seen corresponding path program 1 times [2024-10-14 18:04:23,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:23,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446644396] [2024-10-14 18:04:23,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:23,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:23,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:23,728 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:23,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 18:04:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:23,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 18:04:23,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:04:23,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:23,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:23,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446644396] [2024-10-14 18:04:23,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446644396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:23,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:23,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:04:23,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135754007] [2024-10-14 18:04:23,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:23,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:04:23,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:23,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:04:23,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:04:23,840 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:23,907 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2024-10-14 18:04:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:04:23,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 18:04:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:23,909 INFO L225 Difference]: With dead ends: 50 [2024-10-14 18:04:23,909 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 18:04:23,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:04:23,910 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:23,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 43 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:04:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 18:04:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2024-10-14 18:04:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 34 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:04:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-14 18:04:23,917 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 11 [2024-10-14 18:04:23,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:23,917 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-14 18:04:23,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-10-14 18:04:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:04:23,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:23,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:23,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 18:04:24,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:24,121 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 18:04:24,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:24,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1257588295, now seen corresponding path program 1 times [2024-10-14 18:04:24,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:24,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472077634] [2024-10-14 18:04:24,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:24,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:24,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:24,125 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:24,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 18:04:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:24,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 18:04:24,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:04:24,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:24,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:24,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472077634] [2024-10-14 18:04:24,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472077634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:24,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:24,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:04:24,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929504655] [2024-10-14 18:04:24,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:24,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:04:24,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:24,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:04:24,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:04:24,247 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:24,308 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2024-10-14 18:04:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:04:24,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 18:04:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:24,309 INFO L225 Difference]: With dead ends: 54 [2024-10-14 18:04:24,309 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 18:04:24,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:04:24,310 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:24,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 65 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:04:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 18:04:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2024-10-14 18:04:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 42 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:04:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2024-10-14 18:04:24,313 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 11 [2024-10-14 18:04:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:24,314 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2024-10-14 18:04:24,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2024-10-14 18:04:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:04:24,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:24,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:24,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 18:04:24,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:24,517 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 18:04:24,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1257587878, now seen corresponding path program 1 times [2024-10-14 18:04:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:24,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110105220] [2024-10-14 18:04:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:24,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:24,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:24,523 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:24,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 18:04:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:24,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:04:24,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:04:24,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:24,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:24,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110105220] [2024-10-14 18:04:24,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110105220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:24,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:24,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:04:24,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512808500] [2024-10-14 18:04:24,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:24,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:04:24,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:24,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:04:24,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:04:24,594 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:24,633 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-10-14 18:04:24,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:04:24,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 18:04:24,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:24,634 INFO L225 Difference]: With dead ends: 41 [2024-10-14 18:04:24,635 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 18:04:24,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:04:24,636 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:24,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:04:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 18:04:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 18:04:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 37 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:04:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-10-14 18:04:24,652 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2024-10-14 18:04:24,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:24,652 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-10-14 18:04:24,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:24,652 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-10-14 18:04:24,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 18:04:24,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:24,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:24,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 18:04:24,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:24,855 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 18:04:24,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2100400299, now seen corresponding path program 1 times [2024-10-14 18:04:24,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:24,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403723988] [2024-10-14 18:04:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:24,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:24,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:24,859 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:24,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 18:04:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:24,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 18:04:24,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:24,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 18:04:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:04:24,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:24,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:24,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403723988] [2024-10-14 18:04:24,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403723988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:24,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:24,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:04:24,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330895498] [2024-10-14 18:04:24,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:24,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:04:24,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:24,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:04:24,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:04:24,921 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:24,975 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-10-14 18:04:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:04:24,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-14 18:04:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:24,976 INFO L225 Difference]: With dead ends: 41 [2024-10-14 18:04:24,976 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 18:04:24,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:04:24,977 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:24,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 74 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:04:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 18:04:24,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-10-14 18:04:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 36 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:04:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-10-14 18:04:24,982 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 12 [2024-10-14 18:04:24,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:24,982 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-10-14 18:04:24,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-10-14 18:04:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 18:04:24,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:24,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:24,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 18:04:25,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:25,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 18:04:25,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash 330531981, now seen corresponding path program 1 times [2024-10-14 18:04:25,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:25,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088804609] [2024-10-14 18:04:25,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:25,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:25,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:25,188 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:25,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 18:04:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:25,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:04:25,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:04:25,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:25,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:25,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088804609] [2024-10-14 18:04:25,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088804609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:25,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:25,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:04:25,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752686857] [2024-10-14 18:04:25,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:25,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:04:25,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:25,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:04:25,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:04:25,243 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:25,288 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-10-14 18:04:25,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:04:25,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-14 18:04:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:25,289 INFO L225 Difference]: With dead ends: 41 [2024-10-14 18:04:25,289 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 18:04:25,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:04:25,290 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:25,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:04:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 18:04:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-14 18:04:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 30 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-10-14 18:04:25,292 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 12 [2024-10-14 18:04:25,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:25,292 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-10-14 18:04:25,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-10-14 18:04:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 18:04:25,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:25,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:25,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 18:04:25,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:25,493 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 18:04:25,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash -638293319, now seen corresponding path program 1 times [2024-10-14 18:04:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:25,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309592200] [2024-10-14 18:04:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:25,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:25,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:25,495 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:25,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 18:04:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:25,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 18:04:25,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:25,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:04:25,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:04:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:04:25,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:25,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:25,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309592200] [2024-10-14 18:04:25,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309592200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:25,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:25,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:04:25,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120943160] [2024-10-14 18:04:25,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:25,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:04:25,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:25,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:04:25,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:04:25,681 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:25,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:25,895 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-10-14 18:04:25,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:04:25,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-14 18:04:25,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:25,897 INFO L225 Difference]: With dead ends: 41 [2024-10-14 18:04:25,897 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 18:04:25,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:04:25,898 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:25,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 47 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:04:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 18:04:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2024-10-14 18:04:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.434782608695652) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-10-14 18:04:25,900 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 13 [2024-10-14 18:04:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:25,901 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-10-14 18:04:25,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-10-14 18:04:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 18:04:25,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:25,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:25,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 18:04:26,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:26,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 18:04:26,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:26,104 INFO L85 PathProgramCache]: Analyzing trace with hash -638293736, now seen corresponding path program 1 times [2024-10-14 18:04:26,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:26,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204113146] [2024-10-14 18:04:26,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:26,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:26,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:26,106 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:26,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 18:04:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:26,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:04:26,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:04:26,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:26,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:26,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204113146] [2024-10-14 18:04:26,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204113146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:26,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:26,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:04:26,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684981076] [2024-10-14 18:04:26,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:26,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:04:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:26,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:04:26,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:04:26,162 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:26,186 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-10-14 18:04:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:04:26,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-14 18:04:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:26,187 INFO L225 Difference]: With dead ends: 34 [2024-10-14 18:04:26,187 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 18:04:26,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:04:26,187 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:26,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:04:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 18:04:26,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-14 18:04:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-10-14 18:04:26,189 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 13 [2024-10-14 18:04:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:26,192 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-10-14 18:04:26,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:04:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-10-14 18:04:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 18:04:26,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:26,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:26,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 18:04:26,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:26,394 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2024-10-14 18:04:26,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:26,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1687744091, now seen corresponding path program 1 times [2024-10-14 18:04:26,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:26,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434104018] [2024-10-14 18:04:26,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:26,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:26,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:26,395 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:26,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 18:04:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 18:04:26,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 18:04:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 18:04:26,480 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 18:04:26,480 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 18:04:26,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2024-10-14 18:04:26,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2024-10-14 18:04:26,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2024-10-14 18:04:26,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (9 of 13 remaining) [2024-10-14 18:04:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (8 of 13 remaining) [2024-10-14 18:04:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (7 of 13 remaining) [2024-10-14 18:04:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2024-10-14 18:04:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2024-10-14 18:04:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 13 remaining) [2024-10-14 18:04:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 13 remaining) [2024-10-14 18:04:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 13 remaining) [2024-10-14 18:04:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2024-10-14 18:04:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 13 remaining) [2024-10-14 18:04:26,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-14 18:04:26,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:26,686 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:26,712 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 18:04:26,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:04:26 BoogieIcfgContainer [2024-10-14 18:04:26,714 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 18:04:26,715 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 18:04:26,715 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 18:04:26,715 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 18:04:26,715 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:04:21" (3/4) ... [2024-10-14 18:04:26,717 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 18:04:26,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 18:04:26,718 INFO L158 Benchmark]: Toolchain (without parser) took 6624.90ms. Allocated memory was 67.1MB in the beginning and 109.1MB in the end (delta: 41.9MB). Free memory was 39.4MB in the beginning and 84.9MB in the end (delta: -45.5MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. [2024-10-14 18:04:26,719 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 67.1MB. Free memory was 41.7MB in the beginning and 41.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 18:04:26,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 661.89ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 39.2MB in the beginning and 49.1MB in the end (delta: -9.9MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-10-14 18:04:26,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.36ms. Allocated memory is still 90.2MB. Free memory was 49.1MB in the beginning and 46.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 18:04:26,719 INFO L158 Benchmark]: Boogie Preprocessor took 52.29ms. Allocated memory is still 90.2MB. Free memory was 46.6MB in the beginning and 44.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 18:04:26,719 INFO L158 Benchmark]: RCFGBuilder took 443.76ms. Allocated memory is still 90.2MB. Free memory was 44.1MB in the beginning and 55.3MB in the end (delta: -11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 18:04:26,720 INFO L158 Benchmark]: TraceAbstraction took 5400.05ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 54.8MB in the beginning and 84.9MB in the end (delta: -30.1MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2024-10-14 18:04:26,720 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 109.1MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 18:04:26,721 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 67.1MB. Free memory was 41.7MB in the beginning and 41.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 661.89ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 39.2MB in the beginning and 49.1MB in the end (delta: -9.9MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.36ms. Allocated memory is still 90.2MB. Free memory was 49.1MB in the beginning and 46.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.29ms. Allocated memory is still 90.2MB. Free memory was 46.6MB in the beginning and 44.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 443.76ms. Allocated memory is still 90.2MB. Free memory was 44.1MB in the beginning and 55.3MB in the end (delta: -11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5400.05ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 54.8MB in the beginning and 84.9MB in the end (delta: -30.1MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 109.1MB. Free memory is still 84.9MB. 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 - UnprovableResult [Line: 791]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 791. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L783] struct A a6; [L783] struct A a6; [L792] CALL entry_point() [L785] CALL, EXPR probe2_6(&a6) [L764] int ret = - -3; VAL [a6={2:0}, a={2:0}, ldv_global_msg_list={1:0}, ret=3] [L765] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={2:0}, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L765] RET, EXPR ldv_malloc(sizeof(int)) VAL [a6={2:0}, a={2:0}, ldv_global_msg_list={1:0}, ret=3] [L765] int *p = (int *)ldv_malloc(sizeof(int)); [L766] COND FALSE !(p==0) [L768] CALL, EXPR f6() [L758] return __VERIFIER_nondet_int(); [L768] RET, EXPR f6() [L768] ret = f6() [L769] COND FALSE !(ret<0) [L771] CALL, EXPR g6() [L761] return __VERIFIER_nondet_int(); [L771] RET, EXPR g6() [L771] ret = g6() [L772] COND TRUE ret<0 [L773] return ret; VAL [\result=-2147483648, a6={2:0}, a={2:0}, ldv_global_msg_list={1:0}, p={6:0}] [L785] RET, EXPR probe2_6(&a6) [L785] int ret = probe2_6(&a6); [L786] COND FALSE !(ret==0) VAL [a6={2:0}, ldv_global_msg_list={1:0}] [L789] a6.p = 0 [L792] RET entry_point() - 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: 777]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that free always succeeds Unable to prove that free 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: 781]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that free always succeeds Unable to prove that free 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 890 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 97 IncrementalHoareTripleChecker+Unchecked, 576 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 538 IncrementalHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 314 mSDtfsCounter, 538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=7, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 44 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 125 ConstructedInterpolants, 6 QuantifiedInterpolants, 836 SizeOfPredicates, 6 NumberOfNonLiveVariables, 570 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 could not prove your program: unable to determine feasibility of some traces [2024-10-14 18:04:26,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample