./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_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-?-c7c6ca5-m [2024-11-09 07:49:43,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:49:43,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:49:43,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:49:43,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:49:43,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:49:43,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:49:43,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:49:43,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:49:43,298 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:49:43,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:49:43,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:49:43,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:49:43,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:49:43,300 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:49:43,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:49:43,303 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:49:43,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:49:43,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:49:43,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:49:43,304 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:49:43,305 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:49:43,305 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:49:43,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:49:43,306 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:49:43,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:49:43,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:49:43,306 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:49:43,306 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:49:43,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:49:43,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:49:43,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:49:43,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:49:43,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:49:43,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:49:43,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:49:43,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:49:43,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:49:43,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:49:43,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:49:43,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:49:43,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:49:43,312 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-09 07:49:43,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:49:43,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:49:43,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:49:43,584 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:49:43,585 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:49:43,586 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-09 07:49:45,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:49:45,307 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:49:45,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14_2.i [2024-11-09 07:49:45,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b175b4657/8cfc0078558044cc8745368fd3b4047a/FLAGe10350f71 [2024-11-09 07:49:45,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b175b4657/8cfc0078558044cc8745368fd3b4047a [2024-11-09 07:49:45,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:49:45,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:49:45,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:49:45,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:49:45,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:49:45,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:45" (1/1) ... [2024-11-09 07:49:45,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23346fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:45, skipping insertion in model container [2024-11-09 07:49:45,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:45" (1/1) ... [2024-11-09 07:49:45,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:49:46,049 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:46,092 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:46,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:49:46,117 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-09 07:49:46,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7c7e6275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:46, skipping insertion in model container [2024-11-09 07:49:46,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:49:46,118 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:49:46,120 INFO L158 Benchmark]: Toolchain (without parser) took 472.58ms. Allocated memory is still 165.7MB. Free memory was 95.1MB in the beginning and 126.3MB in the end (delta: -31.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 07:49:46,120 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:49:46,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.51ms. Allocated memory is still 165.7MB. Free memory was 94.8MB in the beginning and 126.3MB in the end (delta: -31.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 07:49:46,123 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.51ms. Allocated memory is still 165.7MB. Free memory was 94.8MB in the beginning and 126.3MB in the end (delta: -31.5MB). Peak memory consumption was 6.3MB. 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-?-c7c6ca5-m [2024-11-09 07:49:48,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:49:48,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 07:49:48,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:49:48,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:49:48,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:49:48,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:49:48,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:49:48,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:49:48,244 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:49:48,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:49:48,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:49:48,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:49:48,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:49:48,248 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:49:48,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:49:48,248 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:49:48,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:49:48,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:49:48,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:49:48,253 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:49:48,254 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:49:48,254 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:49:48,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:49:48,254 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:49:48,254 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:49:48,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:49:48,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:49:48,255 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:49:48,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:49:48,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:49:48,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:49:48,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:49:48,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:49:48,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:49:48,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:49:48,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:49:48,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:49:48,258 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:49:48,259 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:48,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:49:48,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:49:48,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:49:48,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:49:48,261 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-09 07:49:48,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:49:48,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:49:48,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:49:48,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:49:48,616 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:49:48,617 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-09 07:49:50,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:49:50,511 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:49:50,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14_2.i [2024-11-09 07:49:50,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5268fb4e3/eefb7ca6512a47658d97572b7ca33639/FLAGdabe33fad [2024-11-09 07:49:50,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5268fb4e3/eefb7ca6512a47658d97572b7ca33639 [2024-11-09 07:49:50,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:49:50,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:49:50,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:49:50,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:49:50,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:49:50,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:50" (1/1) ... [2024-11-09 07:49:50,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2292870b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:50, skipping insertion in model container [2024-11-09 07:49:50,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:50" (1/1) ... [2024-11-09 07:49:50,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:49:50,911 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:50,972 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:50,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:49:51,011 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:49:51,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:49:51,044 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:51,065 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:51,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:49:51,076 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:49:51,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:49:51,182 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:49:51,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51 WrapperNode [2024-11-09 07:49:51,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:49:51,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:49:51,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:49:51,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:49:51,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 07:49:51,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 07:49:51,243 INFO L138 Inliner]: procedures = 168, calls = 79, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 63 [2024-11-09 07:49:51,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:49:51,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:49:51,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:49:51,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:49:51,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 07:49:51,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 07:49:51,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 07:49:51,292 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [14, 2]. 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 [6, 0]. [2024-11-09 07:49:51,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 07:49:51,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 07:49:51,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 07:49:51,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 07:49:51,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 07:49:51,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 07:49:51,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:49:51,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:49:51,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:49:51,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:49:51,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 07:49:51,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:49:51,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:49:51,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:49:51,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:49:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-09 07:49:51,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-09 07:49:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 07:49:51,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 07:49:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-09 07:49:51,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-09 07:49:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:49:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:49:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:49:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:49:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:49:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:49:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:49:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:49:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:49:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:49:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-09 07:49:51,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-09 07:49:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:49:51,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:49:51,530 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:49:51,533 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:49:51,928 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2024-11-09 07:49:51,928 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:49:51,946 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:49:51,946 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:49:51,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:49:51 BoogieIcfgContainer [2024-11-09 07:49:51,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:49:51,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:49:51,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:49:51,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:49:51,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:49:50" (1/3) ... [2024-11-09 07:49:51,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a5d247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:49:51, skipping insertion in model container [2024-11-09 07:49:51,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (2/3) ... [2024-11-09 07:49:51,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a5d247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:49:51, skipping insertion in model container [2024-11-09 07:49:51,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:49:51" (3/3) ... [2024-11-09 07:49:51,959 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test14_2.i [2024-11-09 07:49:51,976 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:49:51,977 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-09 07:49:52,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:49:52,036 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;@22f72100, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:49:52,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-09 07:49:52,039 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-09 07:49:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:49:52,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:52,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:52,047 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-09 07:49:52,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash -170098641, now seen corresponding path program 1 times [2024-11-09 07:49:52,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:52,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240136472] [2024-11-09 07:49:52,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:52,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:52,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:52,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:52,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 (2)] Waiting until timeout for monitored process [2024-11-09 07:49:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:52,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:49:52,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:52,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:49:52,314 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-09 07:49:52,355 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:49:52,355 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-09 07:49:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:52,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:52,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:52,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240136472] [2024-11-09 07:49:52,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240136472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:52,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:52,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:49:52,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54302844] [2024-11-09 07:49:52,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:52,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:49:52,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:52,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:49:52,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2024-11-09 07:49:52,450 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-09 07:49:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:52,835 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2024-11-09 07:49:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:49:52,838 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-09 07:49:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:52,845 INFO L225 Difference]: With dead ends: 73 [2024-11-09 07:49:52,845 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 07:49:52,846 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-09 07:49:52,850 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-09 07:49:52,851 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-09 07:49:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 07:49:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-09 07:49:52,894 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-09 07:49:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2024-11-09 07:49:52,896 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 12 [2024-11-09 07:49:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:52,897 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2024-11-09 07:49:52,897 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-09 07:49:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2024-11-09 07:49:52,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:49:52,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:52,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:52,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 07:49:53,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:53,106 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-09 07:49:53,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:53,107 INFO L85 PathProgramCache]: Analyzing trace with hash -170098640, now seen corresponding path program 1 times [2024-11-09 07:49:53,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:53,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286411383] [2024-11-09 07:49:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:53,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:53,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:53,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:53,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 07:49:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:53,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 07:49:53,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:53,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:49:53,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:49:53,300 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-09 07:49:53,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:53,390 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-09 07:49:53,441 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:49:53,441 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-09 07:49:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:53,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:53,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:53,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286411383] [2024-11-09 07:49:53,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286411383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:53,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:53,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:49:53,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505164763] [2024-11-09 07:49:53,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:53,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:49:53,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:53,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:49:53,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-09 07:49:53,522 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-09 07:49:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:53,907 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-11-09 07:49:53,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:49:53,907 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-09 07:49:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:53,909 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:49:53,909 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 07:49:53,909 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-09 07:49:53,910 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:53,911 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.3s Time] [2024-11-09 07:49:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 07:49:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-11-09 07:49:53,920 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-09 07:49:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2024-11-09 07:49:53,921 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 12 [2024-11-09 07:49:53,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:53,922 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-11-09 07:49:53,922 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-09 07:49:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2024-11-09 07:49:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:49:53,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:53,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:53,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:54,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:54,124 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-09 07:49:54,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash -5485290, now seen corresponding path program 1 times [2024-11-09 07:49:54,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:54,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311071407] [2024-11-09 07:49:54,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:54,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:54,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:54,129 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:54,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 07:49:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:54,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:49:54,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:54,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:54,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:54,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311071407] [2024-11-09 07:49:54,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311071407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:54,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:54,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:49:54,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930521588] [2024-11-09 07:49:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:54,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:49:54,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:54,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:49:54,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:54,220 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-09 07:49:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:54,251 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-11-09 07:49:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:49:54,252 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-09 07:49:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:54,253 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:49:54,254 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 07:49:54,255 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-09 07:49:54,256 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-09 07:49:54,256 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-09 07:49:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 07:49:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-11-09 07:49:54,267 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-09 07:49:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2024-11-09 07:49:54,271 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 11 [2024-11-09 07:49:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:54,272 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2024-11-09 07:49:54,272 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-09 07:49:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2024-11-09 07:49:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:49:54,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:54,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:54,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 07:49:54,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:54,474 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-09 07:49:54,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:54,474 INFO L85 PathProgramCache]: Analyzing trace with hash 882018391, now seen corresponding path program 1 times [2024-11-09 07:49:54,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:54,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039483276] [2024-11-09 07:49:54,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:54,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:54,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:54,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:54,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 07:49:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:54,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:49:54,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:54,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:49:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:54,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:54,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:54,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039483276] [2024-11-09 07:49:54,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039483276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:54,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:54,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:49:54,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482899811] [2024-11-09 07:49:54,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:54,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:49:54,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:54,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:49:54,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:54,627 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-09 07:49:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:54,901 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-09 07:49:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:49:54,902 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-09 07:49:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:54,903 INFO L225 Difference]: With dead ends: 89 [2024-11-09 07:49:54,903 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 07:49:54,903 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-09 07:49:54,904 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:54,904 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.3s Time] [2024-11-09 07:49:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 07:49:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2024-11-09 07:49:54,919 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-09 07:49:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-11-09 07:49:54,922 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 11 [2024-11-09 07:49:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:54,923 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-09 07:49:54,923 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-09 07:49:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-11-09 07:49:54,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:49:54,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:54,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:54,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:55,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:55,125 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-09 07:49:55,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:55,125 INFO L85 PathProgramCache]: Analyzing trace with hash 882018392, now seen corresponding path program 1 times [2024-11-09 07:49:55,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:55,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317191323] [2024-11-09 07:49:55,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:55,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:55,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:55,128 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:55,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 07:49:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:55,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:49:55,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:55,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:49:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:55,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:55,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:55,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317191323] [2024-11-09 07:49:55,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317191323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:55,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:55,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:49:55,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497001183] [2024-11-09 07:49:55,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:55,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:49:55,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:55,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:49:55,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:55,280 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-09 07:49:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:55,550 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-11-09 07:49:55,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:49:55,550 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-09 07:49:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:55,551 INFO L225 Difference]: With dead ends: 87 [2024-11-09 07:49:55,551 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 07:49:55,551 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-09 07:49:55,552 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:55,553 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.3s Time] [2024-11-09 07:49:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 07:49:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2024-11-09 07:49:55,558 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-09 07:49:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-09 07:49:55,559 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 11 [2024-11-09 07:49:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:55,559 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-09 07:49:55,559 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-09 07:49:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-09 07:49:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:49:55,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:55,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:55,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 07:49:55,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:55,761 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-09 07:49:55,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash 652852718, now seen corresponding path program 1 times [2024-11-09 07:49:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064287617] [2024-11-09 07:49:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:55,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:55,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:55,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:55,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 07:49:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:55,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:49:55,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:59,874 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))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|))) is different from true [2024-11-09 07:49:59,937 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-09 07:49:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:59,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:59,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:59,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064287617] [2024-11-09 07:49:59,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064287617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:59,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:59,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:49:59,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317005373] [2024-11-09 07:49:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:59,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:49:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:59,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:49:59,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=44, Unknown=1, NotChecked=12, Total=72 [2024-11-09 07:49:59,986 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-09 07:50:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:00,258 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-11-09 07:50:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:50:00,258 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-09 07:50:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:00,259 INFO L225 Difference]: With dead ends: 75 [2024-11-09 07:50:00,259 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 07:50:00,260 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-09 07:50:00,261 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-09 07:50:00,261 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-09 07:50:00,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 07:50:00,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-09 07:50:00,268 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-09 07:50:00,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-11-09 07:50:00,269 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 15 [2024-11-09 07:50:00,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:00,269 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-11-09 07:50:00,269 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-09 07:50:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-11-09 07:50:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:50:00,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:00,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:00,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 07:50:00,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:50:00,470 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-09 07:50:00,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:00,471 INFO L85 PathProgramCache]: Analyzing trace with hash 652852719, now seen corresponding path program 1 times [2024-11-09 07:50:00,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:00,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158913124] [2024-11-09 07:50:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:00,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:50:00,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:00,473 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:50:00,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 07:50:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:00,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:50:00,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:00,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:50:00,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:50:00,625 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-09 07:50:00,631 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-09 07:50:00,704 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 (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)))))) is different from true [2024-11-09 07:50:00,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:50:00,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:50:00,784 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:50:00,784 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-09 07:50:01,044 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:50:01,044 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-09 07:50:01,054 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:50:01,055 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-09 07:50:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:01,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:01,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:01,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158913124] [2024-11-09 07:50:01,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158913124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:01,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:01,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:50:01,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392149424] [2024-11-09 07:50:01,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:01,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:50:01,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:01,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:50:01,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=73, Unknown=1, NotChecked=16, Total=110 [2024-11-09 07:50:01,147 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-09 07:50:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:01,931 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-11-09 07:50:01,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:50:01,932 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-09 07:50:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:01,933 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:50:01,933 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 07:50:01,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=165, Unknown=1, NotChecked=26, Total=240 [2024-11-09 07:50:01,934 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 29 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-09 07:50:01,934 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-09 07:50:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 07:50:01,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-09 07:50:01,938 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-09 07:50:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-11-09 07:50:01,939 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 15 [2024-11-09 07:50:01,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:01,939 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-11-09 07:50:01,939 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-09 07:50:01,939 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-11-09 07:50:01,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:50:01,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:01,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:01,948 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-09 07:50:02,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:50:02,141 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-09 07:50:02,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:02,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1511117400, now seen corresponding path program 1 times [2024-11-09 07:50:02,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:02,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974930433] [2024-11-09 07:50:02,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:02,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:50:02,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:02,145 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:50:02,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 07:50:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:02,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:50:02,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:02,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:50:02,231 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-09 07:50:02,344 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-09 07:50:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:02,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:02,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:02,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974930433] [2024-11-09 07:50:02,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974930433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:02,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:02,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:50:02,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023839732] [2024-11-09 07:50:02,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:02,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:50:02,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:02,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:50:02,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:50:02,372 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-09 07:50:06,416 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-09 07:50:10,431 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-09 07:50:14,468 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-09 07:50:18,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-09 07:50:22,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-09 07:50:26,533 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-09 07:50:30,547 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-09 07:50:34,570 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-09 07:50:38,580 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-09 07:50:42,590 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-09 07:50:46,606 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-09 07:50:50,615 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-09 07:50:54,787 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-09 07:50:58,799 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-09 07:51:02,806 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-09 07:51:06,835 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-09 07:51:10,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:51:14,866 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-09 07:51:18,880 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-09 07:51:22,901 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]