./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_test11_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_test11_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 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:45:24,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:45:24,146 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:45:24,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:45:24,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:45:24,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:45:24,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:45:24,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:45:24,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:45:24,177 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:45:24,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:45:24,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:45:24,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:45:24,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:45:24,178 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:45:24,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:45:24,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:45:24,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:45:24,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:45:24,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:45:24,180 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:45:24,183 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:45:24,183 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:45:24,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:45:24,184 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:45:24,184 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:45:24,184 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:45:24,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:45:24,184 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:45:24,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:45:24,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:45:24,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:45:24,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:45:24,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:45:24,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:45:24,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:45:24,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:45:24,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:45:24,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:45:24,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:45:24,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:45:24,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:45:24,190 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 -> 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 [2024-10-13 10:45:24,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:45:24,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:45:24,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:45:24,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:45:24,406 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:45:24,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2024-10-13 10:45:25,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:45:25,860 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:45:25,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2024-10-13 10:45:25,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c665d9e9a/eced861d4530415292c108e73606ce4d/FLAGc35846ce9 [2024-10-13 10:45:25,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c665d9e9a/eced861d4530415292c108e73606ce4d [2024-10-13 10:45:25,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:45:25,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:45:25,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:45:25,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:45:25,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:45:25,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:45:25" (1/1) ... [2024-10-13 10:45:25,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac07102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:25, skipping insertion in model container [2024-10-13 10:45:25,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:45:25" (1/1) ... [2024-10-13 10:45:25,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:45:26,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:45:26,269 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:45:26,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@66aa4027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:26, skipping insertion in model container [2024-10-13 10:45:26,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:45:26,270 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:45:26,271 INFO L158 Benchmark]: Toolchain (without parser) took 382.69ms. Allocated memory is still 180.4MB. Free memory was 107.8MB in the beginning and 91.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 10:45:26,272 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:45:26,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.02ms. Allocated memory is still 180.4MB. Free memory was 107.8MB in the beginning and 91.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 10:45:26,273 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.15ms. Allocated memory is still 117.4MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.02ms. Allocated memory is still 180.4MB. Free memory was 107.8MB in the beginning and 91.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.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_test11_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 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:45:27,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:45:28,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 10:45:28,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:45:28,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:45:28,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:45:28,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:45:28,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:45:28,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:45:28,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:45:28,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:45:28,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:45:28,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:45:28,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:45:28,052 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:45:28,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:45:28,053 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:45:28,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:45:28,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:45:28,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:45:28,053 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:45:28,054 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:45:28,054 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:45:28,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:45:28,055 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:45:28,055 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:45:28,055 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:45:28,055 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:45:28,056 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:45:28,056 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:45:28,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:45:28,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:45:28,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:45:28,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:45:28,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:45:28,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:45:28,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:45:28,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:45:28,059 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:45:28,059 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:45:28,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:45:28,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:45:28,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:45:28,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:45:28,060 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:45:28,060 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 -> 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 [2024-10-13 10:45:28,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:45:28,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:45:28,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:45:28,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:45:28,368 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:45:28,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2024-10-13 10:45:29,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:45:29,859 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:45:29,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2024-10-13 10:45:29,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d9a9161e/3f226bd33fad49188aed0ca4c2caf342/FLAG81e0a1bf3 [2024-10-13 10:45:29,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d9a9161e/3f226bd33fad49188aed0ca4c2caf342 [2024-10-13 10:45:29,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:45:29,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:45:29,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:45:29,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:45:29,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:45:29,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:45:29" (1/1) ... [2024-10-13 10:45:29,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c36ffcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:29, skipping insertion in model container [2024-10-13 10:45:29,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:45:29" (1/1) ... [2024-10-13 10:45:29,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:45:30,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:45:30,307 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:45:30,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:45:30,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:45:30,369 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:45:30,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:45:30,473 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:45:30,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:30 WrapperNode [2024-10-13 10:45:30,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:45:30,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:45:30,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:45:30,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:45:30,480 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:45:30" (1/1) ... [2024-10-13 10:45:30,497 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:45:30" (1/1) ... [2024-10-13 10:45:30,515 INFO L138 Inliner]: procedures = 169, calls = 88, calls flagged for inlining = 26, calls inlined = 8, statements flattened = 97 [2024-10-13 10:45:30,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:45:30,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:45:30,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:45:30,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:45:30,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:30" (1/1) ... [2024-10-13 10:45:30,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:30" (1/1) ... [2024-10-13 10:45:30,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:30" (1/1) ... [2024-10-13 10:45:30,546 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-10-13 10:45:30,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:30" (1/1) ... [2024-10-13 10:45:30,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:30" (1/1) ... [2024-10-13 10:45:30,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:30" (1/1) ... [2024-10-13 10:45:30,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:30" (1/1) ... [2024-10-13 10:45:30,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:30" (1/1) ... [2024-10-13 10:45:30,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:30" (1/1) ... [2024-10-13 10:45:30,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:45:30,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:45:30,562 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:45:30,562 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:45:30,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:30" (1/1) ... [2024-10-13 10:45:30,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:45:30,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:45:30,591 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:45:30,593 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:45:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-13 10:45:30,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-13 10:45:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2024-10-13 10:45:30,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2024-10-13 10:45:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:45:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:45:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:45:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:45:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:45:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:45:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:45:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 10:45:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 10:45:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:45:30,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:45:30,729 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:45:30,731 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:45:31,015 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2024-10-13 10:45:31,016 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:45:31,051 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:45:31,052 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 10:45:31,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:45:31 BoogieIcfgContainer [2024-10-13 10:45:31,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:45:31,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:45:31,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:45:31,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:45:31,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:45:29" (1/3) ... [2024-10-13 10:45:31,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f1b5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:45:31, skipping insertion in model container [2024-10-13 10:45:31,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:30" (2/3) ... [2024-10-13 10:45:31,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f1b5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:45:31, skipping insertion in model container [2024-10-13 10:45:31,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:45:31" (3/3) ... [2024-10-13 10:45:31,062 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test11_1.i [2024-10-13 10:45:31,077 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:45:31,077 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-13 10:45:31,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:45:31,115 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;@25facc50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:45:31,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-10-13 10:45:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 71 states have internal predecessors, (77), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:45:31,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:45:31,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:31,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:31,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:31,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1692559857, now seen corresponding path program 1 times [2024-10-13 10:45:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:31,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152211525] [2024-10-13 10:45:31,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:31,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:45:31,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:31,146 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:45:31,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 10:45:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:31,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:45:31,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:45:31,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:45:31,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:31,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152211525] [2024-10-13 10:45:31,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152211525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:45:31,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:45:31,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:45:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685353663] [2024-10-13 10:45:31,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:45:31,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:45:31,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:31,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:45:31,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:31,305 INFO L87 Difference]: Start difference. First operand has 80 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 71 states have internal predecessors, (77), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:45:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:31,411 INFO L93 Difference]: Finished difference Result 143 states and 171 transitions. [2024-10-13 10:45:31,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:45:31,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-13 10:45:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:31,421 INFO L225 Difference]: With dead ends: 143 [2024-10-13 10:45:31,426 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 10:45:31,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:31,431 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 58 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:31,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 326 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:45:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 10:45:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 83. [2024-10-13 10:45:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 73 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-13 10:45:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2024-10-13 10:45:31,461 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 10 [2024-10-13 10:45:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:31,462 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2024-10-13 10:45:31,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:45:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2024-10-13 10:45:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:45:31,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:31,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:31,466 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:45:31,663 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:45:31,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:31,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash -805056176, now seen corresponding path program 1 times [2024-10-13 10:45:31,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:31,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686825421] [2024-10-13 10:45:31,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:31,665 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:45:31,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:31,667 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:45:31,668 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:45:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:31,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:45:31,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:31,772 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:45:31,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:45:31,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:31,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686825421] [2024-10-13 10:45:31,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686825421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:45:31,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:45:31,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:45:31,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017410036] [2024-10-13 10:45:31,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:45:31,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:45:31,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:31,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:45:31,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:45:31,778 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:45:32,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:32,039 INFO L93 Difference]: Finished difference Result 148 states and 171 transitions. [2024-10-13 10:45:32,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:45:32,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:45:32,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:32,041 INFO L225 Difference]: With dead ends: 148 [2024-10-13 10:45:32,041 INFO L226 Difference]: Without dead ends: 146 [2024-10-13 10:45:32,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:45:32,042 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 62 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:32,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 262 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:45:32,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-13 10:45:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 79. [2024-10-13 10:45:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 41 states have (on average 1.829268292682927) internal successors, (75), 70 states have internal predecessors, (75), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:45:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-10-13 10:45:32,050 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 10 [2024-10-13 10:45:32,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:32,051 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-10-13 10:45:32,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:45:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-10-13 10:45:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:45:32,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:32,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:32,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 10:45:32,254 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:45:32,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:32,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:32,255 INFO L85 PathProgramCache]: Analyzing trace with hash -917501701, now seen corresponding path program 1 times [2024-10-13 10:45:32,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:32,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709899807] [2024-10-13 10:45:32,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:32,256 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:45:32,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:32,259 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:45:32,261 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:45:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:32,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:45:32,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:45:32,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:45:32,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709899807] [2024-10-13 10:45:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709899807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:45:32,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:45:32,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:45:32,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23551327] [2024-10-13 10:45:32,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:45:32,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:45:32,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:32,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:45:32,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:32,337 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:45:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:32,448 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2024-10-13 10:45:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:45:32,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-13 10:45:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:32,450 INFO L225 Difference]: With dead ends: 133 [2024-10-13 10:45:32,450 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 10:45:32,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:32,451 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 49 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 445 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:45:32,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 445 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:45:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 10:45:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 83. [2024-10-13 10:45:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 73 states have internal predecessors, (78), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-13 10:45:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2024-10-13 10:45:32,461 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 16 [2024-10-13 10:45:32,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:32,462 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2024-10-13 10:45:32,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:45:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2024-10-13 10:45:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:45:32,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:32,463 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:32,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 10:45:32,663 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:45:32,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:32,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash -917501717, now seen corresponding path program 1 times [2024-10-13 10:45:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:32,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166361928] [2024-10-13 10:45:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:32,665 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:45:32,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:32,668 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:45:32,668 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:45:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:32,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:45:32,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:32,731 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:45:32,791 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-13 10:45:32,828 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-13 10:45:32,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-13 10:45:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 10:45:32,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:45:37,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:37,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166361928] [2024-10-13 10:45:37,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166361928] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:45:37,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:37,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-13 10:45:37,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806064831] [2024-10-13 10:45:37,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:37,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:45:37,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:37,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:45:37,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=40, Unknown=2, NotChecked=12, Total=72 [2024-10-13 10:45:37,004 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:45:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:37,302 INFO L93 Difference]: Finished difference Result 119 states and 136 transitions. [2024-10-13 10:45:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:45:37,303 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-10-13 10:45:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:37,303 INFO L225 Difference]: With dead ends: 119 [2024-10-13 10:45:37,304 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 10:45:37,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=23, Invalid=51, Unknown=2, NotChecked=14, Total=90 [2024-10-13 10:45:37,305 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 62 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:37,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 234 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 256 Invalid, 0 Unknown, 130 Unchecked, 0.2s Time] [2024-10-13 10:45:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 10:45:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2024-10-13 10:45:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 81 states have internal predecessors, (92), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-13 10:45:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2024-10-13 10:45:37,310 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 16 [2024-10-13 10:45:37,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:37,311 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2024-10-13 10:45:37,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:45:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2024-10-13 10:45:37,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:45:37,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:37,312 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:37,316 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:45:37,514 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:45:37,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:37,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:37,515 INFO L85 PathProgramCache]: Analyzing trace with hash -917501716, now seen corresponding path program 1 times [2024-10-13 10:45:37,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:37,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750121524] [2024-10-13 10:45:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:37,516 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:45:37,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:37,517 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:45:37,518 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:45:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:37,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 10:45:37,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:37,578 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:45:37,587 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:45:37,683 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-13 10:45:37,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:45:37,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:45:37,722 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:45:37,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 10:45:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 10:45:37,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:37,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750121524] [2024-10-13 10:45:37,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750121524] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1758697997] [2024-10-13 10:45:37,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:37,885 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:45:37,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:45:37,888 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:45:37,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-13 10:45:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:37,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 10:45:37,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:37,971 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:45:37,975 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:45:38,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:45:38,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:45:38,074 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:45:38,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 10:45:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 10:45:38,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:38,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1758697997] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:38,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:38,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-13 10:45:38,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811712953] [2024-10-13 10:45:38,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:38,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:45:38,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:38,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:45:38,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-10-13 10:45:38,205 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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:45:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:38,846 INFO L93 Difference]: Finished difference Result 197 states and 228 transitions. [2024-10-13 10:45:38,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:45:38,846 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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 16 [2024-10-13 10:45:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:38,847 INFO L225 Difference]: With dead ends: 197 [2024-10-13 10:45:38,847 INFO L226 Difference]: Without dead ends: 197 [2024-10-13 10:45:38,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2024-10-13 10:45:38,848 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 107 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:38,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 602 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 547 Invalid, 0 Unknown, 221 Unchecked, 0.6s Time] [2024-10-13 10:45:38,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-13 10:45:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 130. [2024-10-13 10:45:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 85 states have (on average 1.8) internal successors, (153), 112 states have internal predecessors, (153), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (20), 15 states have call predecessors, (20), 12 states have call successors, (20) [2024-10-13 10:45:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 185 transitions. [2024-10-13 10:45:38,855 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 185 transitions. Word has length 16 [2024-10-13 10:45:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:38,855 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 185 transitions. [2024-10-13 10:45:38,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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:45:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 185 transitions. [2024-10-13 10:45:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:45:38,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:38,856 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:38,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-10-13 10:45:39,060 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:45:39,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:45:39,257 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:39,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:39,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1210904724, now seen corresponding path program 1 times [2024-10-13 10:45:39,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:39,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962159757] [2024-10-13 10:45:39,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:39,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:45:39,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:39,260 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:45:39,261 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:45:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:39,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:45:39,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:45:39,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:45:39,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:39,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962159757] [2024-10-13 10:45:39,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962159757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:45:39,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:45:39,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:45:39,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735676025] [2024-10-13 10:45:39,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:45:39,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:45:39,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:39,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:45:39,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:39,345 INFO L87 Difference]: Start difference. First operand 130 states and 185 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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:45:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:39,398 INFO L93 Difference]: Finished difference Result 115 states and 155 transitions. [2024-10-13 10:45:39,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:45:39,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 16 [2024-10-13 10:45:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:39,399 INFO L225 Difference]: With dead ends: 115 [2024-10-13 10:45:39,399 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 10:45:39,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:39,400 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:39,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:45:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 10:45:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-13 10:45:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 99 states have internal predecessors, (131), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2024-10-13 10:45:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 153 transitions. [2024-10-13 10:45:39,413 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 153 transitions. Word has length 16 [2024-10-13 10:45:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:39,413 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 153 transitions. [2024-10-13 10:45:39,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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:45:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 153 transitions. [2024-10-13 10:45:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:45:39,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:39,417 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:39,425 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:45:39,618 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:45:39,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:39,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:39,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1785245139, now seen corresponding path program 1 times [2024-10-13 10:45:39,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:39,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060917708] [2024-10-13 10:45:39,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:39,620 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:45:39,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:39,621 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:45:39,622 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:45:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:39,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:45:39,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:45:39,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:45:39,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:39,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060917708] [2024-10-13 10:45:39,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060917708] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:45:39,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:39,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-10-13 10:45:39,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158202683] [2024-10-13 10:45:39,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:39,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:45:39,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:39,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:45:39,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:45:39,864 INFO L87 Difference]: Start difference. First operand 113 states and 153 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:45:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:40,059 INFO L93 Difference]: Finished difference Result 116 states and 155 transitions. [2024-10-13 10:45:40,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:45:40,060 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2024-10-13 10:45:40,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:40,061 INFO L225 Difference]: With dead ends: 116 [2024-10-13 10:45:40,061 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 10:45:40,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:45:40,062 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 118 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:40,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 227 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:45:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 10:45:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-13 10:45:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 75 states have (on average 1.7466666666666666) internal successors, (131), 99 states have internal predecessors, (131), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2024-10-13 10:45:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 153 transitions. [2024-10-13 10:45:40,066 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 153 transitions. Word has length 17 [2024-10-13 10:45:40,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:40,067 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 153 transitions. [2024-10-13 10:45:40,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:45:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 153 transitions. [2024-10-13 10:45:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:45:40,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:40,067 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:40,071 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:45:40,268 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:45:40,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:40,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash 342226559, now seen corresponding path program 1 times [2024-10-13 10:45:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121622137] [2024-10-13 10:45:40,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:40,270 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:45:40,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:40,271 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:45:40,271 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:45:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:40,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 10:45:40,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:40,396 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_22| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_22|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_22| (_ bv0 1))))) is different from true [2024-10-13 10:45:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:45:40,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:40,465 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-10-13 10:45:40,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-10-13 10:45:40,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:40,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121622137] [2024-10-13 10:45:40,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121622137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:40,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1986760942] [2024-10-13 10:45:40,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:40,574 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:45:40,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:45:40,576 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:45:40,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-10-13 10:45:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:40,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:45:40,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:45:40,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:40,830 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-10-13 10:45:40,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-10-13 10:45:41,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1986760942] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:41,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:41,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2024-10-13 10:45:41,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337597600] [2024-10-13 10:45:41,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:41,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:45:41,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:41,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:45:41,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-10-13 10:45:41,171 INFO L87 Difference]: Start difference. First operand 114 states and 153 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:45:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:41,547 INFO L93 Difference]: Finished difference Result 168 states and 215 transitions. [2024-10-13 10:45:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:45:41,547 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 20 [2024-10-13 10:45:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:41,549 INFO L225 Difference]: With dead ends: 168 [2024-10-13 10:45:41,549 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 10:45:41,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-10-13 10:45:41,549 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 52 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:41,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 453 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 387 Invalid, 0 Unknown, 153 Unchecked, 0.4s Time] [2024-10-13 10:45:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 10:45:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 109. [2024-10-13 10:45:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 95 states have internal predecessors, (125), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2024-10-13 10:45:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2024-10-13 10:45:41,559 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 20 [2024-10-13 10:45:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:41,559 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2024-10-13 10:45:41,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:45:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2024-10-13 10:45:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:45:41,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:41,561 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:41,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-10-13 10:45:41,765 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:45:41,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:45:41,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:41,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1237891212, now seen corresponding path program 1 times [2024-10-13 10:45:41,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:41,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031012965] [2024-10-13 10:45:41,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:41,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:45:41,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:41,965 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:45:41,966 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:45:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:42,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:45:42,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:42,019 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:45:42,047 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-10-13 10:45:42,059 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 10:45:42,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-13 10:45:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-10-13 10:45:42,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:45:42,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:42,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031012965] [2024-10-13 10:45:42,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031012965] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:45:42,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:42,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-10-13 10:45:42,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403488140] [2024-10-13 10:45:42,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:42,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:45:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:42,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:45:42,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-10-13 10:45:42,190 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:45:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:42,428 INFO L93 Difference]: Finished difference Result 151 states and 206 transitions. [2024-10-13 10:45:42,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:45:42,428 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2024-10-13 10:45:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:42,429 INFO L225 Difference]: With dead ends: 151 [2024-10-13 10:45:42,429 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 10:45:42,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2024-10-13 10:45:42,429 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 45 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:42,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 289 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 261 Invalid, 0 Unknown, 120 Unchecked, 0.2s Time] [2024-10-13 10:45:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 10:45:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 122. [2024-10-13 10:45:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 82 states have (on average 1.7439024390243902) internal successors, (143), 105 states have internal predecessors, (143), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2024-10-13 10:45:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 168 transitions. [2024-10-13 10:45:42,436 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 168 transitions. Word has length 24 [2024-10-13 10:45:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:42,436 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 168 transitions. [2024-10-13 10:45:42,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:45:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 168 transitions. [2024-10-13 10:45:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:45:42,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:42,437 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:42,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 10:45:42,637 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:45:42,638 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:42,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:42,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1237891213, now seen corresponding path program 1 times [2024-10-13 10:45:42,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:42,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750899030] [2024-10-13 10:45:42,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:42,639 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:45:42,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:42,640 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:45:42,641 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:45:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:42,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 10:45:42,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:42,703 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:45:42,781 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-10-13 10:45:42,803 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:45:42,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 10:45:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-13 10:45:42,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:42,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:42,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750899030] [2024-10-13 10:45:42,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750899030] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:42,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [824798863] [2024-10-13 10:45:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:42,949 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:45:42,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:45:42,951 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:45:42,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-10-13 10:45:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:43,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 10:45:43,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:43,056 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:45:43,060 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:45:43,163 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-13 10:45:43,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:45:43,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:45:43,195 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:45:43,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 10:45:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-13 10:45:43,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:43,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [824798863] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:43,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:43,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-10-13 10:45:43,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822876817] [2024-10-13 10:45:43,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:43,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:45:43,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:43,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:45:43,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2024-10-13 10:45:43,322 INFO L87 Difference]: Start difference. First operand 122 states and 168 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 10:45:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:43,768 INFO L93 Difference]: Finished difference Result 218 states and 294 transitions. [2024-10-13 10:45:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:45:43,769 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 24 [2024-10-13 10:45:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:43,770 INFO L225 Difference]: With dead ends: 218 [2024-10-13 10:45:43,770 INFO L226 Difference]: Without dead ends: 218 [2024-10-13 10:45:43,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=224, Unknown=3, NotChecked=62, Total=342 [2024-10-13 10:45:43,770 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 90 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:43,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 568 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 416 Invalid, 0 Unknown, 364 Unchecked, 0.4s Time] [2024-10-13 10:45:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-13 10:45:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 168. [2024-10-13 10:45:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 122 states have (on average 1.7868852459016393) internal successors, (218), 145 states have internal predecessors, (218), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2024-10-13 10:45:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 257 transitions. [2024-10-13 10:45:43,782 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 257 transitions. Word has length 24 [2024-10-13 10:45:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:43,782 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 257 transitions. [2024-10-13 10:45:43,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 10:45:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 257 transitions. [2024-10-13 10:45:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:45:43,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:43,783 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:43,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-10-13 10:45:43,986 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:45:44,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:45:44,184 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:44,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:44,184 INFO L85 PathProgramCache]: Analyzing trace with hash 732332587, now seen corresponding path program 1 times [2024-10-13 10:45:44,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:44,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286952030] [2024-10-13 10:45:44,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:44,185 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:45:44,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:44,186 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:45:44,186 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:45:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:44,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:45:44,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:45:44,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:45:44,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:44,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286952030] [2024-10-13 10:45:44,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286952030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:45:44,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:45:44,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:45:44,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363406831] [2024-10-13 10:45:44,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:45:44,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:45:44,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:44,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:45:44,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:44,261 INFO L87 Difference]: Start difference. First operand 168 states and 257 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:45:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:44,309 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2024-10-13 10:45:44,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:45:44,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-13 10:45:44,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:44,310 INFO L225 Difference]: With dead ends: 111 [2024-10-13 10:45:44,310 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 10:45:44,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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:45:44,310 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:44,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:45:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 10:45:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-13 10:45:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 95 states have internal predecessors, (123), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:45:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 144 transitions. [2024-10-13 10:45:44,314 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 144 transitions. Word has length 24 [2024-10-13 10:45:44,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:44,314 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 144 transitions. [2024-10-13 10:45:44,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:45:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 144 transitions. [2024-10-13 10:45:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:45:44,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:44,315 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:44,319 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:45:44,517 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:45:44,517 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:44,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash -280074892, now seen corresponding path program 1 times [2024-10-13 10:45:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:44,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753203855] [2024-10-13 10:45:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:44,518 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:45:44,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:44,519 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:45:44,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 10:45:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:44,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:45:44,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:44,584 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 8 treesize of output 1 [2024-10-13 10:45:44,599 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-10-13 10:45:44,609 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 10:45:44,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-13 10:45:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:45:44,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:45:44,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:44,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753203855] [2024-10-13 10:45:44,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753203855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:45:44,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:45:44,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:45:44,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618093553] [2024-10-13 10:45:44,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:45:44,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:45:44,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:44,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:45:44,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-10-13 10:45:44,622 INFO L87 Difference]: Start difference. First operand 109 states and 144 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:45:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:44,746 INFO L93 Difference]: Finished difference Result 141 states and 178 transitions. [2024-10-13 10:45:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:45:44,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-10-13 10:45:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:44,748 INFO L225 Difference]: With dead ends: 141 [2024-10-13 10:45:44,748 INFO L226 Difference]: Without dead ends: 141 [2024-10-13 10:45:44,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-10-13 10:45:44,750 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 61 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:44,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 235 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 136 Unchecked, 0.1s Time] [2024-10-13 10:45:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-13 10:45:44,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 108. [2024-10-13 10:45:44,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 94 states have internal predecessors, (121), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:45:44,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 142 transitions. [2024-10-13 10:45:44,753 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 142 transitions. Word has length 25 [2024-10-13 10:45:44,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:44,753 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 142 transitions. [2024-10-13 10:45:44,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:45:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 142 transitions. [2024-10-13 10:45:44,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:45:44,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:44,754 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:44,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 10:45:44,954 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:45:44,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:44,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash -280074891, now seen corresponding path program 1 times [2024-10-13 10:45:44,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:44,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888300754] [2024-10-13 10:45:44,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:44,955 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:45:44,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:44,956 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:45:44,957 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:45:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:45,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:45:45,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:45,034 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:45:45,038 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:45:45,114 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-13 10:45:45,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:45:45,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:45:45,135 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:45:45,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 10:45:45,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:45:45,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:45:45,189 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:45:45,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 10:45:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-10-13 10:45:45,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:45,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:45,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888300754] [2024-10-13 10:45:45,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888300754] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:45,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1172701437] [2024-10-13 10:45:45,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:45,377 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:45:45,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:45:45,378 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:45:45,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-10-13 10:45:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:45,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 10:45:45,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:45,484 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:45:45,488 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:45:45,576 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:45:45,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 10:45:45,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:45:45,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:45:45,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:45:45,647 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:45:45,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 10:45:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2024-10-13 10:45:45,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:45,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1172701437] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:45,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:45,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 11 [2024-10-13 10:45:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475397874] [2024-10-13 10:45:45,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:45,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:45:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:45,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:45:45,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-10-13 10:45:45,770 INFO L87 Difference]: Start difference. First operand 108 states and 142 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:45:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:46,365 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2024-10-13 10:45:46,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:45:46,365 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-10-13 10:45:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:46,366 INFO L225 Difference]: With dead ends: 175 [2024-10-13 10:45:46,366 INFO L226 Difference]: Without dead ends: 175 [2024-10-13 10:45:46,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=252, Unknown=1, NotChecked=32, Total=342 [2024-10-13 10:45:46,367 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 108 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:46,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 883 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 686 Invalid, 0 Unknown, 190 Unchecked, 0.5s Time] [2024-10-13 10:45:46,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-13 10:45:46,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 107. [2024-10-13 10:45:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.63013698630137) internal successors, (119), 93 states have internal predecessors, (119), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:45:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 140 transitions. [2024-10-13 10:45:46,370 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 140 transitions. Word has length 25 [2024-10-13 10:45:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:46,370 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 140 transitions. [2024-10-13 10:45:46,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:45:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2024-10-13 10:45:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:45:46,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:46,371 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:46,375 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:45:46,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-10-13 10:45:46,772 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 10:45:46,772 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:46,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash -280077995, now seen corresponding path program 1 times [2024-10-13 10:45:46,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:46,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376894625] [2024-10-13 10:45:46,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:46,773 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:45:46,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:46,775 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:45:46,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 (19)] Waiting until timeout for monitored process [2024-10-13 10:45:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:46,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:45:46,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 10:45:46,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:45:46,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:46,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376894625] [2024-10-13 10:45:46,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376894625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:45:46,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:45:46,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:45:46,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311382837] [2024-10-13 10:45:46,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:45:46,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:45:46,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:46,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:45:46,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:46,842 INFO L87 Difference]: Start difference. First operand 107 states and 140 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:45:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:46,884 INFO L93 Difference]: Finished difference Result 139 states and 175 transitions. [2024-10-13 10:45:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:45:46,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-13 10:45:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:46,885 INFO L225 Difference]: With dead ends: 139 [2024-10-13 10:45:46,885 INFO L226 Difference]: Without dead ends: 139 [2024-10-13 10:45:46,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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:45:46,886 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 35 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:46,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 288 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:45:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-13 10:45:46,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 107. [2024-10-13 10:45:46,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 93 states have internal predecessors, (118), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:45:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2024-10-13 10:45:46,891 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 139 transitions. Word has length 25 [2024-10-13 10:45:46,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:46,891 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 139 transitions. [2024-10-13 10:45:46,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:45:46,891 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2024-10-13 10:45:46,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:45:46,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:46,892 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:46,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 (19)] Ended with exit code 0 [2024-10-13 10:45:47,093 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:45:47,093 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:47,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash 607425686, now seen corresponding path program 1 times [2024-10-13 10:45:47,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:47,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456737318] [2024-10-13 10:45:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:47,094 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:45:47,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:47,095 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:45:47,096 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:45:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:47,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:45:47,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:45:47,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 10:45:47,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:47,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456737318] [2024-10-13 10:45:47,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456737318] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:45:47,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:47,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-10-13 10:45:47,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894080577] [2024-10-13 10:45:47,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:47,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:45:47,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:47,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:45:47,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:45:47,417 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:45:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:47,718 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2024-10-13 10:45:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:45:47,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 25 [2024-10-13 10:45:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:47,719 INFO L225 Difference]: With dead ends: 106 [2024-10-13 10:45:47,719 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 10:45:47,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:45:47,720 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 93 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:47,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 258 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:45:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 10:45:47,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-13 10:45:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 73 states have (on average 1.5753424657534247) internal successors, (115), 92 states have internal predecessors, (115), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:45:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 136 transitions. [2024-10-13 10:45:47,728 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 136 transitions. Word has length 25 [2024-10-13 10:45:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:47,728 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 136 transitions. [2024-10-13 10:45:47,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:45:47,728 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2024-10-13 10:45:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:45:47,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:47,729 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:47,734 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 (20)] Ended with exit code 0 [2024-10-13 10:45:47,929 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:45:47,929 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:45:47,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash -92383887, now seen corresponding path program 1 times [2024-10-13 10:45:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:47,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840623565] [2024-10-13 10:45:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:47,931 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:45:47,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:47,933 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:45:47,936 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:45:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:48,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:45:48,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:48,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-10-13 10:45:48,054 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:45:48,131 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-13 10:45:48,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2024-10-13 10:45:48,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:45:48,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2024-10-13 10:45:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 10:45:48,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:48,273 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2024-10-13 10:45:48,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 68 [2024-10-13 10:45:48,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:48,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840623565] [2024-10-13 10:45:48,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840623565] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:48,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2063851733] [2024-10-13 10:45:48,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:48,317 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:45:48,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:45:48,318 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:45:48,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-10-13 10:45:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:48,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:45:48,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:48,423 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:45:48,518 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:45:48,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 10:45:48,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:45:52,607 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|) (_ bv0 32)) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|))) is different from true [2024-10-13 10:45:52,675 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:45:52,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-10-13 10:45:52,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-13 10:45:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-13 10:45:52,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:52,719 INFO L349 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2024-10-13 10:45:52,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-10-13 10:45:52,725 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_251) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) is different from false [2024-10-13 10:45:52,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2063851733] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:52,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:52,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-10-13 10:45:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313788382] [2024-10-13 10:45:52,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:52,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 10:45:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:52,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 10:45:52,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=575, Unknown=2, NotChecked=98, Total=756 [2024-10-13 10:45:52,737 INFO L87 Difference]: Start difference. First operand 106 states and 136 transitions. Second operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 18 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:46:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:46:05,726 INFO L93 Difference]: Finished difference Result 148 states and 182 transitions. [2024-10-13 10:46:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 10:46:05,726 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 18 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2024-10-13 10:46:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:46:05,727 INFO L225 Difference]: With dead ends: 148 [2024-10-13 10:46:05,727 INFO L226 Difference]: Without dead ends: 148 [2024-10-13 10:46:05,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=255, Invalid=1470, Unknown=5, NotChecked=162, Total=1892 [2024-10-13 10:46:05,728 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 232 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:46:05,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 901 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 871 Invalid, 0 Unknown, 135 Unchecked, 0.6s Time] [2024-10-13 10:46:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-13 10:46:05,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 81. [2024-10-13 10:46:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 69 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-13 10:46:05,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2024-10-13 10:46:05,730 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 26 [2024-10-13 10:46:05,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:46:05,731 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2024-10-13 10:46:05,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 18 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:46:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2024-10-13 10:46:05,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:46:05,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:46:05,731 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:46:05,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2024-10-13 10:46:05,935 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 (21)] Forceful destruction successful, exit code 0 [2024-10-13 10:46:06,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:46:06,132 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:46:06,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:46:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash -92383886, now seen corresponding path program 1 times [2024-10-13 10:46:06,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:46:06,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502750205] [2024-10-13 10:46:06,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:46:06,133 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:46:06,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:46:06,134 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:46:06,135 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:46:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:46:06,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 10:46:06,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:46:06,201 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:46:06,242 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:46:06,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 10:46:06,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:46:06,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:46:06,395 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:46:06,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 10:46:06,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-13 10:46:06,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:46:06,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 10:46:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:46:06,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:46:06,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:46:06,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2024-10-13 10:46:06,594 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_8) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) (forall ((v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_274) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_8) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset|))) (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_273) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2024-10-13 10:46:06,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:46:06,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502750205] [2024-10-13 10:46:06,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502750205] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:46:06,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [442963280] [2024-10-13 10:46:06,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:46:06,633 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:46:06,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:46:06,637 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:46:06,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-10-13 10:46:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:46:06,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-13 10:46:06,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:46:06,778 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:46:06,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:46:10,947 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-13 10:46:10,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-13 10:46:11,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:46:11,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:46:11,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-13 10:46:11,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 10:46:11,176 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)))))) is different from true [2024-10-13 10:46:11,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:46:11,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:46:11,218 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-10-13 10:46:11,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-13 10:46:11,359 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-10-13 10:46:11,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 60 [2024-10-13 10:46:11,383 INFO L349 Elim1Store]: treesize reduction 29, result has 31.0 percent of original size [2024-10-13 10:46:11,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 29 [2024-10-13 10:46:11,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-13 10:46:11,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:46:11,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 10:46:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-13 10:46:11,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:46:11,765 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_89| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_89|))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_299) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (select (store |c_#length| |v_ldv_malloc_#res.base_89| v_ArrVal_303) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_300) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))))) (or (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_299) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ldv_malloc_#res.base_89| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_89|)))))) is different from false [2024-10-13 10:46:11,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [442963280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:46:11,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:46:11,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2024-10-13 10:46:11,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865348141] [2024-10-13 10:46:11,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:46:11,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:46:11,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:46:11,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:46:11,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=654, Unknown=23, NotChecked=162, Total=930 [2024-10-13 10:46:11,770 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 22 states have internal predecessors, (38), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:46:15,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:46:19,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:46:23,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:46:28,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:46:32,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:46:36,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:46:40,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:46:44,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:46:48,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:46:52,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:46:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:46:52,854 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2024-10-13 10:46:52,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:46:52,854 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 22 states have internal predecessors, (38), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2024-10-13 10:46:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:46:52,855 INFO L225 Difference]: With dead ends: 120 [2024-10-13 10:46:52,855 INFO L226 Difference]: Without dead ends: 118 [2024-10-13 10:46:52,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=167, Invalid=1009, Unknown=26, NotChecked=204, Total=1406 [2024-10-13 10:46:52,856 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 211 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 41 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 40.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:46:52,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 388 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 547 Invalid, 10 Unknown, 119 Unchecked, 40.8s Time] [2024-10-13 10:46:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-13 10:46:52,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 85. [2024-10-13 10:46:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 73 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-13 10:46:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-10-13 10:46:52,858 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 26 [2024-10-13 10:46:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:46:52,858 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-10-13 10:46:52,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 22 states have internal predecessors, (38), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:46:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-10-13 10:46:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 10:46:52,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:46:52,859 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 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:46:52,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2024-10-13 10:46:53,063 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:46:53,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:46:53,260 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-10-13 10:46:53,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:46:53,260 INFO L85 PathProgramCache]: Analyzing trace with hash 734262462, now seen corresponding path program 1 times [2024-10-13 10:46:53,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:46:53,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677389713] [2024-10-13 10:46:53,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:46:53,260 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:46:53,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:46:53,261 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:46:53,262 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:46:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:46:53,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 10:46:53,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:46:57,618 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_28| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_28|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_28| (_ bv0 1))))) is different from true [2024-10-13 10:46:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 10:46:57,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:46:57,707 INFO L349 Elim1Store]: treesize reduction 86, result has 8.5 percent of original size [2024-10-13 10:46:57,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 80 [2024-10-13 10:47:09,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:47:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677389713] [2024-10-13 10:47:09,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677389713] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:47:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [200292981] [2024-10-13 10:47:09,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:47:09,889 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:47:09,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:47:09,891 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:47:09,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-10-13 10:47:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:47:09,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 10:47:09,985 INFO L278 TraceCheckSpWp]: Computing forward predicates...