./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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_test22_4.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 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:52:12,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:52:12,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:52:12,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:52:12,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:52:12,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:52:12,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:52:12,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:52:12,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:52:12,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:52:12,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:52:12,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:52:12,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:52:12,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:52:12,533 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:52:12,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:52:12,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:52:12,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:52:12,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:52:12,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:52:12,535 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:52:12,538 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:52:12,539 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:52:12,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:52:12,539 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:52:12,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:52:12,539 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:52:12,539 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:52:12,539 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:52:12,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:52:12,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:52:12,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:52:12,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:52:12,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:52:12,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:52:12,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:52:12,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:52:12,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:52:12,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:52:12,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:52:12,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:52:12,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:52:12,542 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 -> 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 [2024-11-09 07:52:12,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:52:12,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:52:12,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:52:12,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:52:12,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:52:12,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-11-09 07:52:14,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:52:14,251 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:52:14,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-11-09 07:52:14,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68138db0f/884477d897654914a1930cee983ee329/FLAG558622580 [2024-11-09 07:52:14,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68138db0f/884477d897654914a1930cee983ee329 [2024-11-09 07:52:14,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:52:14,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:52:14,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:52:14,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:52:14,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:52:14,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:52:14" (1/1) ... [2024-11-09 07:52:14,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b174e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:14, skipping insertion in model container [2024-11-09 07:52:14,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:52:14" (1/1) ... [2024-11-09 07:52:14,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:52:14,911 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:52:14,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:52:14,972 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-09 07:52:14,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@199695ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:14, skipping insertion in model container [2024-11-09 07:52:14,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:52:14,973 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:52:14,974 INFO L158 Benchmark]: Toolchain (without parser) took 365.23ms. Allocated memory is still 184.5MB. Free memory was 113.5MB in the beginning and 97.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:52:14,974 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory was 82.8MB in the beginning and 82.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:52:14,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.71ms. Allocated memory is still 184.5MB. Free memory was 113.3MB in the beginning and 97.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:52:14,976 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.13ms. Allocated memory is still 121.6MB. Free memory was 82.8MB in the beginning and 82.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.71ms. Allocated memory is still 184.5MB. Free memory was 113.3MB in the beginning and 97.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. 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_test22_4.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 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:52:16,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:52:16,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 07:52:16,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:52:16,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:52:16,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:52:16,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:52:16,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:52:16,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:52:16,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:52:16,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:52:16,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:52:16,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:52:16,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:52:16,701 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:52:16,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:52:16,702 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:52:16,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:52:16,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:52:16,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:52:16,703 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:52:16,704 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:52:16,704 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:52:16,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:52:16,704 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:52:16,705 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:52:16,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:52:16,705 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:52:16,705 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:52:16,705 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:52:16,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:52:16,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:52:16,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:52:16,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:52:16,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:52:16,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:52:16,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:52:16,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:52:16,708 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:52:16,708 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:52:16,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:52:16,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:52:16,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:52:16,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:52:16,709 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 -> 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 [2024-11-09 07:52:16,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:52:16,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:52:16,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:52:16,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:52:16,988 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:52:16,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-11-09 07:52:18,278 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:52:18,486 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:52:18,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-11-09 07:52:18,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff19b68a/deb65d4fffbb4b08a1a3288bd26c38b9/FLAGf98be9129 [2024-11-09 07:52:18,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff19b68a/deb65d4fffbb4b08a1a3288bd26c38b9 [2024-11-09 07:52:18,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:52:18,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:52:18,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:52:18,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:52:18,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:52:18,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:52:18" (1/1) ... [2024-11-09 07:52:18,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22388988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:18, skipping insertion in model container [2024-11-09 07:52:18,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:52:18" (1/1) ... [2024-11-09 07:52:18,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:52:18,850 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:52:18,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:52:18,919 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:52:18,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:52:18,955 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:52:18,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:52:18,973 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:52:19,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:52:19,055 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:52:19,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19 WrapperNode [2024-11-09 07:52:19,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:52:19,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:52:19,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:52:19,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:52:19,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19" (1/1) ... [2024-11-09 07:52:19,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19" (1/1) ... [2024-11-09 07:52:19,104 INFO L138 Inliner]: procedures = 167, calls = 72, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 124 [2024-11-09 07:52:19,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:52:19,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:52:19,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:52:19,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:52:19,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19" (1/1) ... [2024-11-09 07:52:19,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19" (1/1) ... [2024-11-09 07:52:19,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19" (1/1) ... [2024-11-09 07:52:19,145 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-09 07:52:19,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19" (1/1) ... [2024-11-09 07:52:19,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19" (1/1) ... [2024-11-09 07:52:19,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19" (1/1) ... [2024-11-09 07:52:19,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19" (1/1) ... [2024-11-09 07:52:19,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19" (1/1) ... [2024-11-09 07:52:19,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19" (1/1) ... [2024-11-09 07:52:19,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:52:19,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:52:19,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:52:19,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:52:19,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19" (1/1) ... [2024-11-09 07:52:19,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:52:19,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:52:19,208 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-09 07:52:19,211 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-09 07:52:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 07:52:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 07:52:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-09 07:52:19,243 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-09 07:52:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 07:52:19,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 07:52:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2024-11-09 07:52:19,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2024-11-09 07:52:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:52:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:52:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:52:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:52:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:52:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:52:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 07:52:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 07:52:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:52:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:52:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:52:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:52:19,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:52:19,385 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:52:19,387 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:52:19,728 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-09 07:52:19,728 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:52:19,741 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:52:19,741 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 07:52:19,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:52:19 BoogieIcfgContainer [2024-11-09 07:52:19,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:52:19,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:52:19,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:52:19,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:52:19,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:52:18" (1/3) ... [2024-11-09 07:52:19,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2167f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:52:19, skipping insertion in model container [2024-11-09 07:52:19,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:19" (2/3) ... [2024-11-09 07:52:19,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2167f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:52:19, skipping insertion in model container [2024-11-09 07:52:19,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:52:19" (3/3) ... [2024-11-09 07:52:19,748 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4.i [2024-11-09 07:52:19,761 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:52:19,761 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-09 07:52:19,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:52:19,806 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;@6d92a4cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:52:19,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-09 07:52:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:19,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:52:19,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:19,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:19,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:19,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:19,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1283799053, now seen corresponding path program 1 times [2024-11-09 07:52:19,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:19,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021027717] [2024-11-09 07:52:19,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:19,834 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-09 07:52:19,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:19,837 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-09 07:52:19,838 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-09 07:52:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:19,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:52:19,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:19,979 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-09 07:52:20,025 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-09 07:52:20,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:20,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:20,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021027717] [2024-11-09 07:52:20,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021027717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:20,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:20,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:52:20,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521221006] [2024-11-09 07:52:20,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:20,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:52:20,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:20,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:52:20,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:20,056 INFO L87 Difference]: Start difference. First operand has 90 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:20,300 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2024-11-09 07:52:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:52:20,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-09 07:52:20,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:20,308 INFO L225 Difference]: With dead ends: 108 [2024-11-09 07:52:20,308 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 07:52:20,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:52:20,311 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 23 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:20,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 325 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:52:20,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 07:52:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2024-11-09 07:52:20,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:52:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-11-09 07:52:20,343 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 10 [2024-11-09 07:52:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:20,344 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-11-09 07:52:20,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-11-09 07:52:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:52:20,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:20,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:20,347 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-09 07:52:20,545 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-09 07:52:20,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:20,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1312428204, now seen corresponding path program 1 times [2024-11-09 07:52:20,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:20,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862497028] [2024-11-09 07:52:20,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:20,547 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-09 07:52:20,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:20,548 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-09 07:52:20,575 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-09 07:52:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:20,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:52:20,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:20,662 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-09 07:52:20,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:20,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:20,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862497028] [2024-11-09 07:52:20,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862497028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:20,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:20,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:52:20,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894995125] [2024-11-09 07:52:20,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:20,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:52:20,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:20,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:52:20,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:20,665 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:20,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:20,685 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2024-11-09 07:52:20,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:52:20,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-09 07:52:20,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:20,687 INFO L225 Difference]: With dead ends: 91 [2024-11-09 07:52:20,687 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 07:52:20,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:20,688 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:20,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 07:52:20,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 07:52:20,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:52:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2024-11-09 07:52:20,694 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 10 [2024-11-09 07:52:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:20,694 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2024-11-09 07:52:20,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2024-11-09 07:52:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:52:20,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:20,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:20,702 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-09 07:52:20,895 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-09 07:52:20,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:20,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:20,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1143065090, now seen corresponding path program 1 times [2024-11-09 07:52:20,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:20,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628462437] [2024-11-09 07:52:20,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:20,897 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-09 07:52:20,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:20,900 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-09 07:52:20,901 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-09 07:52:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:20,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:52:20,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:20,958 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-09 07:52:21,027 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-09 07:52:21,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:21,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:21,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628462437] [2024-11-09 07:52:21,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628462437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:21,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:21,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:21,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547414111] [2024-11-09 07:52:21,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:21,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:52:21,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:21,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:52:21,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:52:21,029 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:21,279 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-11-09 07:52:21,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:52:21,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 07:52:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:21,281 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:52:21,281 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 07:52:21,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:21,282 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 19 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:21,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 405 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:52:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 07:52:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 07:52:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 83 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:52:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2024-11-09 07:52:21,290 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 11 [2024-11-09 07:52:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:21,291 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2024-11-09 07:52:21,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2024-11-09 07:52:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:52:21,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:21,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:21,295 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-09 07:52:21,492 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-09 07:52:21,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:21,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1075252755, now seen corresponding path program 1 times [2024-11-09 07:52:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132591638] [2024-11-09 07:52:21,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:21,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:52:21,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:21,497 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-09 07:52:21,498 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-09 07:52:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:21,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:52:21,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:21,582 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-09 07:52:21,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:21,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132591638] [2024-11-09 07:52:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132591638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:21,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:21,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:52:21,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230975681] [2024-11-09 07:52:21,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:21,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:52:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:21,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:52:21,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:21,585 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:21,607 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2024-11-09 07:52:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:52:21,609 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 07:52:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:21,610 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:52:21,611 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 07:52:21,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:21,613 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 15 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:21,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 339 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 07:52:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 07:52:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:52:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2024-11-09 07:52:21,622 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 12 [2024-11-09 07:52:21,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:21,624 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2024-11-09 07:52:21,624 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2024-11-09 07:52:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:52:21,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:21,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:21,629 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-09 07:52:21,825 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-09 07:52:21,825 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:21,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1476904206, now seen corresponding path program 1 times [2024-11-09 07:52:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:21,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368436682] [2024-11-09 07:52:21,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:21,827 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-09 07:52:21,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:21,829 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-09 07:52:21,830 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-09 07:52:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:21,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:52:21,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:21,898 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-09 07:52:21,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:21,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:21,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368436682] [2024-11-09 07:52:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368436682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:21,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:21,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:52:21,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702291139] [2024-11-09 07:52:21,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:21,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:52:21,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:21,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:52:21,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:21,901 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:21,914 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-09 07:52:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:52:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 07:52:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:21,916 INFO L225 Difference]: With dead ends: 93 [2024-11-09 07:52:21,916 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 07:52:21,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:21,917 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:21,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 268 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 07:52:21,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-09 07:52:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:52:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2024-11-09 07:52:21,921 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 12 [2024-11-09 07:52:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:21,921 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2024-11-09 07:52:21,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-11-09 07:52:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:52:21,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:21,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:21,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 07:52:22,122 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-09 07:52:22,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:22,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:22,123 INFO L85 PathProgramCache]: Analyzing trace with hash -444670213, now seen corresponding path program 1 times [2024-11-09 07:52:22,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:22,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133832548] [2024-11-09 07:52:22,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:22,124 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-09 07:52:22,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:22,125 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-09 07:52:22,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 07:52:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:22,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:52:22,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:22,196 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-09 07:52:22,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:22,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:22,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133832548] [2024-11-09 07:52:22,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133832548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:22,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:22,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:52:22,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856832505] [2024-11-09 07:52:22,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:22,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:52:22,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:22,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:52:22,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:22,202 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:22,217 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-09 07:52:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:52:22,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-09 07:52:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:22,218 INFO L225 Difference]: With dead ends: 93 [2024-11-09 07:52:22,218 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 07:52:22,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:22,219 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:22,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 268 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 07:52:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 07:52:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:52:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2024-11-09 07:52:22,228 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 16 [2024-11-09 07:52:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:22,229 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2024-11-09 07:52:22,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-11-09 07:52:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:52:22,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:22,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:22,233 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-09 07:52:22,430 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-09 07:52:22,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:22,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:22,431 INFO L85 PathProgramCache]: Analyzing trace with hash -959133780, now seen corresponding path program 1 times [2024-11-09 07:52:22,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:22,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816514657] [2024-11-09 07:52:22,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:22,431 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-09 07:52:22,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:22,432 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-09 07:52:22,433 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-09 07:52:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:22,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:52:22,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:52:22,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:52:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:52:22,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:22,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816514657] [2024-11-09 07:52:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816514657] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:52:22,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:52:22,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 07:52:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002898042] [2024-11-09 07:52:22,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:52:22,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:52:22,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:52:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:22,544 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:22,593 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2024-11-09 07:52:22,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:52:22,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-09 07:52:22,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:22,594 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:52:22,594 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 07:52:22,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:52:22,595 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 8 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:22,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 446 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 07:52:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 07:52:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 89 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:52:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2024-11-09 07:52:22,607 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 17 [2024-11-09 07:52:22,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:22,607 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2024-11-09 07:52:22,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-11-09 07:52:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:52:22,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:22,608 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-09 07:52:22,614 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 (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:22,808 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-09 07:52:22,809 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:22,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:22,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1989562571, now seen corresponding path program 1 times [2024-11-09 07:52:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:22,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875077975] [2024-11-09 07:52:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:22,811 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-09 07:52:22,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:22,813 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-09 07:52:22,814 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-09 07:52:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:22,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:52:22,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:22,953 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-09 07:52:22,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:22,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:22,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875077975] [2024-11-09 07:52:22,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875077975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:22,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:22,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:22,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389936203] [2024-11-09 07:52:22,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:22,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:52:22,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:22,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:52:22,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:22,956 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-09 07:52:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:23,008 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2024-11-09 07:52:23,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:52:23,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 18 [2024-11-09 07:52:23,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:23,011 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:52:23,011 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:52:23,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:52:23,012 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:23,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 445 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:23,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:52:23,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-09 07:52:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 96 states have internal predecessors, (102), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:52:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2024-11-09 07:52:23,016 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 18 [2024-11-09 07:52:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:23,016 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2024-11-09 07:52:23,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-09 07:52:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2024-11-09 07:52:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:52:23,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:23,017 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:23,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 07:52:23,217 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-09 07:52:23,218 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:23,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2146696389, now seen corresponding path program 2 times [2024-11-09 07:52:23,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:23,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321503855] [2024-11-09 07:52:23,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:52:23,220 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-09 07:52:23,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:23,221 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-09 07:52:23,222 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-09 07:52:23,279 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:52:23,279 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:52:23,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:52:23,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:23,285 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-09 07:52:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 07:52:23,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:23,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:23,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321503855] [2024-11-09 07:52:23,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321503855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:23,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:23,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:52:23,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565676080] [2024-11-09 07:52:23,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:23,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:52:23,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:23,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:52:23,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:23,354 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:23,593 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2024-11-09 07:52:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:52:23,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-09 07:52:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:23,595 INFO L225 Difference]: With dead ends: 104 [2024-11-09 07:52:23,595 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 07:52:23,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:52:23,596 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 13 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:23,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 412 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:52:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 07:52:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-09 07:52:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 95 states have internal predecessors, (101), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:52:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2024-11-09 07:52:23,600 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 20 [2024-11-09 07:52:23,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:23,600 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2024-11-09 07:52:23,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:23,600 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2024-11-09 07:52:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:52:23,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:23,601 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:23,604 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 (10)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:23,801 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-09 07:52:23,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:23,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:23,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2146696388, now seen corresponding path program 1 times [2024-11-09 07:52:23,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:23,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811969692] [2024-11-09 07:52:23,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:23,802 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-09 07:52:23,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:23,805 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-09 07:52:23,805 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-09 07:52:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:23,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:52:23,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:52:23,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:52:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:52:24,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:24,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811969692] [2024-11-09 07:52:24,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811969692] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:52:24,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:52:24,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 07:52:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281577084] [2024-11-09 07:52:24,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:52:24,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:52:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:24,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:52:24,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:52:24,017 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:24,188 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2024-11-09 07:52:24,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:52:24,190 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-09 07:52:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:24,190 INFO L225 Difference]: With dead ends: 109 [2024-11-09 07:52:24,191 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 07:52:24,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:52:24,191 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 7 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:24,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 704 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:52:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 07:52:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-09 07:52:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 101 states have internal predecessors, (107), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:52:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2024-11-09 07:52:24,198 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 20 [2024-11-09 07:52:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:24,199 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2024-11-09 07:52:24,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2024-11-09 07:52:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:52:24,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:24,200 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] [2024-11-09 07:52:24,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:24,400 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-09 07:52:24,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:24,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:24,401 INFO L85 PathProgramCache]: Analyzing trace with hash 555773483, now seen corresponding path program 1 times [2024-11-09 07:52:24,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:24,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269809507] [2024-11-09 07:52:24,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:24,401 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-09 07:52:24,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:24,403 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-09 07:52:24,403 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-09 07:52:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:24,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:52:24,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:24,480 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-09 07:52:24,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:24,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:24,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269809507] [2024-11-09 07:52:24,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269809507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:24,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:24,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:52:24,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530956508] [2024-11-09 07:52:24,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:24,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:52:24,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:24,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:52:24,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:24,482 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:52:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:24,566 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2024-11-09 07:52:24,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:52:24,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-09 07:52:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:24,567 INFO L225 Difference]: With dead ends: 115 [2024-11-09 07:52:24,567 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 07:52:24,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-09 07:52:24,568 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:24,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 178 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:52:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 07:52:24,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-09 07:52:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 89 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2024-11-09 07:52:24,571 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 21 [2024-11-09 07:52:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:24,571 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2024-11-09 07:52:24,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:52:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2024-11-09 07:52:24,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:52:24,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:24,572 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:24,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 07:52:24,772 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-09 07:52:24,773 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:24,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1832780388, now seen corresponding path program 2 times [2024-11-09 07:52:24,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:24,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804731645] [2024-11-09 07:52:24,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:52:24,774 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-09 07:52:24,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:24,775 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-09 07:52:24,776 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-09 07:52:24,835 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:52:24,835 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:52:24,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:52:24,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:24,851 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-09 07:52:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 07:52:24,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:24,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804731645] [2024-11-09 07:52:24,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804731645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:24,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:24,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:52:24,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187972985] [2024-11-09 07:52:24,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:24,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:52:24,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:24,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:52:24,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:52:24,985 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:25,228 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2024-11-09 07:52:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:52:25,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-09 07:52:25,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:25,231 INFO L225 Difference]: With dead ends: 95 [2024-11-09 07:52:25,231 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 07:52:25,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:52:25,231 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 11 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:25,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 511 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:52:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 07:52:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-11-09 07:52:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2024-11-09 07:52:25,234 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 26 [2024-11-09 07:52:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:25,234 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2024-11-09 07:52:25,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2024-11-09 07:52:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:52:25,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:25,235 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:25,238 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-09 07:52:25,436 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-09 07:52:25,436 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:25,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:25,436 INFO L85 PathProgramCache]: Analyzing trace with hash -366867557, now seen corresponding path program 1 times [2024-11-09 07:52:25,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:25,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345100410] [2024-11-09 07:52:25,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:25,437 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-09 07:52:25,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:25,438 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-09 07:52:25,439 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-09 07:52:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:25,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:52:25,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:52:25,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:52:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:52:25,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:25,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345100410] [2024-11-09 07:52:25,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345100410] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:52:25,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:52:25,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 07:52:25,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617099591] [2024-11-09 07:52:25,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:52:25,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:52:25,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:25,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:52:25,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:52:25,950 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:26,236 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-09 07:52:26,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:52:26,240 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-09 07:52:26,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:26,240 INFO L225 Difference]: With dead ends: 100 [2024-11-09 07:52:26,240 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 07:52:26,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2024-11-09 07:52:26,241 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 7 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:26,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1275 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:52:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 07:52:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 07:52:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.36986301369863) internal successors, (100), 94 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2024-11-09 07:52:26,245 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 28 [2024-11-09 07:52:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:26,245 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2024-11-09 07:52:26,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2024-11-09 07:52:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:52:26,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:26,248 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:26,253 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-09 07:52:26,449 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-09 07:52:26,449 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:26,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:26,450 INFO L85 PathProgramCache]: Analyzing trace with hash -437803525, now seen corresponding path program 2 times [2024-11-09 07:52:26,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:26,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691482179] [2024-11-09 07:52:26,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:52:26,450 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-09 07:52:26,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:26,451 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-09 07:52:26,452 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-09 07:52:26,525 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:52:26,526 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:52:26,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:52:26,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:52:26,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:26,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:26,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691482179] [2024-11-09 07:52:26,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691482179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:26,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:26,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:26,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528981693] [2024-11-09 07:52:26,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:26,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:52:26,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:26,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:52:26,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:26,584 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:26,608 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-11-09 07:52:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:52:26,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-11-09 07:52:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:26,609 INFO L225 Difference]: With dead ends: 100 [2024-11-09 07:52:26,609 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 07:52:26,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:52:26,610 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 7 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:26,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 403 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 07:52:26,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 07:52:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.356164383561644) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-11-09 07:52:26,612 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 34 [2024-11-09 07:52:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:26,612 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-11-09 07:52:26,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-11-09 07:52:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:52:26,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:26,626 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:26,630 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 (15)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:26,829 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-09 07:52:26,829 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:26,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:26,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1626311141, now seen corresponding path program 1 times [2024-11-09 07:52:26,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:26,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117144815] [2024-11-09 07:52:26,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:26,831 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-09 07:52:26,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:26,833 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-09 07:52:26,834 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-09 07:52:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:26,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:52:26,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:26,981 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-09 07:52:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:52:27,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:27,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:27,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117144815] [2024-11-09 07:52:27,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117144815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:27,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:27,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:52:27,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471296581] [2024-11-09 07:52:27,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:27,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:52:27,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:27,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:52:27,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:52:27,061 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-09 07:52:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:27,307 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2024-11-09 07:52:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:52:27,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 36 [2024-11-09 07:52:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:27,308 INFO L225 Difference]: With dead ends: 99 [2024-11-09 07:52:27,308 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 07:52:27,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:52:27,309 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 14 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:27,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 424 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:52:27,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 07:52:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-09 07:52:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 92 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2024-11-09 07:52:27,311 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 36 [2024-11-09 07:52:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:27,311 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2024-11-09 07:52:27,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-09 07:52:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2024-11-09 07:52:27,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:52:27,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:27,312 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:27,320 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-09 07:52:27,513 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-09 07:52:27,513 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:27,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:27,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1626311142, now seen corresponding path program 1 times [2024-11-09 07:52:27,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:27,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468778830] [2024-11-09 07:52:27,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:27,514 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-09 07:52:27,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:27,519 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-09 07:52:27,520 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-09 07:52:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:27,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:52:27,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:27,668 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-09 07:52:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:52:27,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:27,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:27,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468778830] [2024-11-09 07:52:27,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468778830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:27,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:27,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:52:27,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205171382] [2024-11-09 07:52:27,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:27,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:52:27,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:27,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:52:27,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:52:27,837 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-09 07:52:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:28,112 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2024-11-09 07:52:28,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:52:28,112 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 36 [2024-11-09 07:52:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:28,113 INFO L225 Difference]: With dead ends: 97 [2024-11-09 07:52:28,113 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 07:52:28,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:52:28,115 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 12 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:28,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 536 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:52:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 07:52:28,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-11-09 07:52:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2024-11-09 07:52:28,118 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 36 [2024-11-09 07:52:28,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:28,118 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2024-11-09 07:52:28,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-09 07:52:28,118 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2024-11-09 07:52:28,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:52:28,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:28,119 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:28,125 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-09 07:52:28,323 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-09 07:52:28,324 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:28,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1575668199, now seen corresponding path program 1 times [2024-11-09 07:52:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:28,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478187679] [2024-11-09 07:52:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:28,324 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-09 07:52:28,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:28,327 INFO L229 MonitoredProcess]: Starting monitored process 18 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-09 07:52:28,328 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 (18)] Waiting until timeout for monitored process [2024-11-09 07:52:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:28,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:52:28,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:52:28,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:28,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:28,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478187679] [2024-11-09 07:52:28,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478187679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:28,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:28,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:52:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205336353] [2024-11-09 07:52:28,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:28,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:52:28,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:52:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:52:28,495 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:28,533 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2024-11-09 07:52:28,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:52:28,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-09 07:52:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:28,538 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:52:28,538 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 07:52:28,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:52:28,539 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:28,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 449 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 07:52:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 07:52:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2024-11-09 07:52:28,541 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 36 [2024-11-09 07:52:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:28,541 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2024-11-09 07:52:28,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2024-11-09 07:52:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 07:52:28,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:28,548 INFO L215 NwaCegarLoop]: trace histogram [16, 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-09 07:52:28,553 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 (18)] Ended with exit code 0 [2024-11-09 07:52:28,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-09 07:52:28,749 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:28,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:28,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1084962460, now seen corresponding path program 1 times [2024-11-09 07:52:28,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:28,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025184814] [2024-11-09 07:52:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:28,750 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-09 07:52:28,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:28,751 INFO L229 MonitoredProcess]: Starting monitored process 19 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-09 07:52:28,751 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 (19)] Waiting until timeout for monitored process [2024-11-09 07:52:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:28,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:52:28,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:28,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:52:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:52:28,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:28,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025184814] [2024-11-09 07:52:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025184814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:28,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:28,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:52:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297957252] [2024-11-09 07:52:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:28,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:52:28,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:28,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:52:28,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:52:28,997 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:29,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:29,225 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2024-11-09 07:52:29,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:52:29,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-09 07:52:29,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:29,226 INFO L225 Difference]: With dead ends: 101 [2024-11-09 07:52:29,226 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 07:52:29,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:52:29,227 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 57 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:29,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 269 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:52:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 07:52:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2024-11-09 07:52:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2024-11-09 07:52:29,229 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 44 [2024-11-09 07:52:29,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:29,231 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-09 07:52:29,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2024-11-09 07:52:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 07:52:29,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:29,232 INFO L215 NwaCegarLoop]: trace histogram [16, 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-09 07:52:29,239 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 (19)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:29,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-09 07:52:29,433 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:29,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:29,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1084962459, now seen corresponding path program 1 times [2024-11-09 07:52:29,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:29,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568325022] [2024-11-09 07:52:29,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:29,434 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-09 07:52:29,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:29,436 INFO L229 MonitoredProcess]: Starting monitored process 20 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-09 07:52:29,437 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 (20)] Waiting until timeout for monitored process [2024-11-09 07:52:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:29,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:52:29,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:29,607 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-09 07:52:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:52:29,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:29,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568325022] [2024-11-09 07:52:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568325022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:29,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:29,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:52:29,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337343358] [2024-11-09 07:52:29,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:29,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:52:29,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:29,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:52:29,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:52:29,791 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:30,006 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-09 07:52:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:52:30,006 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-09 07:52:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:30,007 INFO L225 Difference]: With dead ends: 92 [2024-11-09 07:52:30,007 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 07:52:30,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:52:30,008 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 62 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:30,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 397 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:52:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 07:52:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 07:52:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-09 07:52:30,010 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 44 [2024-11-09 07:52:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:30,010 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-09 07:52:30,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-09 07:52:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 07:52:30,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:30,011 INFO L215 NwaCegarLoop]: trace histogram [16, 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, 1] [2024-11-09 07:52:30,017 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 (20)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:30,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-09 07:52:30,212 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:30,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:30,212 INFO L85 PathProgramCache]: Analyzing trace with hash -598294083, now seen corresponding path program 1 times [2024-11-09 07:52:30,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:30,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713624111] [2024-11-09 07:52:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:30,213 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-09 07:52:30,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:30,214 INFO L229 MonitoredProcess]: Starting monitored process 21 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-09 07:52:30,218 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 (21)] Waiting until timeout for monitored process [2024-11-09 07:52:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:30,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:52:30,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:52:30,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:30,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713624111] [2024-11-09 07:52:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713624111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:30,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:30,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:52:30,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011709161] [2024-11-09 07:52:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:30,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:52:30,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:30,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:52:30,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:52:30,462 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:30,483 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2024-11-09 07:52:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:52:30,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2024-11-09 07:52:30,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:30,484 INFO L225 Difference]: With dead ends: 92 [2024-11-09 07:52:30,485 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 07:52:30,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:52:30,485 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 7 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:30,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 409 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:30,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 07:52:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 07:52:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2024-11-09 07:52:30,487 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 50 [2024-11-09 07:52:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:30,487 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2024-11-09 07:52:30,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2024-11-09 07:52:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 07:52:30,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:30,488 INFO L215 NwaCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:30,494 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 (21)] Ended with exit code 0 [2024-11-09 07:52:30,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-09 07:52:30,689 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:30,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:30,689 INFO L85 PathProgramCache]: Analyzing trace with hash 650213987, now seen corresponding path program 1 times [2024-11-09 07:52:30,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:30,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91608034] [2024-11-09 07:52:30,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:30,690 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-09 07:52:30,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:30,691 INFO L229 MonitoredProcess]: Starting monitored process 22 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-09 07:52:30,692 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 (22)] Waiting until timeout for monitored process [2024-11-09 07:52:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:30,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:52:30,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:30,884 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-09 07:52:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:52:31,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:31,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:31,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91608034] [2024-11-09 07:52:31,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91608034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:31,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:31,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:52:31,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779242872] [2024-11-09 07:52:31,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:31,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:52:31,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:31,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:52:31,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:52:31,014 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:31,264 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2024-11-09 07:52:31,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:52:31,264 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2024-11-09 07:52:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:31,265 INFO L225 Difference]: With dead ends: 97 [2024-11-09 07:52:31,265 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 07:52:31,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:52:31,266 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 53 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:31,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 304 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:52:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 07:52:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2024-11-09 07:52:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 83 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2024-11-09 07:52:31,268 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 56 [2024-11-09 07:52:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:31,268 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2024-11-09 07:52:31,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2024-11-09 07:52:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 07:52:31,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:31,269 INFO L215 NwaCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:31,276 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 (22)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:31,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-09 07:52:31,469 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:31,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:31,470 INFO L85 PathProgramCache]: Analyzing trace with hash 650213988, now seen corresponding path program 1 times [2024-11-09 07:52:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:31,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939572992] [2024-11-09 07:52:31,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:31,470 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-09 07:52:31,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:31,473 INFO L229 MonitoredProcess]: Starting monitored process 23 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-09 07:52:31,474 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 (23)] Waiting until timeout for monitored process [2024-11-09 07:52:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:31,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:52:31,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:31,690 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-09 07:52:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:52:31,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:31,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:31,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939572992] [2024-11-09 07:52:31,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939572992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:31,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:31,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:52:31,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443666501] [2024-11-09 07:52:31,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:31,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:52:31,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:31,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:52:31,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:52:31,960 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:32,244 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2024-11-09 07:52:32,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:52:32,245 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2024-11-09 07:52:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:32,245 INFO L225 Difference]: With dead ends: 88 [2024-11-09 07:52:32,245 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 07:52:32,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:52:32,246 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 38 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:32,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 456 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:52:32,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 07:52:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 07:52:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 81 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2024-11-09 07:52:32,248 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 56 [2024-11-09 07:52:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:32,248 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2024-11-09 07:52:32,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2024-11-09 07:52:32,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 07:52:32,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:32,249 INFO L215 NwaCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:32,257 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 (23)] Ended with exit code 0 [2024-11-09 07:52:32,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-09 07:52:32,450 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:32,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:32,450 INFO L85 PathProgramCache]: Analyzing trace with hash 268287379, now seen corresponding path program 1 times [2024-11-09 07:52:32,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:32,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018063443] [2024-11-09 07:52:32,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:32,451 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-09 07:52:32,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:32,452 INFO L229 MonitoredProcess]: Starting monitored process 24 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-09 07:52:32,452 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 (24)] Waiting until timeout for monitored process [2024-11-09 07:52:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:32,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:52:32,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:52:32,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:32,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:32,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018063443] [2024-11-09 07:52:32,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018063443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:32,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:32,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:52:32,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219368969] [2024-11-09 07:52:32,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:32,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:52:32,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:32,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:52:32,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:52:32,700 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:32,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:32,739 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2024-11-09 07:52:32,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:52:32,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2024-11-09 07:52:32,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:32,740 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:52:32,740 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 07:52:32,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:52:32,740 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:32,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 511 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 07:52:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 07:52:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 81 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2024-11-09 07:52:32,742 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 59 [2024-11-09 07:52:32,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:32,743 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2024-11-09 07:52:32,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2024-11-09 07:52:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 07:52:32,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:32,743 INFO L215 NwaCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:32,749 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 (24)] Ended with exit code 0 [2024-11-09 07:52:32,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-09 07:52:32,944 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:32,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1692649255, now seen corresponding path program 1 times [2024-11-09 07:52:32,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:32,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095965618] [2024-11-09 07:52:32,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:32,945 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-09 07:52:32,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:32,946 INFO L229 MonitoredProcess]: Starting monitored process 25 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-09 07:52:32,947 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 (25)] Waiting until timeout for monitored process [2024-11-09 07:52:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:33,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:52:33,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:33,192 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-09 07:52:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:52:33,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:33,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:33,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095965618] [2024-11-09 07:52:33,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095965618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:33,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:33,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:52:33,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292648825] [2024-11-09 07:52:33,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:33,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:52:33,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:33,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:52:33,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:52:33,320 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:33,596 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2024-11-09 07:52:33,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:52:33,597 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2024-11-09 07:52:33,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:33,597 INFO L225 Difference]: With dead ends: 93 [2024-11-09 07:52:33,597 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 07:52:33,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:52:33,598 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 30 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:33,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 343 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:52:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 07:52:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2024-11-09 07:52:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 79 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2024-11-09 07:52:33,600 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 62 [2024-11-09 07:52:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:33,600 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2024-11-09 07:52:33,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2024-11-09 07:52:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 07:52:33,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:33,601 INFO L215 NwaCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:33,608 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 (25)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:33,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-09 07:52:33,802 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:33,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:33,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1692649256, now seen corresponding path program 1 times [2024-11-09 07:52:33,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:33,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512471407] [2024-11-09 07:52:33,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:33,803 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-09 07:52:33,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:33,804 INFO L229 MonitoredProcess]: Starting monitored process 26 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-09 07:52:33,805 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 (26)] Waiting until timeout for monitored process [2024-11-09 07:52:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:34,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 07:52:34,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:34,045 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-09 07:52:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:52:34,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:34,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:34,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512471407] [2024-11-09 07:52:34,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512471407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:34,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:34,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 07:52:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693372333] [2024-11-09 07:52:34,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:34,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:52:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:34,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:52:34,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:52:34,288 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:34,566 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2024-11-09 07:52:34,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:52:34,567 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2024-11-09 07:52:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:34,567 INFO L225 Difference]: With dead ends: 85 [2024-11-09 07:52:34,567 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 07:52:34,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:52:34,568 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 35 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:34,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 428 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:52:34,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 07:52:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-11-09 07:52:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.095890410958904) internal successors, (80), 77 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2024-11-09 07:52:34,570 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 62 [2024-11-09 07:52:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:34,570 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2024-11-09 07:52:34,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2024-11-09 07:52:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 07:52:34,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:34,571 INFO L215 NwaCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:34,577 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 (26)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:34,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-09 07:52:34,771 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:34,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:34,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1497068553, now seen corresponding path program 1 times [2024-11-09 07:52:34,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:34,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226676439] [2024-11-09 07:52:34,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:34,772 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-09 07:52:34,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:34,773 INFO L229 MonitoredProcess]: Starting monitored process 27 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-09 07:52:34,774 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 (27)] Waiting until timeout for monitored process [2024-11-09 07:52:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:35,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 07:52:35,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:52:35,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:35,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:35,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226676439] [2024-11-09 07:52:35,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226676439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:35,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:35,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:52:35,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489821446] [2024-11-09 07:52:35,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:35,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:52:35,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:35,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:52:35,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:52:35,321 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:35,503 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2024-11-09 07:52:35,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:52:35,504 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2024-11-09 07:52:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:35,504 INFO L225 Difference]: With dead ends: 84 [2024-11-09 07:52:35,504 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 07:52:35,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:52:35,505 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 51 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:35,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 418 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:52:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 07:52:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-09 07:52:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.082191780821918) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2024-11-09 07:52:35,507 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 65 [2024-11-09 07:52:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:35,507 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2024-11-09 07:52:35,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2024-11-09 07:52:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 07:52:35,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:35,508 INFO L215 NwaCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:35,515 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 (27)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:35,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-09 07:52:35,709 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 07:52:35,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash 985664715, now seen corresponding path program 1 times [2024-11-09 07:52:35,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:35,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753455959] [2024-11-09 07:52:35,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:35,710 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-09 07:52:35,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:35,711 INFO L229 MonitoredProcess]: Starting monitored process 28 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-09 07:52:35,711 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 (28)] Waiting until timeout for monitored process [2024-11-09 07:52:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:52:36,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:52:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:52:36,350 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 07:52:36,351 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:52:36,351 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (24 of 25 remaining) [2024-11-09 07:52:36,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2024-11-09 07:52:36,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2024-11-09 07:52:36,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 25 remaining) [2024-11-09 07:52:36,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 25 remaining) [2024-11-09 07:52:36,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 25 remaining) [2024-11-09 07:52:36,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 25 remaining) [2024-11-09 07:52:36,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 25 remaining) [2024-11-09 07:52:36,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 25 remaining) [2024-11-09 07:52:36,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 25 remaining) [2024-11-09 07:52:36,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 25 remaining) [2024-11-09 07:52:36,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (13 of 25 remaining) [2024-11-09 07:52:36,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (12 of 25 remaining) [2024-11-09 07:52:36,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (11 of 25 remaining) [2024-11-09 07:52:36,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (10 of 25 remaining) [2024-11-09 07:52:36,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (9 of 25 remaining) [2024-11-09 07:52:36,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (8 of 25 remaining) [2024-11-09 07:52:36,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (7 of 25 remaining) [2024-11-09 07:52:36,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (6 of 25 remaining) [2024-11-09 07:52:36,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 25 remaining) [2024-11-09 07:52:36,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 25 remaining) [2024-11-09 07:52:36,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 25 remaining) [2024-11-09 07:52:36,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 25 remaining) [2024-11-09 07:52:36,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 25 remaining) [2024-11-09 07:52:36,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 25 remaining) [2024-11-09 07:52:36,366 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 (28)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:36,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-09 07:52:36,559 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:36,597 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:52:36,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:52:36 BoogieIcfgContainer [2024-11-09 07:52:36,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:52:36,599 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:52:36,599 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:52:36,600 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:52:36,600 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:52:19" (3/4) ... [2024-11-09 07:52:36,602 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 07:52:36,603 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:52:36,603 INFO L158 Benchmark]: Toolchain (without parser) took 18082.15ms. Allocated memory was 69.2MB in the beginning and 136.3MB in the end (delta: 67.1MB). Free memory was 47.3MB in the beginning and 83.2MB in the end (delta: -35.9MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-11-09 07:52:36,603 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 69.2MB. Free memory was 49.6MB in the beginning and 49.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:52:36,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.06ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 47.1MB in the beginning and 61.2MB in the end (delta: -14.1MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-09 07:52:36,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.68ms. Allocated memory is still 94.4MB. Free memory was 61.2MB in the beginning and 58.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:52:36,606 INFO L158 Benchmark]: Boogie Preprocessor took 73.87ms. Allocated memory is still 94.4MB. Free memory was 58.3MB in the beginning and 54.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:52:36,606 INFO L158 Benchmark]: RCFGBuilder took 563.10ms. Allocated memory is still 94.4MB. Free memory was 54.1MB in the beginning and 49.6MB in the end (delta: 4.5MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-11-09 07:52:36,606 INFO L158 Benchmark]: TraceAbstraction took 16855.36ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 49.1MB in the beginning and 83.2MB in the end (delta: -34.1MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-11-09 07:52:36,606 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 136.3MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:52:36,607 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.77ms. Allocated memory is still 69.2MB. Free memory was 49.6MB in the beginning and 49.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.06ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 47.1MB in the beginning and 61.2MB in the end (delta: -14.1MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.68ms. Allocated memory is still 94.4MB. Free memory was 61.2MB in the beginning and 58.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.87ms. Allocated memory is still 94.4MB. Free memory was 58.3MB in the beginning and 54.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 563.10ms. Allocated memory is still 94.4MB. Free memory was 54.1MB in the beginning and 49.6MB in the end (delta: 4.5MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16855.36ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 49.1MB in the beginning and 83.2MB in the end (delta: -34.1MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 136.3MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 769. 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) }; VAL [ldv_global_msg_list={1:0}] [L770] CALL entry_point() [L764] struct ldv_kobject *kobj; [L765] CALL, EXPR ldv_kobject_create() [L740] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={1:0}] [L741] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L741] RET, EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_global_msg_list={1:0}] [L741] kobj = ldv_malloc(sizeof(*kobj)) [L742] COND FALSE !(!kobj) [L744] FCALL memset(kobj, 0, sizeof(*kobj)) [L745] CALL ldv_kobject_init(kobj) [L730] COND FALSE !(!kobj) [L733] CALL ldv_kobject_init_internal(kobj) [L723] COND FALSE !(!kobj) [L725] CALL ldv_kref_init(&kobj->kref) [L682] ((&kref->refcount)->counter) = (1) VAL [ldv_global_msg_list={1:0}] [L725] RET ldv_kref_init(&kobj->kref) [L726] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [\old(list)={2:4}, ldv_global_msg_list={1:0}] [L540] list->next = list VAL [\old(list)={2:4}, ldv_global_msg_list={1:0}, list={2:4}] [L541] list->prev = list VAL [\old(list)={2:4}, ldv_global_msg_list={1:0}] [L726] RET LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={2:0}, ldv_global_msg_list={1:0}] [L733] RET ldv_kobject_init_internal(kobj) [L745] RET ldv_kobject_init(kobj) [L746] return kobj; VAL [\result={2:0}, ldv_global_msg_list={1:0}] [L765] RET, EXPR ldv_kobject_create() [L765] kobj = ldv_kobject_create() [L766] CALL f_22_get(kobj) [L758] CALL ldv_kobject_get(kobj) [L717] COND TRUE \read(*kobj) [L718] CALL ldv_kref_get(&kobj->kref) [L686] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L657] int temp; VAL [i=1, ldv_global_msg_list={1:0}, v={2:12}] [L658] EXPR v->counter VAL [ldv_global_msg_list={1:0}] [L658] temp = v->counter [L659] temp += i VAL [ldv_global_msg_list={1:0}, temp=2, v={2:12}] [L660] v->counter = temp VAL [ldv_global_msg_list={1:0}] [L661] return temp; VAL [ldv_global_msg_list={1:0}] [L686] RET ldv_atomic_add_return(1, (&kref->refcount)) [L718] RET ldv_kref_get(&kobj->kref) [L719] return kobj; VAL [ldv_global_msg_list={1:0}] [L758] RET ldv_kobject_get(kobj) [L766] RET f_22_get(kobj) [L767] CALL ldv_kobject_put(kobj) VAL [ldv_global_msg_list={1:0}] [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL, EXPR ldv_kref_sub(kref, 1, release) [L674] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [i=1, ldv_global_msg_list={1:0}, v={2:12}] [L666] EXPR v->counter VAL [\old(kobj)={2:0}, ldv_global_msg_list={1:0}] [L666] temp = v->counter [L667] temp -= i VAL [ldv_global_msg_list={1:0}, temp=1, v={2:12}] [L668] v->counter = temp VAL [\old(kobj)={2:0}, ldv_global_msg_list={1:0}] [L669] return temp; VAL [\result=1, ldv_global_msg_list={1:0}] [L674] RET, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L674] COND FALSE !((ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0)) [L678] return 0; VAL [\result=0, kref={2:12}, ldv_global_msg_list={1:0}, release={-1:0}] [L690] RET, EXPR ldv_kref_sub(kref, 1, release) [L690] return ldv_kref_sub(kref, 1, release); [L712] RET ldv_kref_put(&kobj->kref, ldv_kobject_release) [L767] RET ldv_kobject_put(kobj) VAL [kobj={2:0}, ldv_global_msg_list={1:0}] [L770] 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: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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 4 procedures, 90 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 27, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 524 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 515 mSDsluCounter, 11297 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9360 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3330 IncrementalHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 1937 mSDtfsCounter, 3330 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 942 GetRequests, 708 SyntacticMatches, 7 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=10, InterpolantAutomatonStates: 226, 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, 26 MinimizatonAttempts, 46 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 928 NumberOfCodeBlocks, 898 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 897 ConstructedInterpolants, 35 QuantifiedInterpolants, 4875 SizeOfPredicates, 50 NumberOfNonLiveVariables, 5331 ConjunctsInSsa, 368 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 1833/1965 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-09 07:52:36,632 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