./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test13_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 c20063fdafbef5c00ec1f1fcfed63f5b6ab29c7a5ae9bd5cc27a6dcf474b9797 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:15:05,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:15:05,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:15:05,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:15:05,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:15:05,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:15:05,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:15:05,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:15:05,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:15:05,677 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:15:05,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:15:05,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:15:05,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:15:05,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:15:05,679 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:15:05,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:15:05,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:15:05,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:15:05,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:15:05,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:15:05,680 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:15:05,681 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:15:05,681 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:15:05,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:15:05,681 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:15:05,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:15:05,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:15:05,682 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:15:05,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:15:05,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:15:05,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:15:05,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:15:05,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:15:05,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:15:05,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:15:05,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:15:05,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:15:05,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:15:05,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:15:05,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:15:05,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:15:05,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:15:05,685 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 -> c20063fdafbef5c00ec1f1fcfed63f5b6ab29c7a5ae9bd5cc27a6dcf474b9797 [2024-11-10 15:15:05,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:15:05,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:15:05,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:15:05,926 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:15:05,927 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:15:05,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i [2024-11-10 15:15:07,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:15:07,363 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:15:07,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i [2024-11-10 15:15:07,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f067e9c08/63dec729316645ea8870d13f0a5f443f/FLAGc6df8dc8e [2024-11-10 15:15:07,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f067e9c08/63dec729316645ea8870d13f0a5f443f [2024-11-10 15:15:07,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:15:07,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:15:07,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:15:07,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:15:07,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:15:07,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:07" (1/1) ... [2024-11-10 15:15:07,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d16ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:07, skipping insertion in model container [2024-11-10 15:15:07,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:07" (1/1) ... [2024-11-10 15:15:07,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:15:08,084 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:08,135 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:08,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:15:08,158 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-11-10 15:15:08,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5ea7793c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:08, skipping insertion in model container [2024-11-10 15:15:08,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:15:08,159 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 15:15:08,161 INFO L158 Benchmark]: Toolchain (without parser) took 413.04ms. Allocated memory is still 140.5MB. Free memory was 71.9MB in the beginning and 105.4MB in the end (delta: -33.5MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-10 15:15:08,162 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 140.5MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:15:08,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.09ms. Allocated memory is still 140.5MB. Free memory was 71.6MB in the beginning and 105.4MB in the end (delta: -33.8MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-10 15:15:08,164 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.16ms. Allocated memory is still 140.5MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.09ms. Allocated memory is still 140.5MB. Free memory was 71.6MB in the beginning and 105.4MB in the end (delta: -33.8MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test13_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 c20063fdafbef5c00ec1f1fcfed63f5b6ab29c7a5ae9bd5cc27a6dcf474b9797 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:15:09,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:15:09,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 15:15:09,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:15:09,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:15:10,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:15:10,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:15:10,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:15:10,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:15:10,016 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:15:10,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:15:10,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:15:10,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:15:10,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:15:10,017 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:15:10,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:15:10,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:15:10,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:15:10,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:15:10,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:15:10,021 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:15:10,023 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:15:10,023 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:15:10,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:15:10,023 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:15:10,023 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 15:15:10,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:15:10,024 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 15:15:10,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:15:10,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:15:10,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:15:10,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:15:10,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:15:10,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:15:10,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:15:10,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:15:10,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:15:10,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:15:10,026 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 15:15:10,026 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 15:15:10,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:15:10,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:15:10,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:15:10,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:15:10,030 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 -> c20063fdafbef5c00ec1f1fcfed63f5b6ab29c7a5ae9bd5cc27a6dcf474b9797 [2024-11-10 15:15:10,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:15:10,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:15:10,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:15:10,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:15:10,360 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:15:10,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i [2024-11-10 15:15:11,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:15:11,917 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:15:11,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i [2024-11-10 15:15:11,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937002ddf/f0323c3113ff43ceb53e019992a74a32/FLAGaff6ca459 [2024-11-10 15:15:12,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937002ddf/f0323c3113ff43ceb53e019992a74a32 [2024-11-10 15:15:12,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:15:12,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:15:12,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:15:12,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:15:12,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:15:12,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d6cd04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12, skipping insertion in model container [2024-11-10 15:15:12,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:15:12,576 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:12,621 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:12,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:15:12,639 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 15:15:12,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:15:12,672 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:12,694 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:12,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:15:12,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:15:12,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:15:12,801 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:15:12,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12 WrapperNode [2024-11-10 15:15:12,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:15:12,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:15:12,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:15:12,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:15:12,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,848 INFO L138 Inliner]: procedures = 166, calls = 74, calls flagged for inlining = 21, calls inlined = 4, statements flattened = 21 [2024-11-10 15:15:12,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:15:12,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:15:12,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:15:12,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:15:12,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,898 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [9, 2]. 82 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 6 writes are split as follows [6, 0]. [2024-11-10 15:15:12,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:15:12,928 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:15:12,928 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:15:12,928 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:15:12,929 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12" (1/1) ... [2024-11-10 15:15:12,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:15:12,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:15:12,969 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-11-10 15:15:12,975 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-11-10 15:15:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-10 15:15:13,009 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-10 15:15:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-10 15:15:13,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-10 15:15:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-10 15:15:13,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-10 15:15:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-10 15:15:13,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-10 15:15:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:15:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:15:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:15:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:15:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:15:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:15:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:15:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:15:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:15:13,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:15:13,139 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:15:13,141 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:15:13,337 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2024-11-10 15:15:13,377 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-10 15:15:13,379 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:15:13,392 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:15:13,392 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:15:13,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:15:13 BoogieIcfgContainer [2024-11-10 15:15:13,393 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:15:13,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:15:13,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:15:13,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:15:13,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:15:12" (1/3) ... [2024-11-10 15:15:13,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5fdbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:15:13, skipping insertion in model container [2024-11-10 15:15:13,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:12" (2/3) ... [2024-11-10 15:15:13,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5fdbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:15:13, skipping insertion in model container [2024-11-10 15:15:13,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:15:13" (3/3) ... [2024-11-10 15:15:13,401 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_1.i [2024-11-10 15:15:13,417 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:15:13,417 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-10 15:15:13,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:15:13,464 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;@1f6eeeae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:15:13,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-10 15:15:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 43 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:15:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:15:13,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:13,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:13,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:13,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:13,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2108547337, now seen corresponding path program 1 times [2024-11-10 15:15:13,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:13,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156820554] [2024-11-10 15:15:13,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:13,495 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-11-10 15:15:13,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:13,498 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-11-10 15:15:13,499 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-11-10 15:15:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:13,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:15:13,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:13,809 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 15:15:13,810 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-11-10 15:15:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:13,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:13,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156820554] [2024-11-10 15:15:13,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156820554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:13,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:13,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:15:13,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706242755] [2024-11-10 15:15:13,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:13,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:15:13,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:13,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:15:13,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=30, Unknown=1, NotChecked=0, Total=42 [2024-11-10 15:15:13,944 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 43 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:14,243 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2024-11-10 15:15:14,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:15:14,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-10 15:15:14,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:14,251 INFO L225 Difference]: With dead ends: 52 [2024-11-10 15:15:14,252 INFO L226 Difference]: Without dead ends: 49 [2024-11-10 15:15:14,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=70, Unknown=1, NotChecked=0, Total=110 [2024-11-10 15:15:14,255 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 107 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:14,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 45 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:15:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-10 15:15:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-10 15:15:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:15:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-11-10 15:15:14,318 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 12 [2024-11-10 15:15:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:14,318 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-11-10 15:15:14,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-11-10 15:15:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:15:14,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:14,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:14,325 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-11-10 15:15:14,521 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-11-10 15:15:14,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:14,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:14,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2108547338, now seen corresponding path program 1 times [2024-11-10 15:15:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:14,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109115499] [2024-11-10 15:15:14,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:14,523 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-11-10 15:15:14,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:14,526 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-11-10 15:15:14,541 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-11-10 15:15:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:14,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 15:15:14,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:14,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:15:14,766 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-11-10 15:15:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:14,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:14,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:14,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109115499] [2024-11-10 15:15:14,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109115499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:14,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:14,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:15:14,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369433968] [2024-11-10 15:15:14,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:14,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:15:14,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:14,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:15:14,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:15:14,851 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:15,223 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2024-11-10 15:15:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:15:15,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-10 15:15:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:15,224 INFO L225 Difference]: With dead ends: 48 [2024-11-10 15:15:15,224 INFO L226 Difference]: Without dead ends: 48 [2024-11-10 15:15:15,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:15:15,225 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 110 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:15,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 50 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:15:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-10 15:15:15,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-11-10 15:15:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.56) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:15:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2024-11-10 15:15:15,230 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 12 [2024-11-10 15:15:15,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:15,230 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2024-11-10 15:15:15,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2024-11-10 15:15:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:15:15,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:15,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:15,238 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 (3)] Forceful destruction successful, exit code 0 [2024-11-10 15:15:15,434 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-11-10 15:15:15,434 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:15,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:15,435 INFO L85 PathProgramCache]: Analyzing trace with hash 941038772, now seen corresponding path program 1 times [2024-11-10 15:15:15,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:15,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343387632] [2024-11-10 15:15:15,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:15,435 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-11-10 15:15:15,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:15,438 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-11-10 15:15:15,443 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-11-10 15:15:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:15,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:15:15,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:15,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:15,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:15,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343387632] [2024-11-10 15:15:15,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343387632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:15,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:15,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:15:15,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21414775] [2024-11-10 15:15:15,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:15,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:15:15,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:15,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:15:15,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:15:15,498 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:15,512 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2024-11-10 15:15:15,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:15:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 15:15:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:15,513 INFO L225 Difference]: With dead ends: 52 [2024-11-10 15:15:15,513 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 15:15:15,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-10 15:15:15,515 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:15,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 175 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:15:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 15:15:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-11-10 15:15:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.5) internal successors, (42), 41 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:15:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2024-11-10 15:15:15,525 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 13 [2024-11-10 15:15:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:15,525 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2024-11-10 15:15:15,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2024-11-10 15:15:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:15:15,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:15,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:15,530 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 (4)] Ended with exit code 0 [2024-11-10 15:15:15,726 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-11-10 15:15:15,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:15,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:15,728 INFO L85 PathProgramCache]: Analyzing trace with hash -866415691, now seen corresponding path program 1 times [2024-11-10 15:15:15,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:15,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311997686] [2024-11-10 15:15:15,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:15,728 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-11-10 15:15:15,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:15,731 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-11-10 15:15:15,731 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-11-10 15:15:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:15,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:15:15,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:15,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:15,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:15,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311997686] [2024-11-10 15:15:15,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311997686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:15,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:15,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:15:15,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955825213] [2024-11-10 15:15:15,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:15,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:15:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:15,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:15:15,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:15:15,873 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:16,032 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2024-11-10 15:15:16,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:15:16,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 15:15:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:16,034 INFO L225 Difference]: With dead ends: 48 [2024-11-10 15:15:16,034 INFO L226 Difference]: Without dead ends: 48 [2024-11-10 15:15:16,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:15:16,035 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 66 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:16,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 42 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:15:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-10 15:15:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-10 15:15:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 39 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:15:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2024-11-10 15:15:16,039 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 13 [2024-11-10 15:15:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:16,039 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2024-11-10 15:15:16,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-11-10 15:15:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:15:16,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:16,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:16,042 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 (5)] Ended with exit code 0 [2024-11-10 15:15:16,240 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-11-10 15:15:16,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:16,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash -866415690, now seen corresponding path program 1 times [2024-11-10 15:15:16,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:16,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465682621] [2024-11-10 15:15:16,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:16,241 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-11-10 15:15:16,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:16,244 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-11-10 15:15:16,244 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-11-10 15:15:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:16,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 15:15:16,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:16,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:16,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:16,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465682621] [2024-11-10 15:15:16,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465682621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:16,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:16,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:15:16,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953001853] [2024-11-10 15:15:16,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:16,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:15:16,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:16,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:15:16,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:15:16,427 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:16,696 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2024-11-10 15:15:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:15:16,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 15:15:16,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:16,697 INFO L225 Difference]: With dead ends: 81 [2024-11-10 15:15:16,697 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 15:15:16,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:15:16,698 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 59 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:16,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 134 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:15:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 15:15:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2024-11-10 15:15:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 55 states have internal predecessors, (63), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-10 15:15:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-11-10 15:15:16,703 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 13 [2024-11-10 15:15:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:16,703 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-11-10 15:15:16,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-11-10 15:15:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:15:16,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:16,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:16,709 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 (6)] Forceful destruction successful, exit code 0 [2024-11-10 15:15:16,906 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-11-10 15:15:16,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:16,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1837030727, now seen corresponding path program 1 times [2024-11-10 15:15:16,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:16,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418838324] [2024-11-10 15:15:16,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:16,908 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-11-10 15:15:16,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:16,911 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-11-10 15:15:16,912 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-11-10 15:15:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:16,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 15:15:16,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:17,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 15:15:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:17,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:17,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:17,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418838324] [2024-11-10 15:15:17,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418838324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:17,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:17,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:15:17,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848682150] [2024-11-10 15:15:17,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:17,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:15:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:17,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:15:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:15:17,057 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:17,283 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2024-11-10 15:15:17,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:15:17,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-10 15:15:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:17,285 INFO L225 Difference]: With dead ends: 79 [2024-11-10 15:15:17,285 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 15:15:17,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:15:17,286 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:17,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 150 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:15:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 15:15:17,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2024-11-10 15:15:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 54 states have internal predecessors, (61), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-10 15:15:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2024-11-10 15:15:17,293 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 15 [2024-11-10 15:15:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:17,293 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-10 15:15:17,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2024-11-10 15:15:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:15:17,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:17,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:17,301 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-11-10 15:15:17,498 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-11-10 15:15:17,498 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:17,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:17,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1837030728, now seen corresponding path program 1 times [2024-11-10 15:15:17,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:17,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442435793] [2024-11-10 15:15:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:17,499 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-11-10 15:15:17,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:17,500 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-11-10 15:15:17,502 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-11-10 15:15:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:17,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 15:15:17,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:17,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:15:17,719 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-11-10 15:15:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:17,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:17,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:17,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442435793] [2024-11-10 15:15:17,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442435793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:17,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:17,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:15:17,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922958492] [2024-11-10 15:15:17,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:17,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:15:17,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:17,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:15:17,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:15:17,904 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:18,485 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-11-10 15:15:18,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:15:18,485 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-10 15:15:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:18,486 INFO L225 Difference]: With dead ends: 72 [2024-11-10 15:15:18,486 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 15:15:18,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:15:18,487 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 61 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:18,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 128 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:15:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 15:15:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2024-11-10 15:15:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.372093023255814) internal successors, (59), 53 states have internal predecessors, (59), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-10 15:15:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2024-11-10 15:15:18,491 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 15 [2024-11-10 15:15:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:18,492 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2024-11-10 15:15:18,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-11-10 15:15:18,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:15:18,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:18,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:18,496 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-11-10 15:15:18,695 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-11-10 15:15:18,695 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __ldv_list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:18,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:18,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1113377680, now seen corresponding path program 1 times [2024-11-10 15:15:18,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:18,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906295269] [2024-11-10 15:15:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:18,696 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-11-10 15:15:18,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:18,697 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-11-10 15:15:18,698 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-11-10 15:15:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:18,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:15:18,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:18,768 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-11-10 15:15:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:18,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:18,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:18,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906295269] [2024-11-10 15:15:18,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906295269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:18,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:18,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:15:18,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411085725] [2024-11-10 15:15:18,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:18,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:15:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:18,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:15:18,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:15:18,829 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:19,019 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2024-11-10 15:15:19,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:15:19,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-10 15:15:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:19,023 INFO L225 Difference]: With dead ends: 70 [2024-11-10 15:15:19,023 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 15:15:19,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:15:19,024 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:19,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 160 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:15:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 15:15:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-11-10 15:15:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.302325581395349) internal successors, (56), 52 states have internal predecessors, (56), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-10 15:15:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2024-11-10 15:15:19,028 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 16 [2024-11-10 15:15:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:19,028 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2024-11-10 15:15:19,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2024-11-10 15:15:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:15:19,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:19,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:19,032 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 (9)] Forceful destruction successful, exit code 0 [2024-11-10 15:15:19,231 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-11-10 15:15:19,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __ldv_list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:19,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:19,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1113377681, now seen corresponding path program 1 times [2024-11-10 15:15:19,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:19,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334865058] [2024-11-10 15:15:19,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:19,233 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-11-10 15:15:19,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:19,235 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-11-10 15:15:19,235 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-11-10 15:15:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:19,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 15:15:19,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:19,296 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 5 [2024-11-10 15:15:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:19,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:19,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:19,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334865058] [2024-11-10 15:15:19,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334865058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:19,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:19,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:15:19,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737447298] [2024-11-10 15:15:19,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:19,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:15:19,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:19,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:15:19,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:15:19,410 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:19,670 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2024-11-10 15:15:19,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:15:19,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-10 15:15:19,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:19,671 INFO L225 Difference]: With dead ends: 68 [2024-11-10 15:15:19,671 INFO L226 Difference]: Without dead ends: 68 [2024-11-10 15:15:19,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:15:19,672 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:19,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 194 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:15:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-10 15:15:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-11-10 15:15:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.255813953488372) internal successors, (54), 52 states have internal predecessors, (54), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-10 15:15:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2024-11-10 15:15:19,676 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 16 [2024-11-10 15:15:19,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:19,676 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2024-11-10 15:15:19,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:19,677 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2024-11-10 15:15:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:15:19,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:19,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:19,683 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-11-10 15:15:19,878 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-11-10 15:15:19,878 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __ldv_list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:19,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:19,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1242460399, now seen corresponding path program 1 times [2024-11-10 15:15:19,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:19,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795480873] [2024-11-10 15:15:19,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:19,879 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-11-10 15:15:19,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:19,881 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-11-10 15:15:19,882 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-11-10 15:15:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:19,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:15:19,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:19,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:19,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:19,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795480873] [2024-11-10 15:15:19,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795480873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:19,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:19,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:15:19,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428655809] [2024-11-10 15:15:19,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:19,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:15:19,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:19,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:15:19,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:15:19,966 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:19,983 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2024-11-10 15:15:19,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:15:19,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-10 15:15:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:19,984 INFO L225 Difference]: With dead ends: 49 [2024-11-10 15:15:19,984 INFO L226 Difference]: Without dead ends: 49 [2024-11-10 15:15:19,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-11-10 15:15:19,985 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:19,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:15:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-10 15:15:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-10 15:15:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 38 states have internal predecessors, (38), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:15:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2024-11-10 15:15:19,988 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 16 [2024-11-10 15:15:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:19,988 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2024-11-10 15:15:19,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2024-11-10 15:15:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:15:19,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:19,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:19,992 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-11-10 15:15:20,189 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-11-10 15:15:20,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:20,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:20,190 INFO L85 PathProgramCache]: Analyzing trace with hash 509093389, now seen corresponding path program 1 times [2024-11-10 15:15:20,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:20,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667090746] [2024-11-10 15:15:20,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:20,191 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-11-10 15:15:20,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:20,192 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-11-10 15:15:20,193 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-11-10 15:15:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:20,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:15:20,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:20,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:20,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:20,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667090746] [2024-11-10 15:15:20,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667090746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:20,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:20,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:15:20,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993056984] [2024-11-10 15:15:20,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:20,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:15:20,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:20,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:15:20,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:15:20,275 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:20,346 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2024-11-10 15:15:20,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:15:20,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-10 15:15:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:20,347 INFO L225 Difference]: With dead ends: 48 [2024-11-10 15:15:20,348 INFO L226 Difference]: Without dead ends: 48 [2024-11-10 15:15:20,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:15:20,348 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:20,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 93 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:15:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-10 15:15:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-10 15:15:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.121212121212121) internal successors, (37), 37 states have internal predecessors, (37), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:15:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2024-11-10 15:15:20,355 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 18 [2024-11-10 15:15:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:20,355 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2024-11-10 15:15:20,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2024-11-10 15:15:20,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:15:20,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:20,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:20,361 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 (12)] Forceful destruction successful, exit code 0 [2024-11-10 15:15:20,556 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-11-10 15:15:20,556 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:20,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash 509093390, now seen corresponding path program 1 times [2024-11-10 15:15:20,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:20,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282503065] [2024-11-10 15:15:20,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:20,557 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-11-10 15:15:20,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:20,558 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-11-10 15:15:20,559 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-11-10 15:15:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:20,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:15:20,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:20,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:20,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:20,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282503065] [2024-11-10 15:15:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282503065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:15:20,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813357190] [2024-11-10 15:15:20,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:20,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:15:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:20,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:15:20,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:15:20,698 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:20,818 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2024-11-10 15:15:20,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:15:20,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-10 15:15:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:20,819 INFO L225 Difference]: With dead ends: 47 [2024-11-10 15:15:20,819 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 15:15:20,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:15:20,819 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:20,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 108 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:15:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 15:15:20,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-10 15:15:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:15:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2024-11-10 15:15:20,822 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 18 [2024-11-10 15:15:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:20,823 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2024-11-10 15:15:20,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2024-11-10 15:15:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:15:20,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:20,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:20,833 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-11-10 15:15:21,024 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-11-10 15:15:21,024 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:21,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash 486039724, now seen corresponding path program 1 times [2024-11-10 15:15:21,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:21,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256781049] [2024-11-10 15:15:21,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:21,025 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-11-10 15:15:21,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:21,026 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-11-10 15:15:21,027 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-11-10 15:15:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:21,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:15:21,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:21,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:21,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:21,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256781049] [2024-11-10 15:15:21,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256781049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:21,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:21,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:15:21,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870464048] [2024-11-10 15:15:21,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:21,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:15:21,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:21,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:15:21,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:15:21,089 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:15:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:21,146 INFO L93 Difference]: Finished difference Result 50 states and 49 transitions. [2024-11-10 15:15:21,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:15:21,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-10 15:15:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:21,147 INFO L225 Difference]: With dead ends: 50 [2024-11-10 15:15:21,147 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 15:15:21,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-11-10 15:15:21,147 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:21,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 38 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:15:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 15:15:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 15:15:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:15:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 35 transitions. [2024-11-10 15:15:21,149 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 35 transitions. Word has length 19 [2024-11-10 15:15:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:21,149 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 35 transitions. [2024-11-10 15:15:21,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:15:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 35 transitions. [2024-11-10 15:15:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:15:21,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:21,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:21,153 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 (14)] Ended with exit code 0 [2024-11-10 15:15:21,350 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-11-10 15:15:21,351 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:21,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1839450104, now seen corresponding path program 1 times [2024-11-10 15:15:21,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:21,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257878953] [2024-11-10 15:15:21,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:21,352 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-11-10 15:15:21,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:21,353 INFO L229 MonitoredProcess]: Starting monitored process 15 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-11-10 15:15:21,353 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 (15)] Waiting until timeout for monitored process [2024-11-10 15:15:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:21,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 15:15:21,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:21,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:21,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:21,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257878953] [2024-11-10 15:15:21,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257878953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:21,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:21,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:15:21,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27649139] [2024-11-10 15:15:21,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:21,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:15:21,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:21,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:15:21,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:15:21,532 INFO L87 Difference]: Start difference. First operand 36 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:15:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:21,683 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2024-11-10 15:15:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:15:21,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-10 15:15:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:21,684 INFO L225 Difference]: With dead ends: 35 [2024-11-10 15:15:21,684 INFO L226 Difference]: Without dead ends: 35 [2024-11-10 15:15:21,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:15:21,685 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:21,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 89 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:15:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-10 15:15:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-10 15:15:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:15:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2024-11-10 15:15:21,687 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 27 [2024-11-10 15:15:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:21,687 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2024-11-10 15:15:21,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:15:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2024-11-10 15:15:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:15:21,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:21,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:21,696 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 (15)] Ended with exit code 0 [2024-11-10 15:15:21,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-11-10 15:15:21,889 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:21,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1188378323, now seen corresponding path program 1 times [2024-11-10 15:15:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:21,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932237280] [2024-11-10 15:15:21,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:21,890 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-11-10 15:15:21,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:21,891 INFO L229 MonitoredProcess]: Starting monitored process 16 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-11-10 15:15:21,892 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 (16)] Waiting until timeout for monitored process [2024-11-10 15:15:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:21,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 15:15:21,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:22,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 15:15:22,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 15:15:22,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:15:22,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 15:15:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:22,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:22,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:22,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932237280] [2024-11-10 15:15:22,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932237280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:22,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:22,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:15:22,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525611516] [2024-11-10 15:15:22,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:22,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:15:22,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:22,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:15:22,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:15:22,208 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:15:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:22,616 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2024-11-10 15:15:22,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:15:22,617 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-10 15:15:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:22,617 INFO L225 Difference]: With dead ends: 34 [2024-11-10 15:15:22,617 INFO L226 Difference]: Without dead ends: 34 [2024-11-10 15:15:22,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2024-11-10 15:15:22,618 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:22,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 127 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:15:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-10 15:15:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-10 15:15:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:15:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2024-11-10 15:15:22,619 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 28 [2024-11-10 15:15:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:22,620 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2024-11-10 15:15:22,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:15:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2024-11-10 15:15:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:15:22,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:22,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:22,624 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 (16)] Ended with exit code 0 [2024-11-10 15:15:22,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-11-10 15:15:22,821 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:15:22,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:22,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1098834798, now seen corresponding path program 1 times [2024-11-10 15:15:22,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:22,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649981133] [2024-11-10 15:15:22,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:22,822 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-11-10 15:15:22,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:22,824 INFO L229 MonitoredProcess]: Starting monitored process 17 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-11-10 15:15:22,825 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 (17)] Waiting until timeout for monitored process [2024-11-10 15:15:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 15:15:22,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 15:15:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 15:15:22,988 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 15:15:22,988 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 15:15:22,989 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-10 15:15:22,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2024-11-10 15:15:22,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2024-11-10 15:15:22,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2024-11-10 15:15:22,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-10 15:15:22,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-10 15:15:22,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2024-11-10 15:15:22,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-10 15:15:22,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-10 15:15:22,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2024-11-10 15:15:22,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-10 15:15:22,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-10 15:15:22,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2024-11-10 15:15:22,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-10 15:15:22,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-10 15:15:22,995 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 (17)] Ended with exit code 0 [2024-11-10 15:15:23,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-11-10 15:15:23,194 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:23,218 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:15:23,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:15:23 BoogieIcfgContainer [2024-11-10 15:15:23,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:15:23,220 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:15:23,220 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:15:23,220 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:15:23,221 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:15:13" (3/4) ... [2024-11-10 15:15:23,223 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 15:15:23,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:15:23,224 INFO L158 Benchmark]: Toolchain (without parser) took 10968.44ms. Allocated memory was 67.1MB in the beginning and 134.2MB in the end (delta: 67.1MB). Free memory was 42.8MB in the beginning and 82.1MB in the end (delta: -39.3MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-11-10 15:15:23,224 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 67.1MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:15:23,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.47ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 42.6MB in the beginning and 53.4MB in the end (delta: -10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 15:15:23,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.40ms. Allocated memory is still 92.3MB. Free memory was 53.4MB in the beginning and 51.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:15:23,225 INFO L158 Benchmark]: Boogie Preprocessor took 77.83ms. Allocated memory is still 92.3MB. Free memory was 51.3MB in the beginning and 49.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:15:23,225 INFO L158 Benchmark]: IcfgBuilder took 465.34ms. Allocated memory is still 92.3MB. Free memory was 49.0MB in the beginning and 55.7MB in the end (delta: -6.7MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-10 15:15:23,225 INFO L158 Benchmark]: TraceAbstraction took 9825.55ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 55.6MB in the beginning and 83.2MB in the end (delta: -27.5MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-11-10 15:15:23,226 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 134.2MB. Free memory was 83.2MB in the beginning and 82.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:15:23,227 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.14ms. Allocated memory is still 67.1MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 544.47ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 42.6MB in the beginning and 53.4MB in the end (delta: -10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.40ms. Allocated memory is still 92.3MB. Free memory was 53.4MB in the beginning and 51.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.83ms. Allocated memory is still 92.3MB. Free memory was 51.3MB in the beginning and 49.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 465.34ms. Allocated memory is still 92.3MB. Free memory was 49.0MB in the beginning and 55.7MB in the end (delta: -6.7MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9825.55ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 55.6MB in the beginning and 83.2MB in the end (delta: -27.5MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 134.2MB. Free memory was 83.2MB in the beginning and 82.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 772]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 772. 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) }; [L757] struct ldv_list_head global_list_13 = { &(global_list_13), &(global_list_13) }; [L757] struct ldv_list_head global_list_13 = { &(global_list_13), &(global_list_13) }; [L757] struct ldv_list_head global_list_13 = { &(global_list_13), &(global_list_13) }; VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}] [L773] CALL entry_point() [L769] CALL alloc_13() [L763] CALL, EXPR ldv_malloc(sizeof(struct A13)) VAL [\old(size)=12, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L763] RET, EXPR ldv_malloc(sizeof(struct A13)) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}] [L763] struct A13 *p = (struct A13 *)ldv_malloc(sizeof(struct A13)); [L764] COND TRUE \read(*p) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, p={6:0}] [L765] CALL ldv_list_add(&p->list, &global_list_13) VAL [\old(head)={2:0}, \old(new)={6:4}, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L559] EXPR head->next VAL [\old(head)={2:0}, \old(new)={6:4}, global_list_13={2:0}, head={2:0}, ldv_global_msg_list={1:0}, new={6:4}] [L559] CALL __ldv_list_add(new, head, head->next) VAL [\old(new)={6:4}, \old(next)={2:0}, \old(prev)={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L547] next->prev = new VAL [\old(new)={6:4}, \old(next)={2:0}, \old(prev)={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}, new={6:4}, next={2:0}, prev={2:0}] [L548] new->next = next VAL [\old(new)={6:4}, \old(next)={2:0}, \old(prev)={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}, new={6:4}, prev={2:0}] [L549] new->prev = prev VAL [\old(new)={6:4}, \old(next)={2:0}, \old(prev)={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}, new={6:4}, prev={2:0}] [L550] prev->next = new VAL [\old(new)={6:4}, \old(next)={2:0}, \old(prev)={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L559] RET __ldv_list_add(new, head, head->next) VAL [\old(head)={2:0}, \old(new)={6:4}, global_list_13={2:0}, head={2:0}, ldv_global_msg_list={1:0}, new={6:4}] [L765] RET ldv_list_add(&p->list, &global_list_13) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, p={6:0}] [L769] RET alloc_13() [L770] CALL LDV_INIT_LIST_HEAD(&global_list_13) VAL [\old(list)={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L540] list->next = list VAL [\old(list)={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}, list={2:0}] [L541] list->prev = list VAL [\old(list)={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L770] RET LDV_INIT_LIST_HEAD(&global_list_13) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}] [L773] 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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 5 procedures, 51 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 616 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 600 mSDsluCounter, 1682 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1278 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1682 IncrementalHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 404 mSDtfsCounter, 1682 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=5, InterpolantAutomatonStates: 125, 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, 15 MinimizatonAttempts, 40 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 236 ConstructedInterpolants, 6 QuantifiedInterpolants, 1937 SizeOfPredicates, 65 NumberOfNonLiveVariables, 1350 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-11-10 15:15:23,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample