./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_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 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_test4-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22dc13e3a229fecb317fd9f602c1cc7d4d730ee1501bd597861fd3e87e82c9e9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:25:18,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:25:18,080 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:25:18,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:25:18,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:25:18,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:25:18,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:25:18,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:25:18,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:25:18,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:25:18,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:25:18,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:25:18,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:25:18,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:25:18,126 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:25:18,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:25:18,126 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:25:18,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:25:18,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:25:18,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:25:18,127 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:25:18,131 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:25:18,132 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:25:18,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:25:18,132 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:25:18,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:25:18,133 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:25:18,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:25:18,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:25:18,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:25:18,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:25:18,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:25:18,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:25:18,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:25:18,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:25:18,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:25:18,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:25:18,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:25:18,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:25:18,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:25:18,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:25:18,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:25:18,137 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 -> 22dc13e3a229fecb317fd9f602c1cc7d4d730ee1501bd597861fd3e87e82c9e9 [2024-10-24 16:25:18,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:25:18,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:25:18,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:25:18,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:25:18,424 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:25:18,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i [2024-10-24 16:25:19,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:25:20,154 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:25:20,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i [2024-10-24 16:25:20,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbc0873fc/5835bcc6bdf940098bd2d90e166e6066/FLAG01eaf15b8 [2024-10-24 16:25:20,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbc0873fc/5835bcc6bdf940098bd2d90e166e6066 [2024-10-24 16:25:20,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:25:20,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:25:20,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:25:20,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:25:20,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:25:20,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:25:20" (1/1) ... [2024-10-24 16:25:20,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50225cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:20, skipping insertion in model container [2024-10-24 16:25:20,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:25:20" (1/1) ... [2024-10-24 16:25:20,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:25:20,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:25:20,714 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-24 16:25:20,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1053c0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:20, skipping insertion in model container [2024-10-24 16:25:20,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:25:20,715 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 16:25:20,717 INFO L158 Benchmark]: Toolchain (without parser) took 521.83ms. Allocated memory is still 161.5MB. Free memory was 93.1MB in the beginning and 124.5MB in the end (delta: -31.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-10-24 16:25:20,718 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:25:20,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.49ms. Allocated memory is still 161.5MB. Free memory was 92.8MB in the beginning and 124.5MB in the end (delta: -31.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-10-24 16:25:20,720 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 113.2MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.49ms. Allocated memory is still 161.5MB. Free memory was 92.8MB in the beginning and 124.5MB in the end (delta: -31.7MB). Peak memory consumption was 9.0MB. 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_test4-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22dc13e3a229fecb317fd9f602c1cc7d4d730ee1501bd597861fd3e87e82c9e9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:25:22,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:25:22,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 16:25:22,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:25:22,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:25:22,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:25:22,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:25:22,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:25:22,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:25:22,923 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:25:22,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:25:22,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:25:22,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:25:22,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:25:22,927 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:25:22,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:25:22,928 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:25:22,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:25:22,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:25:22,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:25:22,931 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:25:22,932 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:25:22,932 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:25:22,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:25:22,933 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:25:22,935 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 16:25:22,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:25:22,936 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 16:25:22,937 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:25:22,937 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:25:22,937 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:25:22,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:25:22,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:25:22,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:25:22,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:25:22,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:25:22,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:25:22,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:25:22,945 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 16:25:22,945 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 16:25:22,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:25:22,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:25:22,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:25:22,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:25:22,946 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 16:25:22,946 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 -> 22dc13e3a229fecb317fd9f602c1cc7d4d730ee1501bd597861fd3e87e82c9e9 [2024-10-24 16:25:23,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:25:23,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:25:23,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:25:23,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:25:23,294 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:25:23,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i [2024-10-24 16:25:24,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:25:25,159 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:25:25,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test4-2.i [2024-10-24 16:25:25,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b56619a/8584bb1b23a6438ca4fa816d64097586/FLAGe77d953eb [2024-10-24 16:25:25,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b56619a/8584bb1b23a6438ca4fa816d64097586 [2024-10-24 16:25:25,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:25:25,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:25:25,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:25:25,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:25:25,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:25:25,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:25:25" (1/1) ... [2024-10-24 16:25:25,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541021e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:25, skipping insertion in model container [2024-10-24 16:25:25,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:25:25" (1/1) ... [2024-10-24 16:25:25,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:25:25,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:25:25,975 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 16:25:25,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:25:26,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:25:26,044 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:25:26,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:25:26,164 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:25:26,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26 WrapperNode [2024-10-24 16:25:26,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:25:26,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:25:26,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:25:26,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:25:26,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26" (1/1) ... [2024-10-24 16:25:26,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26" (1/1) ... [2024-10-24 16:25:26,232 INFO L138 Inliner]: procedures = 165, calls = 71, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 26 [2024-10-24 16:25:26,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:25:26,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:25:26,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:25:26,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:25:26,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26" (1/1) ... [2024-10-24 16:25:26,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26" (1/1) ... [2024-10-24 16:25:26,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26" (1/1) ... [2024-10-24 16:25:26,266 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [0, 2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 0 writes are split as follows [0, 0]. [2024-10-24 16:25:26,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26" (1/1) ... [2024-10-24 16:25:26,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26" (1/1) ... [2024-10-24 16:25:26,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26" (1/1) ... [2024-10-24 16:25:26,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26" (1/1) ... [2024-10-24 16:25:26,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26" (1/1) ... [2024-10-24 16:25:26,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26" (1/1) ... [2024-10-24 16:25:26,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:25:26,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:25:26,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:25:26,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:25:26,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26" (1/1) ... [2024-10-24 16:25:26,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:25:26,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:25:26,318 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-24 16:25:26,321 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-24 16:25:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 16:25:26,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 16:25:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:25:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:25:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:25:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 16:25:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 16:25:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:25:26,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:25:26,530 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:25:26,533 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:25:26,683 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-24 16:25:26,684 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:25:26,708 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:25:26,708 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 16:25:26,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:25:26 BoogieIcfgContainer [2024-10-24 16:25:26,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:25:26,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:25:26,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:25:26,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:25:26,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:25:25" (1/3) ... [2024-10-24 16:25:26,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11455ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:25:26, skipping insertion in model container [2024-10-24 16:25:26,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:25:26" (2/3) ... [2024-10-24 16:25:26,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11455ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:25:26, skipping insertion in model container [2024-10-24 16:25:26,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:25:26" (3/3) ... [2024-10-24 16:25:26,717 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test4-2.i [2024-10-24 16:25:26,733 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:25:26,734 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-24 16:25:26,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:25:26,789 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;@27658f7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:25:26,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-24 16:25:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 15 states have (on average 1.6) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:25:26,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:26,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:26,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2024-10-24 16:25:26,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:26,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1128745653, now seen corresponding path program 1 times [2024-10-24 16:25:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:26,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509652820] [2024-10-24 16:25:26,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:26,825 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-24 16:25:26,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:26,829 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-24 16:25:26,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 16:25:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:26,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:25:26,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:27,010 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-24 16:25:27,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:27,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:27,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509652820] [2024-10-24 16:25:27,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509652820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:27,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:27,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:25:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767694008] [2024-10-24 16:25:27,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:27,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:25:27,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:27,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:25:27,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:25:27,053 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.6) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-24 16:25:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:27,131 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-10-24 16:25:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:25:27,138 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-24 16:25:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:27,150 INFO L225 Difference]: With dead ends: 42 [2024-10-24 16:25:27,150 INFO L226 Difference]: Without dead ends: 41 [2024-10-24 16:25:27,152 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-24 16:25:27,156 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:27,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 75 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:25:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-24 16:25:27,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2024-10-24 16:25:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:25:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-10-24 16:25:27,207 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2024-10-24 16:25:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:27,207 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-10-24 16:25:27,208 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-24 16:25:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-10-24 16:25:27,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:25:27,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:27,210 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:27,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 16:25:27,410 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-24 16:25:27,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2024-10-24 16:25:27,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:27,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2016249334, now seen corresponding path program 1 times [2024-10-24 16:25:27,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:27,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673053831] [2024-10-24 16:25:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:27,413 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-24 16:25:27,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:27,416 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-24 16:25:27,419 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-24 16:25:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:27,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:25:27,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:27,495 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-24 16:25:27,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:27,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673053831] [2024-10-24 16:25:27,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673053831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:27,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:27,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:25:27,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737086576] [2024-10-24 16:25:27,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:27,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:25:27,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:27,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:25:27,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:25:27,501 INFO L87 Difference]: Start difference. First operand 29 states and 32 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-24 16:25:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:27,551 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-10-24 16:25:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:25:27,551 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-24 16:25:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:27,553 INFO L225 Difference]: With dead ends: 39 [2024-10-24 16:25:27,554 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 16:25:27,554 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-24 16:25:27,556 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:27,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 74 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:25:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 16:25:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2024-10-24 16:25:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-10-24 16:25:27,566 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 10 [2024-10-24 16:25:27,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:27,567 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-10-24 16:25:27,567 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-24 16:25:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-10-24 16:25:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:25:27,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:27,568 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:27,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 16:25:27,769 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-24 16:25:27,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2024-10-24 16:25:27,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:27,770 INFO L85 PathProgramCache]: Analyzing trace with hash -391502999, now seen corresponding path program 1 times [2024-10-24 16:25:27,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:27,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973720218] [2024-10-24 16:25:27,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:27,771 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-24 16:25:27,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:27,775 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-24 16:25:27,777 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-24 16:25:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:27,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:25:27,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:27,862 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-24 16:25:27,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:27,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:27,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973720218] [2024-10-24 16:25:27,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973720218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:27,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:27,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:25:27,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917118529] [2024-10-24 16:25:27,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:27,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:25:27,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:27,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:25:27,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:25:27,864 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-24 16:25:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:27,892 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-10-24 16:25:27,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:25:27,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 15 [2024-10-24 16:25:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:27,893 INFO L225 Difference]: With dead ends: 24 [2024-10-24 16:25:27,894 INFO L226 Difference]: Without dead ends: 24 [2024-10-24 16:25:27,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-24 16:25:27,895 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:27,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:25:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-24 16:25:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-24 16:25:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-10-24 16:25:27,899 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2024-10-24 16:25:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:27,900 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-10-24 16:25:27,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-24 16:25:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-10-24 16:25:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:25:27,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:27,901 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:27,905 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-24 16:25:28,102 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-24 16:25:28,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2024-10-24 16:25:28,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:28,103 INFO L85 PathProgramCache]: Analyzing trace with hash 748308968, now seen corresponding path program 1 times [2024-10-24 16:25:28,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:28,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396950333] [2024-10-24 16:25:28,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:28,104 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-24 16:25:28,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:28,107 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-24 16:25:28,108 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-24 16:25:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:28,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:25:28,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:28,620 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-24 16:25:28,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:28,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:28,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396950333] [2024-10-24 16:25:28,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396950333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:28,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:28,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:25:28,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818727948] [2024-10-24 16:25:28,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:28,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:25:28,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:28,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:25:28,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:25:28,623 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 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-24 16:25:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:28,816 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-10-24 16:25:28,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:25:28,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 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-24 16:25:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:28,818 INFO L225 Difference]: With dead ends: 45 [2024-10-24 16:25:28,818 INFO L226 Difference]: Without dead ends: 45 [2024-10-24 16:25:28,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:25:28,819 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:28,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:25:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-24 16:25:28,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2024-10-24 16:25:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:25:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-10-24 16:25:28,827 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 16 [2024-10-24 16:25:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:28,828 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-10-24 16:25:28,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 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-24 16:25:28,828 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-10-24 16:25:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:25:28,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:28,829 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:28,835 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-24 16:25:29,030 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-24 16:25:29,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2024-10-24 16:25:29,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash 483535112, now seen corresponding path program 1 times [2024-10-24 16:25:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:29,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172288815] [2024-10-24 16:25:29,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:29,031 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-24 16:25:29,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:29,032 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-24 16:25:29,033 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-24 16:25:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:29,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:25:29,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:29,176 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-24 16:25:29,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:29,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:29,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172288815] [2024-10-24 16:25:29,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172288815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:29,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:29,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:25:29,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268669989] [2024-10-24 16:25:29,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:29,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:25:29,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:29,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:25:29,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:25:29,183 INFO L87 Difference]: Start difference. First operand 34 states and 38 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-24 16:25:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:29,212 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-10-24 16:25:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:25:29,214 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-24 16:25:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:29,215 INFO L225 Difference]: With dead ends: 31 [2024-10-24 16:25:29,215 INFO L226 Difference]: Without dead ends: 27 [2024-10-24 16:25:29,215 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-24 16:25:29,216 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:29,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:25:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-24 16:25:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-24 16:25:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:25:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-10-24 16:25:29,221 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2024-10-24 16:25:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:29,222 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-10-24 16:25:29,222 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-24 16:25:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-10-24 16:25:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:25:29,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:29,223 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:29,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 16:25:29,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:25:29,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2024-10-24 16:25:29,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1722741579, now seen corresponding path program 1 times [2024-10-24 16:25:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:29,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319967683] [2024-10-24 16:25:29,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:29,428 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-24 16:25:29,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:29,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:25:29,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 16:25:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:29,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:25:29,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:29,500 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-24 16:25:29,533 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-24 16:25:29,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:29,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319967683] [2024-10-24 16:25:29,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319967683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:29,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:29,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:25:29,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714568125] [2024-10-24 16:25:29,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:29,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:25:29,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:29,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:25:29,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:25:29,536 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-24 16:25:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:29,580 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-10-24 16:25:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:25:29,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 17 [2024-10-24 16:25:29,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:29,581 INFO L225 Difference]: With dead ends: 31 [2024-10-24 16:25:29,583 INFO L226 Difference]: Without dead ends: 31 [2024-10-24 16:25:29,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-24 16:25:29,584 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:29,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:25:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-24 16:25:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-24 16:25:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:25:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-10-24 16:25:29,592 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 17 [2024-10-24 16:25:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:29,593 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-10-24 16:25:29,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-24 16:25:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-10-24 16:25:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:25:29,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:29,595 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:29,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 16:25:29,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:25:29,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2024-10-24 16:25:29,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:29,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1684722036, now seen corresponding path program 1 times [2024-10-24 16:25:29,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:29,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112277764] [2024-10-24 16:25:29,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:29,797 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-24 16:25:29,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:29,800 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-24 16:25:29,801 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-24 16:25:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:29,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:25:29,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:29,882 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-24 16:25:29,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:29,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:29,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112277764] [2024-10-24 16:25:29,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112277764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:29,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:29,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:25:29,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656039615] [2024-10-24 16:25:29,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:29,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:25:29,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:29,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:25:29,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:25:29,885 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-24 16:25:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:29,910 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-10-24 16:25:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:25:29,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 17 [2024-10-24 16:25:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:29,912 INFO L225 Difference]: With dead ends: 30 [2024-10-24 16:25:29,912 INFO L226 Difference]: Without dead ends: 30 [2024-10-24 16:25:29,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-24 16:25:29,913 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:29,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:25:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-24 16:25:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-10-24 16:25:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:25:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-10-24 16:25:29,917 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 17 [2024-10-24 16:25:29,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:29,917 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-10-24 16:25:29,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-24 16:25:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-10-24 16:25:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:25:29,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:29,918 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:29,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 16:25:30,122 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-24 16:25:30,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2024-10-24 16:25:30,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:30,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1865381450, now seen corresponding path program 1 times [2024-10-24 16:25:30,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:30,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718282992] [2024-10-24 16:25:30,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:30,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:25:30,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:30,127 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-24 16:25:30,128 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-24 16:25:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:30,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:25:30,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:30,210 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-24 16:25:30,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:25:30,249 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-24 16:25:30,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718282992] [2024-10-24 16:25:30,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718282992] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:25:30,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:25:30,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-10-24 16:25:30,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242243891] [2024-10-24 16:25:30,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:25:30,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:25:30,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:30,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:25:30,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:25:30,251 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:30,274 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-10-24 16:25:30,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:25:30,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-24 16:25:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:30,275 INFO L225 Difference]: With dead ends: 25 [2024-10-24 16:25:30,275 INFO L226 Difference]: Without dead ends: 25 [2024-10-24 16:25:30,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-24 16:25:30,276 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:30,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:25:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-24 16:25:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-24 16:25:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:25:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-10-24 16:25:30,282 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2024-10-24 16:25:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:30,283 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-10-24 16:25:30,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-10-24 16:25:30,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 16:25:30,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:30,284 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:30,286 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 (9)] Forceful destruction successful, exit code 0 [2024-10-24 16:25:30,485 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-24 16:25:30,485 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2024-10-24 16:25:30,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:30,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1992250157, now seen corresponding path program 1 times [2024-10-24 16:25:30,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:30,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632993355] [2024-10-24 16:25:30,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:30,486 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-24 16:25:30,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:30,488 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-24 16:25:30,488 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-24 16:25:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:30,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:25:30,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:30,703 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-24 16:25:30,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:25:30,793 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-24 16:25:30,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:30,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632993355] [2024-10-24 16:25:30,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632993355] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:25:30,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:25:30,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-10-24 16:25:30,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444698208] [2024-10-24 16:25:30,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:25:30,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:25:30,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:30,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:25:30,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:25:30,796 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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-24 16:25:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:30,941 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-10-24 16:25:30,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:25:30,942 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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 19 [2024-10-24 16:25:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:30,942 INFO L225 Difference]: With dead ends: 24 [2024-10-24 16:25:30,942 INFO L226 Difference]: Without dead ends: 24 [2024-10-24 16:25:30,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 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-24 16:25:30,943 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:30,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 58 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:25:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-24 16:25:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-24 16:25:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:25:30,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-10-24 16:25:30,949 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2024-10-24 16:25:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:30,949 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-10-24 16:25:30,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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-24 16:25:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-10-24 16:25:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:25:30,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:30,950 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:30,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-24 16:25:31,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:25:31,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2024-10-24 16:25:31,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:31,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1630212780, now seen corresponding path program 1 times [2024-10-24 16:25:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:31,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366236710] [2024-10-24 16:25:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:31,152 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-24 16:25:31,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:31,155 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:25:31,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 16:25:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:31,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:25:31,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:31,218 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-24 16:25:31,323 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-24 16:25:31,323 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-24 16:25:31,405 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 16 treesize of output 13 [2024-10-24 16:25:31,415 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-24 16:25:31,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:25:31,734 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-24 16:25:31,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:31,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366236710] [2024-10-24 16:25:31,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366236710] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:25:31,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:25:31,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2024-10-24 16:25:31,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876353800] [2024-10-24 16:25:31,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:25:31,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:25:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:31,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:25:31,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:25:31,737 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-24 16:25:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:31,860 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-10-24 16:25:31,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:25:31,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 20 [2024-10-24 16:25:31,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:31,862 INFO L225 Difference]: With dead ends: 31 [2024-10-24 16:25:31,862 INFO L226 Difference]: Without dead ends: 31 [2024-10-24 16:25:31,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:25:31,863 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:31,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:25:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-24 16:25:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-24 16:25:31,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:25:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-10-24 16:25:31,867 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 20 [2024-10-24 16:25:31,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:31,867 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-10-24 16:25:31,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-24 16:25:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-10-24 16:25:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:25:31,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:31,868 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-24 16:25:31,873 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 (11)] Ended with exit code 0 [2024-10-24 16:25:32,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:25:32,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2024-10-24 16:25:32,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1433699275, now seen corresponding path program 1 times [2024-10-24 16:25:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:32,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195285164] [2024-10-24 16:25:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:32,072 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-24 16:25:32,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:32,074 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-24 16:25:32,075 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-24 16:25:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:32,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:25:32,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:32,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-10-24 16:25:32,275 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 16 treesize of output 13 [2024-10-24 16:25:32,287 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-24 16:25:32,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:25:32,549 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-24 16:25:32,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195285164] [2024-10-24 16:25:32,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195285164] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:25:32,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:25:32,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-10-24 16:25:32,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067155996] [2024-10-24 16:25:32,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:25:32,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 16:25:32,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:32,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 16:25:32,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:25:32,552 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (3), 3 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-24 16:25:32,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:32,723 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-10-24 16:25:32,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:25:32,723 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), 2 states have call successors, (3), 3 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 20 [2024-10-24 16:25:32,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:32,724 INFO L225 Difference]: With dead ends: 30 [2024-10-24 16:25:32,724 INFO L226 Difference]: Without dead ends: 30 [2024-10-24 16:25:32,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:25:32,725 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:32,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:25:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-24 16:25:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2024-10-24 16:25:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:25:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-10-24 16:25:32,727 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2024-10-24 16:25:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:32,728 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-10-24 16:25:32,728 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), 2 states have call successors, (3), 3 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-24 16:25:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-10-24 16:25:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 16:25:32,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:32,728 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:32,732 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-24 16:25:32,929 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-24 16:25:32,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2024-10-24 16:25:32,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:32,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1028579505, now seen corresponding path program 1 times [2024-10-24 16:25:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738959034] [2024-10-24 16:25:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:32,930 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-24 16:25:32,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:32,931 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-24 16:25:32,932 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-24 16:25:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:32,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:25:32,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:37,351 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~p~0#1.base_17| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~p~0#1.base_17|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~p~0#1.base_17| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-24 16:25:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:25:37,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:37,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:37,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738959034] [2024-10-24 16:25:37,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738959034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:37,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:37,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:25:37,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979101140] [2024-10-24 16:25:37,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:37,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:25:37,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:37,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:25:37,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=72, Unknown=2, NotChecked=16, Total=110 [2024-10-24 16:25:37,360 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:41,405 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-24 16:25:45,414 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-24 16:25:49,432 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-24 16:25:53,440 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-24 16:25:57,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:26:01,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:26:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:26:01,901 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2024-10-24 16:26:01,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:26:01,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-24 16:26:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:26:01,902 INFO L225 Difference]: With dead ends: 32 [2024-10-24 16:26:01,902 INFO L226 Difference]: Without dead ends: 23 [2024-10-24 16:26:01,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=23, Invalid=89, Unknown=2, NotChecked=18, Total=132 [2024-10-24 16:26:01,903 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:26:01,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 89 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 7 Unknown, 28 Unchecked, 24.5s Time] [2024-10-24 16:26:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-24 16:26:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-24 16:26:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-24 16:26:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-10-24 16:26:01,906 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 22 [2024-10-24 16:26:01,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:26:01,906 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-10-24 16:26:01,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:26:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-10-24 16:26:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 16:26:01,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:26:01,907 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:26:01,911 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-24 16:26:02,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:26:02,108 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 4 more)] === [2024-10-24 16:26:02,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:26:02,108 INFO L85 PathProgramCache]: Analyzing trace with hash -899496786, now seen corresponding path program 1 times [2024-10-24 16:26:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:26:02,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045513378] [2024-10-24 16:26:02,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:26:02,109 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-24 16:26:02,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:26:02,110 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:26:02,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 16:26:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:26:02,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:26:02,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:26:02,497 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32)) (_ bv0 1)) (exists ((|v_ULTIMATE.start_entry_point_~p~0#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 1))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~p~0#1.base_18|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32) (_ bv0 1)) |v_ULTIMATE.start_entry_point_~p~0#1.base_18| (_ bv0 1))) (= (_ bv0 1) (bvadd v_DerPreprocessor_6 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~p~0#1.base_18| v_DerPreprocessor_6) (_ bv0 32) (_ bv0 1)) |v_ULTIMATE.start_entry_point_~p~0#1.base_18|)))))) is different from true [2024-10-24 16:26:02,513 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-24 16:26:02,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:26:02,855 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret42#1.base_26| (_ BitVec 32))) (or (= (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) |v_ULTIMATE.start_entry_point_#t~ret42#1.base_26| (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret42#1.base_26|))))) is different from false [2024-10-24 16:26:02,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:26:02,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045513378] [2024-10-24 16:26:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045513378] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:26:02,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [303765780] [2024-10-24 16:26:02,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:26:02,858 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:26:02,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:26:02,861 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:26:02,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-10-24 16:26:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:26:02,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:26:02,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:26:03,129 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32)) (_ bv0 1)) (exists ((v_DerPreprocessor_8 (_ BitVec 1)) (|v_ULTIMATE.start_entry_point_~p~0#1.base_21| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd v_DerPreprocessor_8 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~p~0#1.base_21| v_DerPreprocessor_8) (_ bv0 32) (_ bv0 1)) |v_ULTIMATE.start_entry_point_~p~0#1.base_21|))) (= (store (store |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32) (_ bv0 1)) |v_ULTIMATE.start_entry_point_~p~0#1.base_21| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~p~0#1.base_21|))))) is different from true [2024-10-24 16:26:03,147 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-24 16:26:03,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:26:03,295 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret42#1.base_30| (_ BitVec 32))) (or (= (store (store |c_#valid| (_ bv0 32) (_ bv0 1)) |v_ULTIMATE.start_entry_point_#t~ret42#1.base_30| (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret42#1.base_30|))))) is different from false [2024-10-24 16:26:03,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [303765780] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:26:03,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:26:03,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2024-10-24 16:26:03,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287613680] [2024-10-24 16:26:03,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:26:03,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:26:03,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:26:03,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:26:03,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=292, Unknown=4, NotChecked=148, Total=506 [2024-10-24 16:26:03,299 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:26:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:26:03,440 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-10-24 16:26:03,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:26:03,441 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-24 16:26:03,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:26:03,441 INFO L225 Difference]: With dead ends: 22 [2024-10-24 16:26:03,441 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 16:26:03,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=292, Unknown=4, NotChecked=148, Total=506 [2024-10-24 16:26:03,442 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:26:03,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2024-10-24 16:26:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 16:26:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 16:26:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:26:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 16:26:03,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-10-24 16:26:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:26:03,443 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 16:26:03,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:26:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 16:26:03,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 16:26:03,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (6 of 7 remaining) [2024-10-24 16:26:03,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (5 of 7 remaining) [2024-10-24 16:26:03,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (4 of 7 remaining) [2024-10-24 16:26:03,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (3 of 7 remaining) [2024-10-24 16:26:03,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (2 of 7 remaining) [2024-10-24 16:26:03,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (1 of 7 remaining) [2024-10-24 16:26:03,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-24 16:26:03,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-10-24 16:26:03,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 16:26:03,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:26:03,851 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:26:03,853 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 16:26:03,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:26:03 BoogieIcfgContainer [2024-10-24 16:26:03,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 16:26:03,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 16:26:03,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 16:26:03,856 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 16:26:03,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:25:26" (3/4) ... [2024-10-24 16:26:03,858 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 16:26:03,861 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-10-24 16:26:03,864 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-24 16:26:03,864 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 16:26:03,864 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-24 16:26:03,944 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 16:26:03,945 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 16:26:03,945 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 16:26:03,946 INFO L158 Benchmark]: Toolchain (without parser) took 38516.20ms. Allocated memory was 58.7MB in the beginning and 92.3MB in the end (delta: 33.6MB). Free memory was 36.9MB in the beginning and 59.2MB in the end (delta: -22.3MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-10-24 16:26:03,946 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 58.7MB. Free memory was 33.3MB in the beginning and 33.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:26:03,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 735.08ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 36.8MB in the beginning and 39.9MB in the end (delta: -3.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 16:26:03,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.23ms. Allocated memory is still 75.5MB. Free memory was 39.6MB in the beginning and 37.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:26:03,948 INFO L158 Benchmark]: Boogie Preprocessor took 48.98ms. Allocated memory is still 75.5MB. Free memory was 37.5MB in the beginning and 35.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:26:03,948 INFO L158 Benchmark]: RCFGBuilder took 426.19ms. Allocated memory is still 75.5MB. Free memory was 35.5MB in the beginning and 43.8MB in the end (delta: -8.4MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-10-24 16:26:03,948 INFO L158 Benchmark]: TraceAbstraction took 37144.83ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 43.2MB in the beginning and 64.0MB in the end (delta: -20.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:26:03,951 INFO L158 Benchmark]: Witness Printer took 89.11ms. Allocated memory is still 92.3MB. Free memory was 64.0MB in the beginning and 59.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 16:26:03,952 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 58.7MB. Free memory was 33.3MB in the beginning and 33.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 735.08ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 36.8MB in the beginning and 39.9MB in the end (delta: -3.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.23ms. Allocated memory is still 75.5MB. Free memory was 39.6MB in the beginning and 37.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.98ms. Allocated memory is still 75.5MB. Free memory was 37.5MB in the beginning and 35.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 426.19ms. Allocated memory is still 75.5MB. Free memory was 35.5MB in the beginning and 43.8MB in the end (delta: -8.4MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * TraceAbstraction took 37144.83ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 43.2MB in the beginning and 64.0MB in the end (delta: -20.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 89.11ms. Allocated memory is still 92.3MB. Free memory was 64.0MB in the beginning and 59.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 761]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 761]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 761]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 765]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 37.1s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 25.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 884 SdHoareTripleChecker+Invalid, 25.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 64 IncrementalHoareTripleChecker+Unchecked, 634 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 743 IncrementalHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 250 mSDtfsCounter, 743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 249 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=4, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 46 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 303 ConstructedInterpolants, 38 QuantifiedInterpolants, 2415 SizeOfPredicates, 1 NumberOfNonLiveVariables, 774 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 44/64 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-24 16:26:03,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE