./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:48:28,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:48:28,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:48:28,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:48:28,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:48:28,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:48:28,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:48:28,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:48:28,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:48:28,417 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:48:28,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:48:28,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:48:28,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:48:28,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:48:28,419 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:48:28,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:48:28,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:48:28,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:48:28,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:48:28,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:48:28,421 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:48:28,422 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:48:28,422 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:48:28,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:48:28,423 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:48:28,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:48:28,423 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:48:28,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:48:28,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:48:28,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:48:28,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:48:28,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:48:28,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:48:28,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:48:28,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:48:28,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:48:28,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:48:28,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:48:28,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:48:28,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:48:28,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:48:28,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:48:28,428 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 -> aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd [2024-10-13 10:48:28,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:48:28,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:48:28,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:48:28,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:48:28,687 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:48:28,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2024-10-13 10:48:30,127 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:48:30,386 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:48:30,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2024-10-13 10:48:30,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dfd4e044/b1cd35646f0a49418cd217983356e073/FLAGc9ee9d31d [2024-10-13 10:48:30,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dfd4e044/b1cd35646f0a49418cd217983356e073 [2024-10-13 10:48:30,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:48:30,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:48:30,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:48:30,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:48:30,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:48:30,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:48:30" (1/1) ... [2024-10-13 10:48:30,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55725372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:30, skipping insertion in model container [2024-10-13 10:48:30,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:48:30" (1/1) ... [2024-10-13 10:48:30,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:48:30,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:48:30,954 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 10:48:30,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@bb23631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:30, skipping insertion in model container [2024-10-13 10:48:30,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:48:30,955 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:48:30,957 INFO L158 Benchmark]: Toolchain (without parser) took 540.44ms. Allocated memory is still 148.9MB. Free memory was 90.2MB in the beginning and 118.4MB in the end (delta: -28.2MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-10-13 10:48:30,958 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 51.1MB in the beginning and 51.0MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:48:30,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.74ms. Allocated memory is still 148.9MB. Free memory was 90.2MB in the beginning and 118.4MB in the end (delta: -28.2MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-10-13 10:48:30,960 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.17ms. Allocated memory is still 96.5MB. Free memory was 51.1MB in the beginning and 51.0MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.74ms. Allocated memory is still 148.9MB. Free memory was 90.2MB in the beginning and 118.4MB in the end (delta: -28.2MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:48:32,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:48:32,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 10:48:32,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:48:32,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:48:33,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:48:33,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:48:33,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:48:33,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:48:33,023 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:48:33,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:48:33,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:48:33,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:48:33,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:48:33,025 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:48:33,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:48:33,026 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:48:33,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:48:33,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:48:33,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:48:33,031 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:48:33,031 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:48:33,031 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:48:33,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:48:33,032 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:48:33,032 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:48:33,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:48:33,032 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:48:33,032 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:48:33,033 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:48:33,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:48:33,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:48:33,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:48:33,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:48:33,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:48:33,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:48:33,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:48:33,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:48:33,042 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:48:33,042 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:48:33,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:48:33,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:48:33,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:48:33,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:48:33,044 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:48:33,045 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 -> aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd [2024-10-13 10:48:33,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:48:33,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:48:33,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:48:33,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:48:33,379 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:48:33,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2024-10-13 10:48:34,800 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:48:35,054 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:48:35,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2024-10-13 10:48:35,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1985d8d/ffe10d50efae449dbff20b66fed8be91/FLAG4c7331758 [2024-10-13 10:48:35,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1985d8d/ffe10d50efae449dbff20b66fed8be91 [2024-10-13 10:48:35,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:48:35,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:48:35,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:48:35,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:48:35,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:48:35,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48add1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35, skipping insertion in model container [2024-10-13 10:48:35,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:48:35,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:48:35,568 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:48:35,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:48:35,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:48:35,646 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:48:35,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:48:35,781 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:48:35,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35 WrapperNode [2024-10-13 10:48:35,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:48:35,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:48:35,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:48:35,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:48:35,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,856 INFO L138 Inliner]: procedures = 165, calls = 70, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 122 [2024-10-13 10:48:35,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:48:35,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:48:35,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:48:35,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:48:35,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,908 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-10-13 10:48:35,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:48:35,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:48:35,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:48:35,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:48:35,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35" (1/1) ... [2024-10-13 10:48:35,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:48:35,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:48:35,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:48:35,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:48:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:48:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:48:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-10-13 10:48:36,042 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-10-13 10:48:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-13 10:48:36,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-13 10:48:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:48:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:48:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:48:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:48:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:48:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:48:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:48:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:48:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:48:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 10:48:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 10:48:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:48:36,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:48:36,236 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:48:36,238 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:48:36,740 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-10-13 10:48:36,741 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:48:36,820 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:48:36,820 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 10:48:36,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:48:36 BoogieIcfgContainer [2024-10-13 10:48:36,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:48:36,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:48:36,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:48:36,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:48:36,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:48:35" (1/3) ... [2024-10-13 10:48:36,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d83e924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:48:36, skipping insertion in model container [2024-10-13 10:48:36,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:48:35" (2/3) ... [2024-10-13 10:48:36,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d83e924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:48:36, skipping insertion in model container [2024-10-13 10:48:36,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:48:36" (3/3) ... [2024-10-13 10:48:36,832 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-1.i [2024-10-13 10:48:36,851 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:48:36,851 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-10-13 10:48:36,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:48:36,911 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;@422d4e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:48:36,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-10-13 10:48:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 38 states have (on average 1.894736842105263) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:48:36,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:36,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:36,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:36,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash 521993117, now seen corresponding path program 1 times [2024-10-13 10:48:36,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:36,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895845145] [2024-10-13 10:48:36,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:36,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:36,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:36,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:36,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 10:48:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:37,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:48:37,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:37,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:48:37,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:37,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:37,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:37,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895845145] [2024-10-13 10:48:37,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895845145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:37,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:37,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:48:37,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91669917] [2024-10-13 10:48:37,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:37,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:48:37,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:37,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:48:37,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:48:37,235 INFO L87 Difference]: Start difference. First operand has 68 states, 38 states have (on average 1.894736842105263) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:37,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:37,593 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2024-10-13 10:48:37,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:48:37,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 9 [2024-10-13 10:48:37,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:37,603 INFO L225 Difference]: With dead ends: 84 [2024-10-13 10:48:37,604 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 10:48:37,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:48:37,608 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 19 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:37,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 192 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:48:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 10:48:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2024-10-13 10:48:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 67 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:48:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-10-13 10:48:37,668 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 9 [2024-10-13 10:48:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:37,685 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-10-13 10:48:37,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-10-13 10:48:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:48:37,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:37,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:37,710 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 (2)] Forceful destruction successful, exit code 0 [2024-10-13 10:48:37,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:37,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:37,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash 550622268, now seen corresponding path program 1 times [2024-10-13 10:48:37,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:37,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294471027] [2024-10-13 10:48:37,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:37,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:37,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:37,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:37,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 10:48:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:37,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:48:37,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:38,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:38,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:38,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294471027] [2024-10-13 10:48:38,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294471027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:38,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:38,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:48:38,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954511447] [2024-10-13 10:48:38,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:38,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:48:38,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:38,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:48:38,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:48:38,014 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:38,171 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-10-13 10:48:38,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:48:38,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2024-10-13 10:48:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:38,173 INFO L225 Difference]: With dead ends: 70 [2024-10-13 10:48:38,173 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 10:48:38,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:48:38,174 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:38,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:48:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 10:48:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-13 10:48:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 65 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:48:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-10-13 10:48:38,189 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 9 [2024-10-13 10:48:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:38,190 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-10-13 10:48:38,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-10-13 10:48:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:48:38,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:38,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:38,195 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-10-13 10:48:38,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:38,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:38,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:38,393 INFO L85 PathProgramCache]: Analyzing trace with hash -998082500, now seen corresponding path program 1 times [2024-10-13 10:48:38,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:38,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509769033] [2024-10-13 10:48:38,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:38,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:38,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:38,397 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:38,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 10:48:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:38,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:48:38,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:38,497 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-10-13 10:48:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:38,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:38,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:38,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509769033] [2024-10-13 10:48:38,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509769033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:38,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:38,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:48:38,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718296601] [2024-10-13 10:48:38,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:38,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:48:38,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:38,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:48:38,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:48:38,691 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:39,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:39,056 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-10-13 10:48:39,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:48:39,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-13 10:48:39,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:39,058 INFO L225 Difference]: With dead ends: 69 [2024-10-13 10:48:39,058 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 10:48:39,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:48:39,062 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 17 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:39,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 250 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:48:39,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 10:48:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-13 10:48:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:48:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2024-10-13 10:48:39,073 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 10 [2024-10-13 10:48:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:39,073 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2024-10-13 10:48:39,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2024-10-13 10:48:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 10:48:39,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:39,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:39,078 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-10-13 10:48:39,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:39,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:39,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:39,276 INFO L85 PathProgramCache]: Analyzing trace with hash -875813148, now seen corresponding path program 1 times [2024-10-13 10:48:39,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:39,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196224755] [2024-10-13 10:48:39,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:39,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:39,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:39,296 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:39,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 10:48:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:39,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:48:39,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:39,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:39,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:39,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196224755] [2024-10-13 10:48:39,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196224755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:39,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:39,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:48:39,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481391377] [2024-10-13 10:48:39,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:39,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:48:39,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:39,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:48:39,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:48:39,394 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:39,530 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-10-13 10:48:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:48:39,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-13 10:48:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:39,532 INFO L225 Difference]: With dead ends: 69 [2024-10-13 10:48:39,533 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 10:48:39,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:48:39,535 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:39,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 212 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:48:39,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 10:48:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-13 10:48:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:48:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2024-10-13 10:48:39,544 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 11 [2024-10-13 10:48:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:39,545 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-10-13 10:48:39,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2024-10-13 10:48:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 10:48:39,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:39,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:39,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 10:48:39,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:39,752 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:39,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 866997187, now seen corresponding path program 1 times [2024-10-13 10:48:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:39,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594461648] [2024-10-13 10:48:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:39,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:39,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:39,755 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:39,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 10:48:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:39,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:48:39,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:39,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:39,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:39,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594461648] [2024-10-13 10:48:39,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594461648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:39,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:39,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:48:39,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075663736] [2024-10-13 10:48:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:39,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:48:39,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:39,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:48:39,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:48:39,879 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:39,997 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-10-13 10:48:39,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:48:39,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-13 10:48:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:39,998 INFO L225 Difference]: With dead ends: 72 [2024-10-13 10:48:39,998 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 10:48:39,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:48:39,999 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:40,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 171 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:48:40,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 10:48:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-10-13 10:48:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.697674418604651) internal successors, (73), 66 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:48:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2024-10-13 10:48:40,012 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 11 [2024-10-13 10:48:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:40,012 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2024-10-13 10:48:40,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2024-10-13 10:48:40,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:48:40,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:40,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:40,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 10:48:40,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:40,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:40,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash -38848683, now seen corresponding path program 1 times [2024-10-13 10:48:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:40,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111574464] [2024-10-13 10:48:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:40,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:40,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:40,217 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:40,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 10:48:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:40,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:48:40,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:40,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:40,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:40,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111574464] [2024-10-13 10:48:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111574464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:40,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:40,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:48:40,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117545380] [2024-10-13 10:48:40,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:40,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:48:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:40,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:48:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:48:40,347 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:40,479 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-10-13 10:48:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:48:40,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-13 10:48:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:40,480 INFO L225 Difference]: With dead ends: 73 [2024-10-13 10:48:40,481 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 10:48:40,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:48:40,484 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:40,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:48:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 10:48:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-13 10:48:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 68 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:48:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-10-13 10:48:40,494 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 13 [2024-10-13 10:48:40,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:40,495 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-10-13 10:48:40,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-10-13 10:48:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:48:40,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:40,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:40,504 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 10:48:40,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:40,696 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:40,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:40,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1378397870, now seen corresponding path program 1 times [2024-10-13 10:48:40,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:40,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29178543] [2024-10-13 10:48:40,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:40,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:40,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:40,701 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:40,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 10:48:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:40,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:48:40,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:40,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:40,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:40,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29178543] [2024-10-13 10:48:40,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29178543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:40,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:40,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:48:40,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735005570] [2024-10-13 10:48:40,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:40,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:48:40,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:40,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:48:40,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:48:40,799 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:40,890 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2024-10-13 10:48:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:48:40,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-10-13 10:48:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:40,891 INFO L225 Difference]: With dead ends: 74 [2024-10-13 10:48:40,892 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 10:48:40,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:48:40,892 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:40,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:48:40,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 10:48:40,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-13 10:48:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:48:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2024-10-13 10:48:40,903 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 14 [2024-10-13 10:48:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:40,904 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2024-10-13 10:48:40,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-10-13 10:48:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:48:40,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:40,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:40,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 10:48:41,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:41,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:41,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:41,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1204260894, now seen corresponding path program 1 times [2024-10-13 10:48:41,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:41,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142141368] [2024-10-13 10:48:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:41,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:41,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:41,110 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:41,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 10:48:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:41,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:48:41,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:41,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:41,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:41,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142141368] [2024-10-13 10:48:41,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142141368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:41,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:41,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:48:41,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465155124] [2024-10-13 10:48:41,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:41,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:48:41,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:48:41,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:48:41,215 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:41,370 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2024-10-13 10:48:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:48:41,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-10-13 10:48:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:41,372 INFO L225 Difference]: With dead ends: 76 [2024-10-13 10:48:41,372 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 10:48:41,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:48:41,373 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 7 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:41,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 128 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:48:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 10:48:41,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-13 10:48:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 62 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-10-13 10:48:41,379 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 14 [2024-10-13 10:48:41,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:41,379 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-10-13 10:48:41,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-10-13 10:48:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:48:41,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:41,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:41,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 10:48:41,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:41,590 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:41,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:41,591 INFO L85 PathProgramCache]: Analyzing trace with hash -329540749, now seen corresponding path program 1 times [2024-10-13 10:48:41,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:41,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719448325] [2024-10-13 10:48:41,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:41,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:41,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:41,593 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:41,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 10:48:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:41,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:48:41,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:41,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:48:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:41,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:41,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719448325] [2024-10-13 10:48:41,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719448325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:48:41,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:48:41,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:48:41,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371937389] [2024-10-13 10:48:41,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:48:41,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:48:41,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:41,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:48:41,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:48:41,749 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:41,885 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-10-13 10:48:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:48:41,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 15 [2024-10-13 10:48:41,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:41,886 INFO L225 Difference]: With dead ends: 69 [2024-10-13 10:48:41,886 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 10:48:41,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:48:41,887 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:41,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 221 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:48:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 10:48:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-13 10:48:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-10-13 10:48:41,891 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 15 [2024-10-13 10:48:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:41,891 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-10-13 10:48:41,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-10-13 10:48:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:48:41,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:41,892 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:41,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 10:48:42,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:42,096 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:42,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:42,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1109379090, now seen corresponding path program 2 times [2024-10-13 10:48:42,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:42,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610570292] [2024-10-13 10:48:42,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:48:42,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:42,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:42,098 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:42,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 10:48:42,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:48:42,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:48:42,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:48:42,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:42,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:48:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 10:48:42,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:42,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:42,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610570292] [2024-10-13 10:48:42,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610570292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:42,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:42,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:48:42,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500372123] [2024-10-13 10:48:42,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:42,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:48:42,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:42,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:48:42,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:48:42,385 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:42,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:42,730 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-10-13 10:48:42,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:48:42,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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 18 [2024-10-13 10:48:42,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:42,732 INFO L225 Difference]: With dead ends: 69 [2024-10-13 10:48:42,732 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 10:48:42,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:48:42,733 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:42,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 303 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:48:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 10:48:42,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-13 10:48:42,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 64 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2024-10-13 10:48:42,736 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 18 [2024-10-13 10:48:42,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:42,736 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2024-10-13 10:48:42,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:42,736 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2024-10-13 10:48:42,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:48:42,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:42,737 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:42,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-13 10:48:42,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:42,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:42,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:42,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1109379091, now seen corresponding path program 1 times [2024-10-13 10:48:42,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803285329] [2024-10-13 10:48:42,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:42,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:42,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:42,940 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:42,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 10:48:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:43,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:48:43,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:43,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:48:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:43,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:43,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803285329] [2024-10-13 10:48:43,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803285329] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:48:43,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:48:43,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:48:43,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625490185] [2024-10-13 10:48:43,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:48:43,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:48:43,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:43,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:48:43,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:48:43,250 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:43,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:43,566 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2024-10-13 10:48:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:48:43,566 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 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 18 [2024-10-13 10:48:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:43,567 INFO L225 Difference]: With dead ends: 74 [2024-10-13 10:48:43,567 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 10:48:43,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:48:43,568 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 7 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:43,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 434 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:48:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 10:48:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-13 10:48:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-10-13 10:48:43,571 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 18 [2024-10-13 10:48:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:43,571 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-10-13 10:48:43,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-10-13 10:48:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:48:43,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:43,572 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:43,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 10:48:43,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:43,773 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:43,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:43,773 INFO L85 PathProgramCache]: Analyzing trace with hash -365159987, now seen corresponding path program 2 times [2024-10-13 10:48:43,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:43,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089906641] [2024-10-13 10:48:43,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:48:43,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:43,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:43,775 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:43,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 10:48:43,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:48:43,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:48:43,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 10:48:43,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:43,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:48:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-13 10:48:43,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:43,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:43,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089906641] [2024-10-13 10:48:43,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089906641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:43,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:43,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:48:43,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227831819] [2024-10-13 10:48:43,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:43,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:48:43,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:43,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:48:43,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:48:43,965 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:44,221 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2024-10-13 10:48:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:48:44,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 24 [2024-10-13 10:48:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:44,222 INFO L225 Difference]: With dead ends: 74 [2024-10-13 10:48:44,223 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 10:48:44,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:48:44,223 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:44,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 226 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:48:44,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 10:48:44,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-10-13 10:48:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.5625) internal successors, (75), 69 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-10-13 10:48:44,228 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 24 [2024-10-13 10:48:44,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:44,228 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-10-13 10:48:44,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-10-13 10:48:44,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:48:44,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:44,229 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:44,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 10:48:44,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:44,432 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:44,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:44,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1267063950, now seen corresponding path program 1 times [2024-10-13 10:48:44,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:44,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942380401] [2024-10-13 10:48:44,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:44,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:44,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:44,435 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:44,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 10:48:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:44,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:48:44,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:44,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:48:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:48:45,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:45,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942380401] [2024-10-13 10:48:45,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942380401] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:48:45,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:48:45,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:48:45,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747558041] [2024-10-13 10:48:45,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:48:45,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:48:45,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:45,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:48:45,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:48:45,074 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:45,743 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2024-10-13 10:48:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:48:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-13 10:48:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:45,746 INFO L225 Difference]: With dead ends: 79 [2024-10-13 10:48:45,746 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 10:48:45,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2024-10-13 10:48:45,747 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 14 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:45,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 742 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:48:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 10:48:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 10:48:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.5) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-10-13 10:48:45,750 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 26 [2024-10-13 10:48:45,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:45,751 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-10-13 10:48:45,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2024-10-13 10:48:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:48:45,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:45,752 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:45,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 10:48:45,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:45,956 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:45,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:45,956 INFO L85 PathProgramCache]: Analyzing trace with hash -833495442, now seen corresponding path program 2 times [2024-10-13 10:48:45,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:45,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291784930] [2024-10-13 10:48:45,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:48:45,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:45,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:45,959 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:45,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 10:48:46,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:48:46,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:48:46,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:48:46,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 10:48:46,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:46,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:46,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291784930] [2024-10-13 10:48:46,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291784930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:46,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:46,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:48:46,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514805279] [2024-10-13 10:48:46,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:46,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:48:46,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:46,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:48:46,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:48:46,135 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:46,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:46,272 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2024-10-13 10:48:46,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:48:46,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 32 [2024-10-13 10:48:46,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:46,275 INFO L225 Difference]: With dead ends: 79 [2024-10-13 10:48:46,275 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 10:48:46,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:48:46,276 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:46,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 243 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:48:46,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 10:48:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 10:48:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 75 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-10-13 10:48:46,280 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 32 [2024-10-13 10:48:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:46,281 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-10-13 10:48:46,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-10-13 10:48:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 10:48:46,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:46,282 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:46,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 10:48:46,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:46,484 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:46,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash -18758849, now seen corresponding path program 1 times [2024-10-13 10:48:46,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:46,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619298092] [2024-10-13 10:48:46,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:46,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:46,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:46,490 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:46,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 10:48:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:46,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 10:48:46,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:46,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:48:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 10:48:46,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:46,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:46,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619298092] [2024-10-13 10:48:46,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619298092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:46,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:46,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:48:46,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129281054] [2024-10-13 10:48:46,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:46,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:48:46,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:46,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:48:46,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:48:46,787 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:47,071 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-10-13 10:48:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:48:47,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-10-13 10:48:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:47,072 INFO L225 Difference]: With dead ends: 78 [2024-10-13 10:48:47,072 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 10:48:47,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:48:47,073 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:47,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 229 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:48:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 10:48:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2024-10-13 10:48:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 73 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-10-13 10:48:47,076 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 33 [2024-10-13 10:48:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:47,076 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-10-13 10:48:47,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-10-13 10:48:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 10:48:47,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:47,077 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:47,083 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 (16)] Forceful destruction successful, exit code 0 [2024-10-13 10:48:47,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:47,278 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:47,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:47,278 INFO L85 PathProgramCache]: Analyzing trace with hash -18758848, now seen corresponding path program 1 times [2024-10-13 10:48:47,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:47,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120558442] [2024-10-13 10:48:47,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:47,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:47,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:47,282 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:47,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 10:48:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:47,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:48:47,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:47,443 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-10-13 10:48:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 10:48:47,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:47,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:47,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120558442] [2024-10-13 10:48:47,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120558442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:47,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:47,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 10:48:47,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512917626] [2024-10-13 10:48:47,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:47,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:48:47,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:47,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:48:47,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:48:47,656 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:48,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:48,050 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2024-10-13 10:48:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:48:48,050 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-10-13 10:48:48,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:48,051 INFO L225 Difference]: With dead ends: 76 [2024-10-13 10:48:48,051 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 10:48:48,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:48:48,052 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:48,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 305 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:48:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 10:48:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2024-10-13 10:48:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 71 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2024-10-13 10:48:48,054 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 33 [2024-10-13 10:48:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:48,055 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2024-10-13 10:48:48,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2024-10-13 10:48:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:48:48,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:48,056 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:48,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-13 10:48:48,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:48,257 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:48,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:48,257 INFO L85 PathProgramCache]: Analyzing trace with hash -727144678, now seen corresponding path program 1 times [2024-10-13 10:48:48,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:48,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869508131] [2024-10-13 10:48:48,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:48,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:48,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:48,259 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:48,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 10:48:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:48,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:48:48,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 10:48:48,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:48,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:48,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869508131] [2024-10-13 10:48:48,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869508131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:48,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:48,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:48:48,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046092235] [2024-10-13 10:48:48,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:48,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:48:48,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:48,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:48:48,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:48:48,454 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:48,618 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2024-10-13 10:48:48,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:48:48,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-10-13 10:48:48,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:48,619 INFO L225 Difference]: With dead ends: 75 [2024-10-13 10:48:48,619 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 10:48:48,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:48:48,620 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:48,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 258 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:48:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 10:48:48,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-13 10:48:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 70 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-10-13 10:48:48,622 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 34 [2024-10-13 10:48:48,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:48,623 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-10-13 10:48:48,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:48:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-10-13 10:48:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 10:48:48,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:48,624 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:48,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-13 10:48:48,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:48,825 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:48,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:48,825 INFO L85 PathProgramCache]: Analyzing trace with hash -509202339, now seen corresponding path program 1 times [2024-10-13 10:48:48,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:48,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629112516] [2024-10-13 10:48:48,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:48,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:48,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:48,827 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:48,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 10:48:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:49,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:48:49,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:49,061 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-10-13 10:48:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 10:48:49,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:49,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:49,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629112516] [2024-10-13 10:48:49,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629112516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:49,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:49,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 10:48:49,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586446715] [2024-10-13 10:48:49,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:49,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:48:49,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:49,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:48:49,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:48:49,333 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:49,706 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2024-10-13 10:48:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:48:49,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2024-10-13 10:48:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:49,707 INFO L225 Difference]: With dead ends: 73 [2024-10-13 10:48:49,707 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 10:48:49,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:48:49,708 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 43 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:49,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 234 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:48:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 10:48:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-13 10:48:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-10-13 10:48:49,710 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 40 [2024-10-13 10:48:49,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:49,710 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-10-13 10:48:49,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-10-13 10:48:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 10:48:49,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:49,714 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:49,722 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 (19)] Ended with exit code 0 [2024-10-13 10:48:49,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:49,919 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:49,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:49,919 INFO L85 PathProgramCache]: Analyzing trace with hash -509202340, now seen corresponding path program 1 times [2024-10-13 10:48:49,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:49,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91174880] [2024-10-13 10:48:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:49,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:49,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:49,923 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:49,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-13 10:48:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:50,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 10:48:50,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:50,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:48:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 10:48:50,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:50,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:50,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91174880] [2024-10-13 10:48:50,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91174880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:50,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:50,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:48:50,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569431809] [2024-10-13 10:48:50,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:50,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:48:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:50,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:48:50,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:48:50,230 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:50,444 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-10-13 10:48:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:48:50,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2024-10-13 10:48:50,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:50,445 INFO L225 Difference]: With dead ends: 75 [2024-10-13 10:48:50,445 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 10:48:50,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:48:50,446 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:50,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 174 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:48:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 10:48:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-10-13 10:48:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-10-13 10:48:50,448 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 40 [2024-10-13 10:48:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:50,448 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-10-13 10:48:50,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-10-13 10:48:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 10:48:50,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:50,449 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:50,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-13 10:48:50,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:50,650 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:50,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:50,650 INFO L85 PathProgramCache]: Analyzing trace with hash 283333999, now seen corresponding path program 1 times [2024-10-13 10:48:50,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:50,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939801719] [2024-10-13 10:48:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:50,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:50,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:50,652 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:50,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-13 10:48:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:50,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:48:50,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 10:48:50,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:50,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:50,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939801719] [2024-10-13 10:48:50,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939801719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:50,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:50,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:48:50,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350539429] [2024-10-13 10:48:50,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:50,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:48:50,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:50,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:48:50,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:48:50,912 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:51,027 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-10-13 10:48:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:48:51,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-10-13 10:48:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:51,027 INFO L225 Difference]: With dead ends: 71 [2024-10-13 10:48:51,027 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 10:48:51,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:48:51,028 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:51,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 230 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:48:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 10:48:51,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-13 10:48:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-10-13 10:48:51,031 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 42 [2024-10-13 10:48:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:51,031 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-10-13 10:48:51,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-10-13 10:48:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:48:51,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:51,032 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:51,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-13 10:48:51,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:51,232 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:51,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:51,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1295204756, now seen corresponding path program 1 times [2024-10-13 10:48:51,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:51,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478677603] [2024-10-13 10:48:51,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:51,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:51,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:51,237 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:51,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-13 10:48:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:51,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 10:48:51,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:51,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:48:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 10:48:51,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:51,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:51,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478677603] [2024-10-13 10:48:51,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478677603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:51,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:51,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 10:48:51,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847688503] [2024-10-13 10:48:51,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:51,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:48:51,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:51,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:48:51,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:48:51,619 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:51,917 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2024-10-13 10:48:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:48:51,917 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-10-13 10:48:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:51,917 INFO L225 Difference]: With dead ends: 73 [2024-10-13 10:48:51,918 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 10:48:51,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:48:51,918 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:51,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:48:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 10:48:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2024-10-13 10:48:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-10-13 10:48:51,921 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 44 [2024-10-13 10:48:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:51,921 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-10-13 10:48:51,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-10-13 10:48:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:48:51,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:51,922 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:51,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-13 10:48:52,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:52,123 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:52,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:52,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1295204757, now seen corresponding path program 1 times [2024-10-13 10:48:52,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:52,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913568267] [2024-10-13 10:48:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:52,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:52,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:52,125 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:52,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-13 10:48:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:52,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 10:48:52,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:52,353 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-10-13 10:48:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 10:48:52,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:52,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:52,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913568267] [2024-10-13 10:48:52,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913568267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:52,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:52,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:48:52,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260681710] [2024-10-13 10:48:52,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:52,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:48:52,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:52,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:48:52,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:48:52,614 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:52,866 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-10-13 10:48:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:48:52,866 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-10-13 10:48:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:52,867 INFO L225 Difference]: With dead ends: 67 [2024-10-13 10:48:52,867 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 10:48:52,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:48:52,868 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:52,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 243 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:48:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 10:48:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 10:48:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-10-13 10:48:52,873 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 44 [2024-10-13 10:48:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:52,873 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-10-13 10:48:52,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-10-13 10:48:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 10:48:52,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:52,874 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:52,882 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 (23)] Forceful destruction successful, exit code 0 [2024-10-13 10:48:53,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:53,075 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:53,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1496690051, now seen corresponding path program 1 times [2024-10-13 10:48:53,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:53,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467346749] [2024-10-13 10:48:53,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:53,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:53,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:53,077 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:53,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-13 10:48:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:53,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:48:53,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 10:48:53,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:53,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:53,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467346749] [2024-10-13 10:48:53,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467346749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:53,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:53,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:48:53,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034932947] [2024-10-13 10:48:53,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:53,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:48:53,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:53,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:48:53,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:48:53,366 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:53,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:53,492 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2024-10-13 10:48:53,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:48:53,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-10-13 10:48:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:53,493 INFO L225 Difference]: With dead ends: 67 [2024-10-13 10:48:53,493 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 10:48:53,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:48:53,494 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:53,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:48:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 10:48:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 10:48:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 62 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2024-10-13 10:48:53,496 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 45 [2024-10-13 10:48:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:53,496 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2024-10-13 10:48:53,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2024-10-13 10:48:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 10:48:53,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:53,497 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:53,505 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 (24)] Forceful destruction successful, exit code 0 [2024-10-13 10:48:53,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:53,701 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:53,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash -539237842, now seen corresponding path program 1 times [2024-10-13 10:48:53,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:53,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143773909] [2024-10-13 10:48:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:53,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:53,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:53,703 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:53,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-13 10:48:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:54,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 10:48:54,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:54,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:48:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 10:48:54,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:54,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:54,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143773909] [2024-10-13 10:48:54,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143773909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:54,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:54,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:48:54,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282086145] [2024-10-13 10:48:54,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:54,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:48:54,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:54,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:48:54,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:48:54,140 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:54,410 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2024-10-13 10:48:54,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:48:54,410 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2024-10-13 10:48:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:54,411 INFO L225 Difference]: With dead ends: 69 [2024-10-13 10:48:54,411 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 10:48:54,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:48:54,412 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:54,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 107 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:48:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 10:48:54,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-10-13 10:48:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 60 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2024-10-13 10:48:54,415 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 47 [2024-10-13 10:48:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:54,415 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2024-10-13 10:48:54,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2024-10-13 10:48:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 10:48:54,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:54,416 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:54,424 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 (25)] Ended with exit code 0 [2024-10-13 10:48:54,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:54,617 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:54,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash -539237841, now seen corresponding path program 1 times [2024-10-13 10:48:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:54,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128367121] [2024-10-13 10:48:54,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:54,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:54,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:54,619 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:54,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-13 10:48:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:48:54,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 10:48:54,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:48:54,916 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-10-13 10:48:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 10:48:55,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:48:55,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:48:55,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128367121] [2024-10-13 10:48:55,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128367121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:48:55,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:48:55,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 10:48:55,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803305135] [2024-10-13 10:48:55,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:48:55,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:48:55,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:48:55,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:48:55,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:48:55,176 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:48:55,432 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2024-10-13 10:48:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:48:55,433 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2024-10-13 10:48:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:48:55,433 INFO L225 Difference]: With dead ends: 64 [2024-10-13 10:48:55,433 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 10:48:55,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:48:55,434 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 20 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:48:55,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 208 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:48:55,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 10:48:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-10-13 10:48:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2024-10-13 10:48:55,437 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 47 [2024-10-13 10:48:55,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:48:55,437 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2024-10-13 10:48:55,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:48:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2024-10-13 10:48:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 10:48:55,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:48:55,438 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:55,446 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 (26)] Ended with exit code 0 [2024-10-13 10:48:55,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:55,639 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:48:55,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:48:55,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1484403008, now seen corresponding path program 1 times [2024-10-13 10:48:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:48:55,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164604939] [2024-10-13 10:48:55,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:48:55,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:55,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:48:55,641 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:48:55,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-13 10:48:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:48:56,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 10:48:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:48:56,386 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 10:48:56,386 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 10:48:56,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (24 of 25 remaining) [2024-10-13 10:48:56,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2024-10-13 10:48:56,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2024-10-13 10:48:56,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 25 remaining) [2024-10-13 10:48:56,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 25 remaining) [2024-10-13 10:48:56,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (19 of 25 remaining) [2024-10-13 10:48:56,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (18 of 25 remaining) [2024-10-13 10:48:56,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 25 remaining) [2024-10-13 10:48:56,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 25 remaining) [2024-10-13 10:48:56,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 25 remaining) [2024-10-13 10:48:56,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 25 remaining) [2024-10-13 10:48:56,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 25 remaining) [2024-10-13 10:48:56,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 25 remaining) [2024-10-13 10:48:56,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 25 remaining) [2024-10-13 10:48:56,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 25 remaining) [2024-10-13 10:48:56,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 25 remaining) [2024-10-13 10:48:56,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 25 remaining) [2024-10-13 10:48:56,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 25 remaining) [2024-10-13 10:48:56,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 25 remaining) [2024-10-13 10:48:56,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (5 of 25 remaining) [2024-10-13 10:48:56,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (4 of 25 remaining) [2024-10-13 10:48:56,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (3 of 25 remaining) [2024-10-13 10:48:56,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (2 of 25 remaining) [2024-10-13 10:48:56,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (1 of 25 remaining) [2024-10-13 10:48:56,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (0 of 25 remaining) [2024-10-13 10:48:56,404 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 (27)] Ended with exit code 0 [2024-10-13 10:48:56,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:48:56,597 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:48:56,648 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:48:56,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:48:56 BoogieIcfgContainer [2024-10-13 10:48:56,651 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:48:56,652 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:48:56,652 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:48:56,652 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:48:56,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:48:36" (3/4) ... [2024-10-13 10:48:56,654 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 10:48:56,655 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:48:56,656 INFO L158 Benchmark]: Toolchain (without parser) took 21569.02ms. Allocated memory was 71.3MB in the beginning and 113.2MB in the end (delta: 41.9MB). Free memory was 39.3MB in the beginning and 39.9MB in the end (delta: -552.9kB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2024-10-13 10:48:56,656 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 56.6MB. Free memory is still 31.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:48:56,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.26ms. Allocated memory is still 71.3MB. Free memory was 39.2MB in the beginning and 46.8MB in the end (delta: -7.7MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-10-13 10:48:56,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.07ms. Allocated memory is still 71.3MB. Free memory was 46.5MB in the beginning and 43.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:48:56,658 INFO L158 Benchmark]: Boogie Preprocessor took 91.49ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 39.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:48:56,658 INFO L158 Benchmark]: RCFGBuilder took 870.00ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 39.3MB in the beginning and 65.6MB in the end (delta: -26.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 10:48:56,658 INFO L158 Benchmark]: TraceAbstraction took 19827.34ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 65.1MB in the beginning and 39.9MB in the end (delta: 25.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2024-10-13 10:48:56,658 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 113.2MB. Free memory is still 39.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:48:56,661 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.22ms. Allocated memory is still 56.6MB. Free memory is still 31.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.26ms. Allocated memory is still 71.3MB. Free memory was 39.2MB in the beginning and 46.8MB in the end (delta: -7.7MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.07ms. Allocated memory is still 71.3MB. Free memory was 46.5MB in the beginning and 43.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.49ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 39.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 870.00ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 39.3MB in the beginning and 65.6MB in the end (delta: -26.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19827.34ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 65.1MB in the beginning and 39.9MB in the end (delta: 25.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 113.2MB. Free memory is still 39.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 763]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 763. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L764] CALL entry_point() [L758] struct ldv_kobject *kobj; [L759] CALL, EXPR ldv_kobject_create() [L740] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={1:0}] [L741] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L741] RET, EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_global_msg_list={1:0}] [L741] kobj = ldv_malloc(sizeof(*kobj)) [L742] COND FALSE !(!kobj) [L744] FCALL memset(kobj, 0, sizeof(*kobj)) [L745] CALL ldv_kobject_init(kobj) [L730] COND FALSE !(!kobj) [L733] CALL ldv_kobject_init_internal(kobj) [L723] COND FALSE !(!kobj) [L725] CALL ldv_kref_init(&kobj->kref) [L682] ((&kref->refcount)->counter) = (1) [L725] RET ldv_kref_init(&kobj->kref) [L726] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [\old(list)={2:4}, ldv_global_msg_list={1:0}] [L540] list->next = list VAL [\old(list)={2:4}, ldv_global_msg_list={1:0}, list={2:4}] [L541] list->prev = list [L726] RET LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={2:0}, ldv_global_msg_list={1:0}] [L733] RET ldv_kobject_init_internal(kobj) [L745] RET ldv_kobject_init(kobj) [L746] return kobj; VAL [\result={2:0}, ldv_global_msg_list={1:0}] [L759] RET, EXPR ldv_kobject_create() [L759] kobj = ldv_kobject_create() [L760] CALL ldv_kobject_get(kobj) [L717] COND TRUE \read(*kobj) [L718] CALL ldv_kref_get(&kobj->kref) [L686] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L657] int temp; VAL [i=1, ldv_global_msg_list={1:0}, v={2:12}] [L658] EXPR v->counter [L658] temp = v->counter [L659] temp += i VAL [ldv_global_msg_list={1:0}, temp=2, v={2:12}] [L660] v->counter = temp [L661] return temp; [L686] RET ldv_atomic_add_return(1, (&kref->refcount)) [L718] RET ldv_kref_get(&kobj->kref) [L719] return kobj; [L760] RET ldv_kobject_get(kobj) [L761] CALL ldv_kobject_put(kobj) [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL, EXPR ldv_kref_sub(kref, 1, release) [L674] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [i=1, ldv_global_msg_list={1:0}, v={2:12}] [L666] EXPR v->counter [L666] temp = v->counter [L667] temp -= i VAL [ldv_global_msg_list={1:0}, temp=1, v={2:12}] [L668] v->counter = temp [L669] return temp; [L674] RET, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L674] COND FALSE !((ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0)) [L678] return 0; VAL [\result=0, kref={2:12}, ldv_global_msg_list={1:0}, release={-1:0}] [L690] RET, EXPR ldv_kref_sub(kref, 1, release) [L690] return ldv_kref_sub(kref, 1, release); [L712] RET ldv_kref_put(&kobj->kref, ldv_kobject_release) [L761] RET ldv_kobject_put(kobj) [L764] RET entry_point() - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 68 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 26, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 305 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 6152 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5025 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4099 IncrementalHoareTripleChecker+Invalid, 4125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 1127 mSDtfsCounter, 4099 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 735 GetRequests, 533 SyntacticMatches, 6 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=13, InterpolantAutomatonStates: 207, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 29 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 722 NumberOfCodeBlocks, 692 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 704 ConstructedInterpolants, 24 QuantifiedInterpolants, 3731 SizeOfPredicates, 39 NumberOfNonLiveVariables, 4625 ConjunctsInSsa, 312 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 1697/1829 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 10:48:56,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample