./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test14_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/ldv-memsafety/memleaks_test14_3.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 12d7333ecc5650929161cd50df756e255d5b3c2b6fe8799d2d7337cf38a3a1cb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:46:41,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:46:41,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 18:46:41,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:46:41,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:46:41,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:46:41,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:46:41,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:46:41,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:46:41,706 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:46:41,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:46:41,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:46:41,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:46:41,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:46:41,707 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:46:41,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:46:41,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:46:41,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:46:41,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:46:41,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:46:41,709 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:46:41,710 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:46:41,710 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:46:41,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:46:41,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:46:41,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:46:41,711 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:46:41,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:46:41,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:46:41,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:46:41,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:46:41,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:46:41,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:46:41,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:46:41,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:46:41,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:46:41,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:46:41,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:46:41,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:46:41,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:46:41,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:46:41,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:46:41,718 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 -> 12d7333ecc5650929161cd50df756e255d5b3c2b6fe8799d2d7337cf38a3a1cb [2024-11-22 18:46:41,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:46:41,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:46:41,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:46:41,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:46:41,948 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:46:41,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14_3.i [2024-11-22 18:46:43,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:46:43,368 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:46:43,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14_3.i [2024-11-22 18:46:43,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8399612e2/a13590370c2443b4b0671701dd6ed80c/FLAGb6d8fce9b [2024-11-22 18:46:43,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8399612e2/a13590370c2443b4b0671701dd6ed80c [2024-11-22 18:46:43,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:46:43,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:46:43,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:46:43,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:46:43,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:46:43,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:46:43" (1/1) ... [2024-11-22 18:46:43,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f82be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:43, skipping insertion in model container [2024-11-22 18:46:43,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:46:43" (1/1) ... [2024-11-22 18:46:43,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:46:44,050 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:46:44,100 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:46:44,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:46:44,125 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-22 18:46:44,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7b5e4335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:44, skipping insertion in model container [2024-11-22 18:46:44,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:46:44,126 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 18:46:44,131 INFO L158 Benchmark]: Toolchain (without parser) took 409.22ms. Allocated memory is still 163.6MB. Free memory was 105.4MB in the beginning and 88.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 18:46:44,131 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:46:44,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.73ms. Allocated memory is still 163.6MB. Free memory was 105.0MB in the beginning and 88.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 18:46:44,133 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 163.6MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.73ms. Allocated memory is still 163.6MB. Free memory was 105.0MB in the beginning and 88.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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 ../sv-benchmarks/c/ldv-memsafety/memleaks_test14_3.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 12d7333ecc5650929161cd50df756e255d5b3c2b6fe8799d2d7337cf38a3a1cb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:46:45,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:46:45,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 18:46:45,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:46:45,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:46:45,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:46:45,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:46:45,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:46:45,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:46:45,827 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:46:45,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:46:45,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:46:45,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:46:45,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:46:45,831 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:46:45,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:46:45,831 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:46:45,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:46:45,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:46:45,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:46:45,832 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:46:45,832 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:46:45,832 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:46:45,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:46:45,833 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:46:45,833 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 18:46:45,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:46:45,835 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 18:46:45,836 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:46:45,836 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:46:45,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:46:45,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:46:45,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:46:45,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:46:45,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:46:45,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:46:45,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:46:45,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:46:45,837 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 18:46:45,837 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 18:46:45,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:46:45,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:46:45,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:46:45,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:46:45,839 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 -> 12d7333ecc5650929161cd50df756e255d5b3c2b6fe8799d2d7337cf38a3a1cb [2024-11-22 18:46:46,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:46:46,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:46:46,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:46:46,096 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:46:46,096 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:46:46,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14_3.i [2024-11-22 18:46:47,369 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:46:47,571 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:46:47,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14_3.i [2024-11-22 18:46:47,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9e753d7a/27cfa41b71f8451cba7e26e9032fecea/FLAG5b35fcdd0 [2024-11-22 18:46:47,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9e753d7a/27cfa41b71f8451cba7e26e9032fecea [2024-11-22 18:46:47,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:46:47,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:46:47,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:46:47,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:46:47,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:46:47,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:46:47" (1/1) ... [2024-11-22 18:46:47,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b25e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:47, skipping insertion in model container [2024-11-22 18:46:47,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:46:47" (1/1) ... [2024-11-22 18:46:47,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:46:47,911 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:46:47,951 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:46:47,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:46:47,973 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 18:46:47,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:46:47,994 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:46:48,008 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:46:48,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:46:48,016 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:46:48,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:46:48,102 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:46:48,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48 WrapperNode [2024-11-22 18:46:48,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:46:48,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:46:48,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:46:48,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:46:48,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48" (1/1) ... [2024-11-22 18:46:48,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48" (1/1) ... [2024-11-22 18:46:48,156 INFO L138 Inliner]: procedures = 168, calls = 79, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 58 [2024-11-22 18:46:48,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:46:48,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:46:48,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:46:48,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:46:48,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48" (1/1) ... [2024-11-22 18:46:48,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48" (1/1) ... [2024-11-22 18:46:48,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48" (1/1) ... [2024-11-22 18:46:48,195 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 6 writes are split as follows [0, 6]. [2024-11-22 18:46:48,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48" (1/1) ... [2024-11-22 18:46:48,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48" (1/1) ... [2024-11-22 18:46:48,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48" (1/1) ... [2024-11-22 18:46:48,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48" (1/1) ... [2024-11-22 18:46:48,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48" (1/1) ... [2024-11-22 18:46:48,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48" (1/1) ... [2024-11-22 18:46:48,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:46:48,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:46:48,228 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:46:48,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:46:48,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48" (1/1) ... [2024-11-22 18:46:48,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:46:48,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:46:48,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 18:46:48,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 18:46:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-22 18:46:48,301 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-22 18:46:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-22 18:46:48,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-22 18:46:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-22 18:46:48,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-22 18:46:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:46:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:46:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 18:46:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:46:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:46:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:46:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:46:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:46:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 18:46:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 18:46:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-22 18:46:48,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-22 18:46:48,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:46:48,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:46:48,438 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:46:48,441 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:46:48,685 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-11-22 18:46:48,686 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:46:48,698 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:46:48,698 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 18:46:48,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:46:48 BoogieIcfgContainer [2024-11-22 18:46:48,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:46:48,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:46:48,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:46:48,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:46:48,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:46:47" (1/3) ... [2024-11-22 18:46:48,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23668481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:46:48, skipping insertion in model container [2024-11-22 18:46:48,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:46:48" (2/3) ... [2024-11-22 18:46:48,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23668481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:46:48, skipping insertion in model container [2024-11-22 18:46:48,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:46:48" (3/3) ... [2024-11-22 18:46:48,706 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test14_3.i [2024-11-22 18:46:48,719 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:46:48,719 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-11-22 18:46:48,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:46:48,765 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;@623dd3dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:46:48,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-22 18:46:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 65 states have internal predecessors, (68), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:46:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:46:48,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:48,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:48,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:46:48,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:48,785 INFO L85 PathProgramCache]: Analyzing trace with hash -337982034, now seen corresponding path program 1 times [2024-11-22 18:46:48,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:48,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166290982] [2024-11-22 18:46:48,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:48,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:48,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:48,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:46:48,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 18:46:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:48,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 18:46:48,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:48,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:46:48,980 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-11-22 18:46:49,023 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-22 18:46:49,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-22 18:46:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:49,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:49,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:49,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166290982] [2024-11-22 18:46:49,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166290982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:49,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:49,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:46:49,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672150044] [2024-11-22 18:46:49,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:49,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:46:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:49,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:46:49,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2024-11-22 18:46:49,100 INFO L87 Difference]: Start difference. First operand has 73 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 65 states have internal predecessors, (68), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:49,359 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2024-11-22 18:46:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:46:49,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-22 18:46:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:49,367 INFO L225 Difference]: With dead ends: 74 [2024-11-22 18:46:49,367 INFO L226 Difference]: Without dead ends: 72 [2024-11-22 18:46:49,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2024-11-22 18:46:49,370 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 46 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:49,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 107 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 203 Invalid, 0 Unknown, 82 Unchecked, 0.2s Time] [2024-11-22 18:46:49,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-22 18:46:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-11-22 18:46:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 62 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:46:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2024-11-22 18:46:49,413 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 12 [2024-11-22 18:46:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:49,414 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2024-11-22 18:46:49,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2024-11-22 18:46:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:46:49,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:49,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:49,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 18:46:49,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:49,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:46:49,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:49,618 INFO L85 PathProgramCache]: Analyzing trace with hash -337982033, now seen corresponding path program 1 times [2024-11-22 18:46:49,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:49,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809328398] [2024-11-22 18:46:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:49,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:49,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:49,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:46:49,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 18:46:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:49,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 18:46:49,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:49,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:46:49,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:46:49,765 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-22 18:46:49,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:46:49,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:46:49,810 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 18:46:49,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-22 18:46:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:49,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:49,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:49,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809328398] [2024-11-22 18:46:49,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809328398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:49,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:49,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:46:49,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211913138] [2024-11-22 18:46:49,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:49,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:46:49,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:49,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:46:49,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-22 18:46:49,869 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:50,163 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2024-11-22 18:46:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:46:50,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-22 18:46:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:50,165 INFO L225 Difference]: With dead ends: 75 [2024-11-22 18:46:50,165 INFO L226 Difference]: Without dead ends: 75 [2024-11-22 18:46:50,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2024-11-22 18:46:50,166 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 47 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:50,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 131 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 190 Invalid, 0 Unknown, 87 Unchecked, 0.2s Time] [2024-11-22 18:46:50,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-22 18:46:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2024-11-22 18:46:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 61 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:46:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2024-11-22 18:46:50,175 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 12 [2024-11-22 18:46:50,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:50,176 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2024-11-22 18:46:50,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2024-11-22 18:46:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 18:46:50,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:50,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:50,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 18:46:50,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:50,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:46:50,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:50,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1812016232, now seen corresponding path program 1 times [2024-11-22 18:46:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:50,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424851000] [2024-11-22 18:46:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:50,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:50,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:50,382 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:46:50,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 18:46:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:50,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:46:50,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:50,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:50,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:50,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424851000] [2024-11-22 18:46:50,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424851000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:50,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:50,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:46:50,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923746768] [2024-11-22 18:46:50,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:50,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:46:50,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:50,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:46:50,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:46:50,467 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:50,484 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-11-22 18:46:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:46:50,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-22 18:46:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:50,485 INFO L225 Difference]: With dead ends: 75 [2024-11-22 18:46:50,485 INFO L226 Difference]: Without dead ends: 75 [2024-11-22 18:46:50,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:46:50,486 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:50,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:46:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-22 18:46:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-11-22 18:46:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 40 states have (on average 1.65) internal successors, (66), 64 states have internal predecessors, (66), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 18:46:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2024-11-22 18:46:50,492 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 11 [2024-11-22 18:46:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:50,493 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2024-11-22 18:46:50,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2024-11-22 18:46:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 18:46:50,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:50,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:50,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 18:46:50,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:50,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:46:50,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash -924512551, now seen corresponding path program 1 times [2024-11-22 18:46:50,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:50,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537275722] [2024-11-22 18:46:50,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:50,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:50,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:50,697 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:46:50,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 18:46:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:50,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:46:50,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:50,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:46:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:50,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:50,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:50,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537275722] [2024-11-22 18:46:50,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537275722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:50,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:50,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:46:50,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919390679] [2024-11-22 18:46:50,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:50,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:46:50,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:50,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:46:50,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:46:50,790 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:50,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:50,993 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-11-22 18:46:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:46:50,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-22 18:46:50,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:50,994 INFO L225 Difference]: With dead ends: 95 [2024-11-22 18:46:50,994 INFO L226 Difference]: Without dead ends: 95 [2024-11-22 18:46:50,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:46:50,995 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 62 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:50,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 81 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:46:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-22 18:46:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 76. [2024-11-22 18:46:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 66 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:46:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-22 18:46:51,000 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 11 [2024-11-22 18:46:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:51,001 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-22 18:46:51,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-22 18:46:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 18:46:51,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:51,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:51,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-22 18:46:51,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:51,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:46:51,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:51,203 INFO L85 PathProgramCache]: Analyzing trace with hash -924512550, now seen corresponding path program 1 times [2024-11-22 18:46:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:51,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026213095] [2024-11-22 18:46:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:51,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:51,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:51,206 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:46:51,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 18:46:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:51,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 18:46:51,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:51,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:46:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:51,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:51,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:51,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026213095] [2024-11-22 18:46:51,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026213095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:51,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:51,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:46:51,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047711556] [2024-11-22 18:46:51,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:51,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:46:51,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:51,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:46:51,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:46:51,291 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:51,493 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-22 18:46:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:46:51,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-22 18:46:51,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:51,495 INFO L225 Difference]: With dead ends: 89 [2024-11-22 18:46:51,495 INFO L226 Difference]: Without dead ends: 89 [2024-11-22 18:46:51,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:46:51,496 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 49 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:51,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 91 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:46:51,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-22 18:46:51,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2024-11-22 18:46:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 42 states have (on average 1.619047619047619) internal successors, (68), 66 states have internal predecessors, (68), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:46:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2024-11-22 18:46:51,502 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 11 [2024-11-22 18:46:51,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:51,502 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2024-11-22 18:46:51,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2024-11-22 18:46:51,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 18:46:51,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:51,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:51,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-22 18:46:51,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:51,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:46:51,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:51,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1419374640, now seen corresponding path program 1 times [2024-11-22 18:46:51,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:51,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532030875] [2024-11-22 18:46:51,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:51,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:51,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:51,711 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:46:51,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 18:46:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:51,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 18:46:51,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:55,786 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|) |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|)) is different from true [2024-11-22 18:46:55,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 18:46:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:55,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:55,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:55,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532030875] [2024-11-22 18:46:55,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532030875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:55,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:55,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:46:55,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007214932] [2024-11-22 18:46:55,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:55,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:46:55,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:55,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:46:55,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=44, Unknown=1, NotChecked=12, Total=72 [2024-11-22 18:46:55,859 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:56,068 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2024-11-22 18:46:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:46:56,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-22 18:46:56,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:56,069 INFO L225 Difference]: With dead ends: 76 [2024-11-22 18:46:56,069 INFO L226 Difference]: Without dead ends: 76 [2024-11-22 18:46:56,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-22 18:46:56,070 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:56,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 287 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 99 Unchecked, 0.2s Time] [2024-11-22 18:46:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-22 18:46:56,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2024-11-22 18:46:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 65 states have internal predecessors, (67), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:46:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-22 18:46:56,075 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 15 [2024-11-22 18:46:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:56,075 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-22 18:46:56,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-22 18:46:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 18:46:56,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:56,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:56,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 18:46:56,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:56,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:46:56,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:56,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1419374639, now seen corresponding path program 1 times [2024-11-22 18:46:56,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:56,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687455463] [2024-11-22 18:46:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:56,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:56,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:56,279 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:46:56,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 18:46:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:56,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 18:46:56,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:56,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:46:56,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:46:56,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-22 18:46:56,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:46:56,421 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) (exists ((|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)))))) is different from true [2024-11-22 18:46:56,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:46:56,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:46:56,489 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 18:46:56,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-22 18:46:56,674 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 18:46:56,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2024-11-22 18:46:56,680 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 18:46:56,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 18:46:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:56,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:56,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:56,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687455463] [2024-11-22 18:46:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687455463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:56,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:56,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 18:46:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353627268] [2024-11-22 18:46:56,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:56,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:46:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:56,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:46:56,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=73, Unknown=1, NotChecked=16, Total=110 [2024-11-22 18:46:56,741 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:57,370 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-11-22 18:46:57,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 18:46:57,370 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-22 18:46:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:57,371 INFO L225 Difference]: With dead ends: 75 [2024-11-22 18:46:57,371 INFO L226 Difference]: Without dead ends: 75 [2024-11-22 18:46:57,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=165, Unknown=1, NotChecked=26, Total=240 [2024-11-22 18:46:57,372 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:57,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 322 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2024-11-22 18:46:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-22 18:46:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-22 18:46:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 64 states have internal predecessors, (66), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:46:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-11-22 18:46:57,377 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 15 [2024-11-22 18:46:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:57,378 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-11-22 18:46:57,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-11-22 18:46:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:46:57,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:57,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:57,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 18:46:57,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:57,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:46:57,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1050940882, now seen corresponding path program 1 times [2024-11-22 18:46:57,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:57,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749325641] [2024-11-22 18:46:57,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:57,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:57,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:57,583 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:46:57,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 18:46:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:57,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:46:57,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:57,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:46:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:57,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:57,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:57,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749325641] [2024-11-22 18:46:57,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749325641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:57,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:57,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:46:57,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277256171] [2024-11-22 18:46:57,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:57,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:46:57,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:57,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:46:57,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:46:57,723 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:57,987 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2024-11-22 18:46:57,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:46:57,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-22 18:46:57,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:57,988 INFO L225 Difference]: With dead ends: 90 [2024-11-22 18:46:57,988 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 18:46:57,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:46:57,989 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 23 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:57,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 277 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:46:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 18:46:57,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-11-22 18:46:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 73 states have internal predecessors, (79), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-22 18:46:57,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2024-11-22 18:46:57,996 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 16 [2024-11-22 18:46:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:57,996 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2024-11-22 18:46:57,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2024-11-22 18:46:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:46:57,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:57,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:58,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-22 18:46:58,197 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-11-22 18:46:58,197 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:46:58,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:58,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1050940881, now seen corresponding path program 1 times [2024-11-22 18:46:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:58,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523103178] [2024-11-22 18:46:58,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:58,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:58,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:58,199 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-11-22 18:46:58,201 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-11-22 18:46:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:58,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:46:58,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:58,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:46:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:58,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:58,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:58,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523103178] [2024-11-22 18:46:58,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523103178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:58,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:58,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:46:58,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989731461] [2024-11-22 18:46:58,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:58,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:46:58,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:58,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:46:58,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:46:58,370 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:58,633 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2024-11-22 18:46:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:46:58,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-22 18:46:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:58,634 INFO L225 Difference]: With dead ends: 88 [2024-11-22 18:46:58,634 INFO L226 Difference]: Without dead ends: 88 [2024-11-22 18:46:58,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:46:58,635 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:58,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 367 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:46:58,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-22 18:46:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-11-22 18:46:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 73 states have internal predecessors, (77), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-22 18:46:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-22 18:46:58,638 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 16 [2024-11-22 18:46:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:58,639 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-22 18:46:58,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-22 18:46:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:46:58,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:58,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:58,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-22 18:46:58,840 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-11-22 18:46:58,840 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:46:58,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:58,840 INFO L85 PathProgramCache]: Analyzing trace with hash -921858163, now seen corresponding path program 1 times [2024-11-22 18:46:58,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:58,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877640549] [2024-11-22 18:46:58,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:58,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:58,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:58,843 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-11-22 18:46:58,844 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-11-22 18:46:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:58,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:46:58,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:58,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:58,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877640549] [2024-11-22 18:46:58,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877640549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:58,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:58,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:46:58,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263091375] [2024-11-22 18:46:58,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:58,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:46:58,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:46:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:46:58,928 INFO L87 Difference]: Start difference. First operand 86 states and 90 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:58,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:58,943 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2024-11-22 18:46:58,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:46:58,943 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-22 18:46:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:58,944 INFO L225 Difference]: With dead ends: 69 [2024-11-22 18:46:58,944 INFO L226 Difference]: Without dead ends: 69 [2024-11-22 18:46:58,944 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-11-22 18:46:58,945 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:58,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:46:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-22 18:46:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-22 18:46:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 59 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 18:46:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2024-11-22 18:46:58,952 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 16 [2024-11-22 18:46:58,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:58,952 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2024-11-22 18:46:58,952 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2024-11-22 18:46:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:46:58,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:58,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:58,957 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-11-22 18:46:59,155 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-11-22 18:46:59,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:46:59,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:59,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1444434083, now seen corresponding path program 1 times [2024-11-22 18:46:59,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:59,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802451402] [2024-11-22 18:46:59,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:59,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:59,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:59,158 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-11-22 18:46:59,159 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-11-22 18:46:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:59,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 18:46:59,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:59,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 18:46:59,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 18:46:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:59,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:59,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:59,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802451402] [2024-11-22 18:46:59,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802451402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:59,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:59,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:46:59,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036027729] [2024-11-22 18:46:59,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:59,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:46:59,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:59,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:46:59,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:46:59,345 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:59,479 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2024-11-22 18:46:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:46:59,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-22 18:46:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:59,480 INFO L225 Difference]: With dead ends: 75 [2024-11-22 18:46:59,480 INFO L226 Difference]: Without dead ends: 75 [2024-11-22 18:46:59,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:46:59,481 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 15 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:59,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 214 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:46:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-22 18:46:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-11-22 18:46:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 61 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 18:46:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2024-11-22 18:46:59,483 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 16 [2024-11-22 18:46:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:59,484 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2024-11-22 18:46:59,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2024-11-22 18:46:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 18:46:59,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:59,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:59,488 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 (12)] Forceful destruction successful, exit code 0 [2024-11-22 18:46:59,685 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-11-22 18:46:59,685 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:46:59,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:59,685 INFO L85 PathProgramCache]: Analyzing trace with hash -636873007, now seen corresponding path program 1 times [2024-11-22 18:46:59,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:59,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098324578] [2024-11-22 18:46:59,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:59,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:59,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:59,688 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-11-22 18:46:59,689 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-11-22 18:46:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:59,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:46:59,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:59,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:59,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:59,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098324578] [2024-11-22 18:46:59,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098324578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:59,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:59,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:46:59,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756822755] [2024-11-22 18:46:59,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:59,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:46:59,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:59,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:46:59,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:46:59,774 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:59,864 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2024-11-22 18:46:59,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:46:59,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-22 18:46:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:59,865 INFO L225 Difference]: With dead ends: 70 [2024-11-22 18:46:59,865 INFO L226 Difference]: Without dead ends: 70 [2024-11-22 18:46:59,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:46:59,865 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:59,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 158 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:46:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-22 18:46:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-22 18:46:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 60 states have internal predecessors, (62), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 18:46:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2024-11-22 18:46:59,872 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 18 [2024-11-22 18:46:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:59,872 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2024-11-22 18:46:59,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:46:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2024-11-22 18:46:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 18:46:59,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:59,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:59,876 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 (13)] Forceful destruction successful, exit code 0 [2024-11-22 18:47:00,073 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-11-22 18:47:00,073 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:47:00,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:00,074 INFO L85 PathProgramCache]: Analyzing trace with hash -636873006, now seen corresponding path program 1 times [2024-11-22 18:47:00,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:00,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046414634] [2024-11-22 18:47:00,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:00,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:00,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:00,075 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-11-22 18:47:00,076 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-11-22 18:47:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:00,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 18:47:00,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:47:00,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:47:00,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:00,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046414634] [2024-11-22 18:47:00,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046414634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:47:00,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:47:00,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:47:00,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961450269] [2024-11-22 18:47:00,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:47:00,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:47:00,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:00,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:47:00,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:47:00,216 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:47:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:47:00,352 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2024-11-22 18:47:00,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:47:00,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-22 18:47:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:47:00,352 INFO L225 Difference]: With dead ends: 69 [2024-11-22 18:47:00,353 INFO L226 Difference]: Without dead ends: 69 [2024-11-22 18:47:00,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:47:00,353 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 13 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:47:00,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 316 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:47:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-22 18:47:00,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-22 18:47:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 59 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 18:47:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2024-11-22 18:47:00,355 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 18 [2024-11-22 18:47:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:47:00,355 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2024-11-22 18:47:00,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:47:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2024-11-22 18:47:00,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:47:00,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:47:00,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:47:00,360 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 (14)] Forceful destruction successful, exit code 0 [2024-11-22 18:47:00,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:00,557 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:47:00,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:00,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1444364536, now seen corresponding path program 1 times [2024-11-22 18:47:00,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:00,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574239929] [2024-11-22 18:47:00,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:00,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:00,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:00,558 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:47:00,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-22 18:47:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:00,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 18:47:00,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:00,671 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_7| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_7| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_7|)))) is different from true [2024-11-22 18:47:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:47:00,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:47:00,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:00,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574239929] [2024-11-22 18:47:00,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574239929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:47:00,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:47:00,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:47:00,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723179057] [2024-11-22 18:47:00,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:47:00,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:47:00,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:00,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:47:00,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-22 18:47:00,676 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:47:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:47:00,796 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2024-11-22 18:47:00,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:47:00,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 16 [2024-11-22 18:47:00,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:47:00,797 INFO L225 Difference]: With dead ends: 72 [2024-11-22 18:47:00,797 INFO L226 Difference]: Without dead ends: 61 [2024-11-22 18:47:00,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-22 18:47:00,798 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 27 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:47:00,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 68 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2024-11-22 18:47:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-22 18:47:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-22 18:47:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 52 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:47:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2024-11-22 18:47:00,800 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 16 [2024-11-22 18:47:00,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:47:00,800 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2024-11-22 18:47:00,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:47:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2024-11-22 18:47:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 18:47:00,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:47:00,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:47:00,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-22 18:47:01,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:01,004 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:47:01,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:01,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1441486886, now seen corresponding path program 1 times [2024-11-22 18:47:01,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:01,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605707093] [2024-11-22 18:47:01,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:01,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:01,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:01,008 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:47:01,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-22 18:47:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:01,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 18:47:01,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:47:01,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:47:01,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:01,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605707093] [2024-11-22 18:47:01,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605707093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:47:01,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:47:01,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:47:01,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171723709] [2024-11-22 18:47:01,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:47:01,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:47:01,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:01,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:47:01,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:47:01,164 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:47:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:47:01,360 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2024-11-22 18:47:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:47:01,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-11-22 18:47:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:47:01,361 INFO L225 Difference]: With dead ends: 69 [2024-11-22 18:47:01,361 INFO L226 Difference]: Without dead ends: 69 [2024-11-22 18:47:01,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:47:01,362 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 65 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:47:01,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 162 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:47:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-22 18:47:01,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2024-11-22 18:47:01,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 51 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:47:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2024-11-22 18:47:01,363 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 25 [2024-11-22 18:47:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:47:01,363 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2024-11-22 18:47:01,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:47:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2024-11-22 18:47:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 18:47:01,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:47:01,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:47:01,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-22 18:47:01,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:01,565 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:47:01,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:01,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1441486885, now seen corresponding path program 1 times [2024-11-22 18:47:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:01,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152917648] [2024-11-22 18:47:01,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:01,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:01,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:01,567 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:47:01,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-22 18:47:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:01,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 18:47:01,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:47:01,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:47:01,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:01,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152917648] [2024-11-22 18:47:01,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152917648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:47:01,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:47:01,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:47:01,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100746991] [2024-11-22 18:47:01,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:47:01,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:47:01,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:01,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:47:01,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:47:01,734 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:47:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:47:01,878 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2024-11-22 18:47:01,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:47:01,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-11-22 18:47:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:47:01,881 INFO L225 Difference]: With dead ends: 59 [2024-11-22 18:47:01,881 INFO L226 Difference]: Without dead ends: 59 [2024-11-22 18:47:01,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:47:01,882 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 16 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:47:01,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 218 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:47:01,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-22 18:47:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-22 18:47:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 50 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:47:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2024-11-22 18:47:01,884 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 25 [2024-11-22 18:47:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:47:01,884 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2024-11-22 18:47:01,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:47:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2024-11-22 18:47:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:47:01,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:47:01,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:47:01,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-22 18:47:02,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:02,087 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:47:02,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash -243978174, now seen corresponding path program 1 times [2024-11-22 18:47:02,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:02,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906178070] [2024-11-22 18:47:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:02,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:02,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:02,094 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:47:02,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-22 18:47:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:02,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 18:47:02,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:02,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:47:02,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:47:02,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-22 18:47:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:47:02,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:47:02,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:02,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906178070] [2024-11-22 18:47:02,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906178070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:47:02,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:47:02,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-22 18:47:02,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638290780] [2024-11-22 18:47:02,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:47:02,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 18:47:02,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:02,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 18:47:02,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-22 18:47:02,606 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:47:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:47:03,351 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2024-11-22 18:47:03,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 18:47:03,351 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2024-11-22 18:47:03,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:47:03,352 INFO L225 Difference]: With dead ends: 79 [2024-11-22 18:47:03,352 INFO L226 Difference]: Without dead ends: 79 [2024-11-22 18:47:03,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2024-11-22 18:47:03,352 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 50 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 18:47:03,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 225 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 18:47:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-22 18:47:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2024-11-22 18:47:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 61 states have internal predecessors, (71), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 18:47:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-11-22 18:47:03,355 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 30 [2024-11-22 18:47:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:47:03,355 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-11-22 18:47:03,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:47:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-11-22 18:47:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:47:03,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:47:03,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:47:03,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-22 18:47:03,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:03,556 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:47:03,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:03,557 INFO L85 PathProgramCache]: Analyzing trace with hash -243978173, now seen corresponding path program 1 times [2024-11-22 18:47:03,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:03,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80883981] [2024-11-22 18:47:03,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:03,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:03,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:03,558 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:47:03,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-22 18:47:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:03,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-22 18:47:03,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:03,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:47:03,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:47:03,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:47:04,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 18:47:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:47:04,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:47:04,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:04,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80883981] [2024-11-22 18:47:04,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80883981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:47:04,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:47:04,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-22 18:47:04,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384731611] [2024-11-22 18:47:04,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:47:04,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 18:47:04,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:04,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 18:47:04,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-22 18:47:04,134 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 18 states, 16 states have (on average 1.4375) internal successors, (23), 14 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:47:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:47:04,986 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-11-22 18:47:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 18:47:04,987 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.4375) internal successors, (23), 14 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2024-11-22 18:47:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:47:04,987 INFO L225 Difference]: With dead ends: 77 [2024-11-22 18:47:04,987 INFO L226 Difference]: Without dead ends: 77 [2024-11-22 18:47:04,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2024-11-22 18:47:04,988 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 57 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 18:47:04,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 254 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 18:47:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-22 18:47:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-11-22 18:47:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.4) internal successors, (70), 62 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 18:47:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-11-22 18:47:04,990 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 30 [2024-11-22 18:47:04,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:47:04,990 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-11-22 18:47:04,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.4375) internal successors, (23), 14 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:47:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-11-22 18:47:04,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:47:04,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:47:04,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:47:04,994 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 (19)] Forceful destruction successful, exit code 0 [2024-11-22 18:47:05,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:05,192 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:47:05,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:05,192 INFO L85 PathProgramCache]: Analyzing trace with hash -244047721, now seen corresponding path program 1 times [2024-11-22 18:47:05,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:05,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732960266] [2024-11-22 18:47:05,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:05,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:05,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:05,193 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:47:05,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-22 18:47:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:05,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-22 18:47:05,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:05,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:47:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:47:05,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:47:05,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:05,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732960266] [2024-11-22 18:47:05,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732960266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:47:05,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:47:05,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 18:47:05,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111652910] [2024-11-22 18:47:05,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:47:05,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:47:05,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:05,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:47:05,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:47:05,486 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:47:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:47:05,762 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2024-11-22 18:47:05,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 18:47:05,762 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2024-11-22 18:47:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:47:05,763 INFO L225 Difference]: With dead ends: 75 [2024-11-22 18:47:05,763 INFO L226 Difference]: Without dead ends: 75 [2024-11-22 18:47:05,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-22 18:47:05,763 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:47:05,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 494 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:47:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-22 18:47:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-11-22 18:47:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 18:47:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-11-22 18:47:05,765 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 30 [2024-11-22 18:47:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:47:05,766 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-11-22 18:47:05,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:47:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-11-22 18:47:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-22 18:47:05,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:47:05,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:47:05,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-22 18:47:05,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:05,967 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 18:47:05,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:05,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1269135572, now seen corresponding path program 1 times [2024-11-22 18:47:05,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:05,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940117443] [2024-11-22 18:47:05,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:05,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:47:05,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:05,969 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:47:05,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-22 18:47:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:06,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-22 18:47:06,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:06,099 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-22 18:47:06,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-22 18:47:06,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:47:06,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-22 18:47:06,198 INFO L349 Elim1Store]: treesize reduction 16, result has 48.4 percent of original size [2024-11-22 18:47:06,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2024-11-22 18:47:06,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:47:06,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-22 18:47:06,566 INFO L349 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2024-11-22 18:47:06,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 52 [2024-11-22 18:47:06,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:47:06,813 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 18:47:06,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 22 [2024-11-22 18:47:06,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-11-22 18:47:07,436 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2024-11-22 18:47:07,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 17 [2024-11-22 18:47:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:47:07,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:47:07,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:07,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940117443] [2024-11-22 18:47:07,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940117443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:47:07,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:47:07,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-22 18:47:07,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397450676] [2024-11-22 18:47:07,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:47:07,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-22 18:47:07,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:07,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-22 18:47:07,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2024-11-22 18:47:07,533 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 25 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 19 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:47:12,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:47:16,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:47:20,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:47:24,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:47:28,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:47:32,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:47:37,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:47:41,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:47:45,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:47:49,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:47:53,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:47:57,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:48:02,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:48:06,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:48:10,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:48:14,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:48:18,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:48:22,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:48:26,377 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]