./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test14_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc 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_test14_2.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 d789cb2558e3de4d1d16c03a2a21714577a96d35a26f84712733ec2a50aa0d89 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:47:19,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:47:19,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:47:19,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:47:19,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:47:19,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:47:19,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:47:19,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:47:19,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:47:19,385 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:47:19,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:47:19,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:47:19,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:47:19,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:47:19,389 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:47:19,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:47:19,389 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:47:19,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:47:19,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:47:19,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:47:19,391 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:47:19,393 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:47:19,394 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:47:19,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:47:19,394 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:47:19,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:47:19,395 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:47:19,395 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:47:19,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:47:19,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:47:19,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:47:19,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:47:19,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:47:19,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:47:19,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:47:19,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:47:19,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:47:19,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:47:19,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:47:19,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:47:19,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:47:19,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:47:19,400 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 -> d789cb2558e3de4d1d16c03a2a21714577a96d35a26f84712733ec2a50aa0d89 [2024-11-19 06:47:19,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:47:19,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:47:19,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:47:19,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:47:19,661 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:47:19,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14_2.i [2024-11-19 06:47:21,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:47:21,410 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:47:21,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14_2.i [2024-11-19 06:47:21,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f34016f1/212c66a193e94efa90ac7a5eb8ad0888/FLAGc3cd732aa [2024-11-19 06:47:21,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f34016f1/212c66a193e94efa90ac7a5eb8ad0888 [2024-11-19 06:47:21,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:47:21,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:47:21,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:47:21,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:47:21,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:47:21,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:21" (1/1) ... [2024-11-19 06:47:21,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e729b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:21, skipping insertion in model container [2024-11-19 06:47:21,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:21" (1/1) ... [2024-11-19 06:47:21,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:47:21,873 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-19 06:47:21,925 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-19 06:47:21,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:47:21,956 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-19 06:47:21,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@38b72ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:21, skipping insertion in model container [2024-11-19 06:47:21,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:47:21,957 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:47:21,959 INFO L158 Benchmark]: Toolchain (without parser) took 508.49ms. Allocated memory is still 157.3MB. Free memory was 89.1MB in the beginning and 119.6MB in the end (delta: -30.6MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-11-19 06:47:21,959 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory was 119.5MB in the beginning and 119.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:47:21,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.09ms. Allocated memory is still 157.3MB. Free memory was 88.9MB in the beginning and 119.6MB in the end (delta: -30.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-11-19 06:47:21,961 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.19ms. Allocated memory is still 157.3MB. Free memory was 119.5MB in the beginning and 119.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 506.09ms. Allocated memory is still 157.3MB. Free memory was 88.9MB in the beginning and 119.6MB in the end (delta: -30.7MB). Peak memory consumption was 8.9MB. 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_test14_2.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 d789cb2558e3de4d1d16c03a2a21714577a96d35a26f84712733ec2a50aa0d89 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:47:23,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:47:24,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 06:47:24,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:47:24,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:47:24,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:47:24,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:47:24,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:47:24,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:47:24,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:47:24,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:47:24,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:47:24,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:47:24,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:47:24,068 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:47:24,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:47:24,070 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:47:24,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:47:24,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:47:24,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:47:24,074 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:47:24,074 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:47:24,074 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:47:24,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:47:24,075 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:47:24,075 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:47:24,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:47:24,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:47:24,077 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:47:24,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:47:24,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:47:24,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:47:24,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:47:24,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:47:24,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:47:24,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:47:24,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:47:24,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:47:24,080 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:47:24,080 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:47:24,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:47:24,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:47:24,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:47:24,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:47:24,082 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 -> d789cb2558e3de4d1d16c03a2a21714577a96d35a26f84712733ec2a50aa0d89 [2024-11-19 06:47:24,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:47:24,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:47:24,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:47:24,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:47:24,437 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:47:24,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14_2.i [2024-11-19 06:47:25,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:47:26,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:47:26,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14_2.i [2024-11-19 06:47:26,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cff7e8eb/ba2a8e469c214099807090247f890cef/FLAG3af20a477 [2024-11-19 06:47:26,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cff7e8eb/ba2a8e469c214099807090247f890cef [2024-11-19 06:47:26,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:47:26,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:47:26,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:47:26,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:47:26,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:47:26,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:26" (1/1) ... [2024-11-19 06:47:26,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a39bcc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26, skipping insertion in model container [2024-11-19 06:47:26,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:26" (1/1) ... [2024-11-19 06:47:26,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:47:26,703 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-19 06:47:26,772 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-19 06:47:26,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:47:26,808 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:47:26,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:47:26,856 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-19 06:47:26,879 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-19 06:47:26,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:47:26,907 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:47:26,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:47:27,014 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:47:27,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27 WrapperNode [2024-11-19 06:47:27,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:47:27,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:47:27,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:47:27,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:47:27,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2024-11-19 06:47:27,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2024-11-19 06:47:27,086 INFO L138 Inliner]: procedures = 168, calls = 79, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 63 [2024-11-19 06:47:27,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:47:27,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:47:27,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:47:27,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:47:27,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2024-11-19 06:47:27,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2024-11-19 06:47:27,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2024-11-19 06:47:27,131 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 6 writes are split as follows [0, 6]. [2024-11-19 06:47:27,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2024-11-19 06:47:27,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2024-11-19 06:47:27,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2024-11-19 06:47:27,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2024-11-19 06:47:27,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2024-11-19 06:47:27,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2024-11-19 06:47:27,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:47:27,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:47:27,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:47:27,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:47:27,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (1/1) ... [2024-11-19 06:47:27,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:47:27,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:47:27,204 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-19 06:47:27,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-19 06:47:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-19 06:47:27,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-19 06:47:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-19 06:47:27,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-19 06:47:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-19 06:47:27,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-19 06:47:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:47:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:47:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:47:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:47:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:47:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:47:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:47:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:47:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:47:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:47:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-19 06:47:27,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-19 06:47:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:47:27,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:47:27,440 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:47:27,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:47:27,819 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2024-11-19 06:47:27,819 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:47:27,837 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:47:27,838 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 06:47:27,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:27 BoogieIcfgContainer [2024-11-19 06:47:27,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:47:27,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:47:27,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:47:27,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:47:27,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:47:26" (1/3) ... [2024-11-19 06:47:27,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130dd442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:27, skipping insertion in model container [2024-11-19 06:47:27,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:27" (2/3) ... [2024-11-19 06:47:27,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130dd442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:27, skipping insertion in model container [2024-11-19 06:47:27,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:27" (3/3) ... [2024-11-19 06:47:27,849 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test14_2.i [2024-11-19 06:47:27,866 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:47:27,866 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-19 06:47:27,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:47:27,927 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;@5f72b9c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:47:27,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-19 06:47:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 38 states have (on average 1.763157894736842) internal successors, (67), 64 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:47:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:47:27,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:27,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:27,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-19 06:47:27,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:27,949 INFO L85 PathProgramCache]: Analyzing trace with hash -170098641, now seen corresponding path program 1 times [2024-11-19 06:47:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:27,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625856160] [2024-11-19 06:47:27,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:27,964 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-19 06:47:27,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:27,967 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-19 06:47:27,969 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-19 06:47:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:28,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 06:47:28,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:28,184 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-19 06:47:28,242 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-11-19 06:47:28,282 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 06:47:28,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-19 06:47:28,342 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-19 06:47:28,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:28,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:28,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625856160] [2024-11-19 06:47:28,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625856160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:28,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:28,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:47:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126631739] [2024-11-19 06:47:28,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:28,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:47:28,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:28,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:47:28,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2024-11-19 06:47:28,385 INFO L87 Difference]: Start difference. First operand has 72 states, 38 states have (on average 1.763157894736842) internal successors, (67), 64 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:28,721 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2024-11-19 06:47:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:47:28,724 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:47:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:28,731 INFO L225 Difference]: With dead ends: 73 [2024-11-19 06:47:28,731 INFO L226 Difference]: Without dead ends: 71 [2024-11-19 06:47:28,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2024-11-19 06:47:28,738 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:28,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 102 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 203 Invalid, 0 Unknown, 81 Unchecked, 0.3s Time] [2024-11-19 06:47:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-19 06:47:28,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-19 06:47:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 61 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:47:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2024-11-19 06:47:28,778 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 12 [2024-11-19 06:47:28,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:28,778 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2024-11-19 06:47:28,779 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, (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-19 06:47:28,779 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2024-11-19 06:47:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:47:28,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:28,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:28,784 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-19 06:47:28,981 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-19 06:47:28,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-19 06:47:28,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:28,982 INFO L85 PathProgramCache]: Analyzing trace with hash -170098640, now seen corresponding path program 1 times [2024-11-19 06:47:28,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:28,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036709900] [2024-11-19 06:47:28,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:28,983 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-19 06:47:28,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:28,996 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-19 06:47:29,000 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-19 06:47:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:29,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 06:47:29,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:29,116 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-19 06:47:29,124 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-19 06:47:29,194 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-19 06:47:29,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:47:29,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:47:29,310 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:29,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:47:29,423 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-19 06:47:29,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:29,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:29,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036709900] [2024-11-19 06:47:29,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036709900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:29,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:29,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:47:29,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291839391] [2024-11-19 06:47:29,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:29,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:47:29,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:29,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:47:29,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-19 06:47:29,429 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:29,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:29,838 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-11-19 06:47:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:47:29,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:47:29,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:29,840 INFO L225 Difference]: With dead ends: 74 [2024-11-19 06:47:29,841 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 06:47:29,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2024-11-19 06:47:29,842 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 47 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:29,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 130 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 252 Invalid, 0 Unknown, 86 Unchecked, 0.4s Time] [2024-11-19 06:47:29,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 06:47:29,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-11-19 06:47:29,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 60 states have internal predecessors, (62), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:47:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2024-11-19 06:47:29,852 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 12 [2024-11-19 06:47:29,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:29,852 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-11-19 06:47:29,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:29,853 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2024-11-19 06:47:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:47:29,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:29,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:29,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:47:30,056 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-19 06:47:30,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-19 06:47:30,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:30,057 INFO L85 PathProgramCache]: Analyzing trace with hash -5485290, now seen corresponding path program 1 times [2024-11-19 06:47:30,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:30,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320020455] [2024-11-19 06:47:30,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:30,058 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-19 06:47:30,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:30,061 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-19 06:47:30,063 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-19 06:47:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:30,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:47:30,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:30,165 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-19 06:47:30,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:30,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:30,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320020455] [2024-11-19 06:47:30,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320020455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:30,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:30,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:47:30,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34022947] [2024-11-19 06:47:30,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:30,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:47:30,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:30,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:47:30,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:30,168 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:30,208 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-11-19 06:47:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:47:30,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-19 06:47:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:30,209 INFO L225 Difference]: With dead ends: 74 [2024-11-19 06:47:30,209 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 06:47:30,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:30,211 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:30,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 267 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:47:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 06:47:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-11-19 06:47:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.625) internal successors, (65), 63 states have internal predecessors, (65), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:47:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2024-11-19 06:47:30,219 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 11 [2024-11-19 06:47:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:30,219 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2024-11-19 06:47:30,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:30,221 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2024-11-19 06:47:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:47:30,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:30,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:30,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:30,422 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-19 06:47:30,423 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-19 06:47:30,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash 882018391, now seen corresponding path program 1 times [2024-11-19 06:47:30,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:30,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630957357] [2024-11-19 06:47:30,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:30,427 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-19 06:47:30,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:30,430 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-19 06:47:30,431 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-19 06:47:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:30,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:47:30,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:30,504 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-19 06:47:30,555 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-19 06:47:30,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:30,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630957357] [2024-11-19 06:47:30,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630957357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:30,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:30,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:47:30,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347677709] [2024-11-19 06:47:30,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:30,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:47:30,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:30,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:47:30,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:30,557 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:30,811 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-19 06:47:30,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:47:30,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-19 06:47:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:30,812 INFO L225 Difference]: With dead ends: 89 [2024-11-19 06:47:30,812 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 06:47:30,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:47:30,813 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 74 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:30,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 66 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:47:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 06:47:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2024-11-19 06:47:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.619047619047619) internal successors, (68), 65 states have internal predecessors, (68), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-11-19 06:47:30,820 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 11 [2024-11-19 06:47:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:30,821 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-19 06:47:30,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-11-19 06:47:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:47:30,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:30,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:30,825 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-19 06:47:31,022 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-19 06:47:31,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-19 06:47:31,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:31,023 INFO L85 PathProgramCache]: Analyzing trace with hash 882018392, now seen corresponding path program 1 times [2024-11-19 06:47:31,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:31,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212037056] [2024-11-19 06:47:31,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:31,024 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-19 06:47:31,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:31,027 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-19 06:47:31,029 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-19 06:47:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:31,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:47:31,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:31,100 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-19 06:47:31,180 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-19 06:47:31,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:31,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:31,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212037056] [2024-11-19 06:47:31,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212037056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:31,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:31,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:47:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818896208] [2024-11-19 06:47:31,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:31,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:47:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:31,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:47:31,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:31,183 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:31,423 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-11-19 06:47:31,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:47:31,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-19 06:47:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:31,424 INFO L225 Difference]: With dead ends: 87 [2024-11-19 06:47:31,425 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 06:47:31,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:31,425 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 48 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:31,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 79 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:47:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 06:47:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2024-11-19 06:47:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 65 states have internal predecessors, (67), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-19 06:47:31,435 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 11 [2024-11-19 06:47:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:31,435 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-19 06:47:31,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-19 06:47:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:47:31,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:31,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:31,440 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-19 06:47:31,639 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-19 06:47:31,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-19 06:47:31,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash 652852718, now seen corresponding path program 1 times [2024-11-19 06:47:31,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:31,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097151817] [2024-11-19 06:47:31,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:31,641 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-19 06:47:31,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:31,642 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-19 06:47:31,643 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-19 06:47:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:31,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 06:47:31,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:35,739 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|) |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|)) is different from true [2024-11-19 06:47:35,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:47:35,854 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-19 06:47:35,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:35,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:35,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097151817] [2024-11-19 06:47:35,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097151817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:35,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:35,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:47:35,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551555683] [2024-11-19 06:47:35,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:35,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:47:35,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:35,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:47:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=44, Unknown=1, NotChecked=12, Total=72 [2024-11-19 06:47:35,856 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:36,109 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-11-19 06:47:36,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:47:36,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 06:47:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:36,110 INFO L225 Difference]: With dead ends: 75 [2024-11-19 06:47:36,110 INFO L226 Difference]: Without dead ends: 75 [2024-11-19 06:47:36,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-19 06:47:36,111 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 20 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:36,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 277 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 98 Unchecked, 0.2s Time] [2024-11-19 06:47:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-19 06:47:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-19 06:47:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 64 states have internal predecessors, (66), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-11-19 06:47:36,116 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 15 [2024-11-19 06:47:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:36,116 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-11-19 06:47:36,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-11-19 06:47:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:47:36,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:36,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:36,124 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-19 06:47:36,318 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-19 06:47:36,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-19 06:47:36,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:36,319 INFO L85 PathProgramCache]: Analyzing trace with hash 652852719, now seen corresponding path program 1 times [2024-11-19 06:47:36,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:36,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620337036] [2024-11-19 06:47:36,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:36,319 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-19 06:47:36,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:36,321 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-19 06:47:36,322 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-19 06:47:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:36,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 06:47:36,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:36,417 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-19 06:47:36,427 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-19 06:47:36,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:47:36,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-19 06:47:36,554 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) (exists ((|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)))))) is different from true [2024-11-19 06:47:36,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:47:36,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:47:36,631 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:36,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:47:36,858 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:47:36,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 06:47:36,865 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:47:36,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:47:36,944 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-19 06:47:36,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:36,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620337036] [2024-11-19 06:47:36,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620337036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:36,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:36,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:47:36,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270022084] [2024-11-19 06:47:36,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:36,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:47:36,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:36,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:47:36,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=73, Unknown=1, NotChecked=16, Total=110 [2024-11-19 06:47:36,946 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:37,676 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-11-19 06:47:37,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:47:37,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 06:47:37,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:37,678 INFO L225 Difference]: With dead ends: 74 [2024-11-19 06:47:37,678 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 06:47:37,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=165, Unknown=1, NotChecked=26, Total=240 [2024-11-19 06:47:37,679 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 29 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:37,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 279 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 247 Invalid, 0 Unknown, 89 Unchecked, 0.5s Time] [2024-11-19 06:47:37,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 06:47:37,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-19 06:47:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 63 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-11-19 06:47:37,684 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 15 [2024-11-19 06:47:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:37,684 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-11-19 06:47:37,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-11-19 06:47:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:47:37,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:37,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:37,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 06:47:37,890 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-19 06:47:37,891 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-19 06:47:37,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:37,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1511117400, now seen corresponding path program 1 times [2024-11-19 06:47:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:37,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801927574] [2024-11-19 06:47:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:37,892 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-19 06:47:37,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:37,893 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-19 06:47:37,894 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-19 06:47:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:37,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:47:37,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:37,959 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-19 06:47:37,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:47:38,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:47:38,098 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-19 06:47:38,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:38,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:38,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801927574] [2024-11-19 06:47:38,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801927574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:38,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:38,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:47:38,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911624398] [2024-11-19 06:47:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:38,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:47:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:38,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:47:38,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:47:38,100 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:42,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:47:46,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:47:50,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:47:54,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:47:58,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:02,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:06,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:10,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:14,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:18,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:22,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:26,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:30,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:34,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:38,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:42,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:46,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:50,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:54,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:58,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:49:02,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]