./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:23:03,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:23:03,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:23:03,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:23:03,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:23:03,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:23:03,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:23:03,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:23:03,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:23:03,514 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:23:03,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:23:03,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:23:03,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:23:03,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:23:03,518 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:23:03,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:23:03,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:23:03,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:23:03,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:23:03,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:23:03,519 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:23:03,523 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:23:03,523 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:23:03,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:23:03,524 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:23:03,524 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:23:03,524 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:23:03,524 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:23:03,524 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:23:03,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:23:03,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:23:03,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:23:03,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:23:03,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:23:03,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:23:03,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:23:03,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:23:03,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:23:03,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:23:03,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:23:03,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:23:03,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:23:03,528 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 -> bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 [2024-10-24 16:23:03,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:23:03,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:23:03,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:23:03,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:23:03,762 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:23:03,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2024-10-24 16:23:04,971 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:23:05,212 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:23:05,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2024-10-24 16:23:05,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df7ab8d9/e8ee90489cc5410db43f21b31504202d/FLAGd3d449d4a [2024-10-24 16:23:05,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df7ab8d9/e8ee90489cc5410db43f21b31504202d [2024-10-24 16:23:05,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:23:05,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:23:05,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:23:05,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:23:05,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:23:05,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:23:05" (1/1) ... [2024-10-24 16:23:05,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db1957c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:05, skipping insertion in model container [2024-10-24 16:23:05,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:23:05" (1/1) ... [2024-10-24 16:23:05,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:23:05,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:23:05,918 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-24 16:23:05,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@62865305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:05, skipping insertion in model container [2024-10-24 16:23:05,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:23:05,920 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 16:23:05,921 INFO L158 Benchmark]: Toolchain (without parser) took 362.91ms. Allocated memory is still 157.3MB. Free memory was 100.3MB in the beginning and 84.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 16:23:05,922 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:23:05,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.26ms. Allocated memory is still 157.3MB. Free memory was 100.3MB in the beginning and 84.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 16:23:05,924 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.26ms. Allocated memory is still 157.3MB. Free memory was 100.3MB in the beginning and 84.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:23:07,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:23:07,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 16:23:07,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:23:07,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:23:07,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:23:07,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:23:07,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:23:07,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:23:07,603 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:23:07,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:23:07,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:23:07,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:23:07,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:23:07,605 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:23:07,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:23:07,606 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:23:07,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:23:07,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:23:07,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:23:07,607 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:23:07,607 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:23:07,607 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:23:07,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:23:07,610 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:23:07,610 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 16:23:07,610 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:23:07,610 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 16:23:07,611 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:23:07,611 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:23:07,611 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:23:07,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:23:07,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:23:07,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:23:07,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:23:07,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:23:07,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:23:07,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:23:07,614 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 16:23:07,614 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 16:23:07,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:23:07,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:23:07,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:23:07,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:23:07,616 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 16:23:07,616 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 -> bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 [2024-10-24 16:23:07,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:23:07,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:23:07,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:23:07,903 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:23:07,904 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:23:07,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2024-10-24 16:23:09,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:23:09,348 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:23:09,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2024-10-24 16:23:09,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adea3ce3c/b7bbf3d30517400aa99791d66661514f/FLAG39adb3489 [2024-10-24 16:23:09,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adea3ce3c/b7bbf3d30517400aa99791d66661514f [2024-10-24 16:23:09,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:23:09,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:23:09,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:23:09,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:23:09,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:23:09,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:09,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c66444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09, skipping insertion in model container [2024-10-24 16:23:09,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:09,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:23:09,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:23:09,787 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 16:23:09,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:23:09,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:23:09,855 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:23:09,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:23:09,947 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:23:09,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09 WrapperNode [2024-10-24 16:23:09,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:23:09,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:23:09,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:23:09,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:23:09,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:09,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:10,003 INFO L138 Inliner]: procedures = 167, calls = 80, calls flagged for inlining = 24, calls inlined = 6, statements flattened = 99 [2024-10-24 16:23:10,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:23:10,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:23:10,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:23:10,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:23:10,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:10,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:10,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:10,037 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-10-24 16:23:10,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:10,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:10,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:10,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:10,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:10,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:10,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:23:10,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:23:10,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:23:10,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:23:10,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09" (1/1) ... [2024-10-24 16:23:10,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:23:10,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:23:10,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 16:23:10,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 16:23:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 16:23:10,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 16:23:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:23:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:23:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:23:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:23:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:23:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:23:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:23:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 16:23:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 16:23:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:23:10,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:23:10,257 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:23:10,259 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:23:10,495 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-24 16:23:10,495 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:23:10,529 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:23:10,529 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-24 16:23:10,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:23:10 BoogieIcfgContainer [2024-10-24 16:23:10,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:23:10,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:23:10,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:23:10,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:23:10,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:23:09" (1/3) ... [2024-10-24 16:23:10,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eed545c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:23:10, skipping insertion in model container [2024-10-24 16:23:10,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:09" (2/3) ... [2024-10-24 16:23:10,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eed545c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:23:10, skipping insertion in model container [2024-10-24 16:23:10,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:23:10" (3/3) ... [2024-10-24 16:23:10,538 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-2.i [2024-10-24 16:23:10,551 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:23:10,552 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-10-24 16:23:10,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:23:10,600 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;@2f4369d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:23:10,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-24 16:23:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 56 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 16:23:10,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:10,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:10,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:10,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:10,614 INFO L85 PathProgramCache]: Analyzing trace with hash 631132921, now seen corresponding path program 1 times [2024-10-24 16:23:10,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:10,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137205255] [2024-10-24 16:23:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:10,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:10,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:10,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:10,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 16:23:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:10,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 16:23:10,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:10,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:10,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:10,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137205255] [2024-10-24 16:23:10,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137205255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:10,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:10,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:23:10,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775016418] [2024-10-24 16:23:10,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:10,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 16:23:10,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:10,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 16:23:10,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 16:23:10,742 INFO L87 Difference]: Start difference. First operand has 60 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 56 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:10,780 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2024-10-24 16:23:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 16:23:10,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-24 16:23:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:10,787 INFO L225 Difference]: With dead ends: 60 [2024-10-24 16:23:10,787 INFO L226 Difference]: Without dead ends: 59 [2024-10-24 16:23:10,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 16:23:10,790 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:10,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:23:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-24 16:23:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-24 16:23:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.75) internal successors, (63), 55 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2024-10-24 16:23:10,816 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 13 [2024-10-24 16:23:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:10,816 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2024-10-24 16:23:10,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-10-24 16:23:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 16:23:10,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:10,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:10,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:11,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:11,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:11,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash 238105911, now seen corresponding path program 1 times [2024-10-24 16:23:11,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:11,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443108487] [2024-10-24 16:23:11,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:11,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:11,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:11,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:11,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 16:23:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:11,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:23:11,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:11,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-10-24 16:23:11,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:11,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:11,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443108487] [2024-10-24 16:23:11,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443108487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:11,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:11,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:23:11,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994225731] [2024-10-24 16:23:11,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:11,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:23:11,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:11,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:23:11,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:11,138 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:11,243 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2024-10-24 16:23:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:23:11,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-24 16:23:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:11,245 INFO L225 Difference]: With dead ends: 104 [2024-10-24 16:23:11,246 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 16:23:11,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:11,247 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 45 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:11,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 199 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 16:23:11,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 63. [2024-10-24 16:23:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:23:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2024-10-24 16:23:11,253 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 13 [2024-10-24 16:23:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:11,254 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2024-10-24 16:23:11,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2024-10-24 16:23:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 16:23:11,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:11,254 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:11,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:11,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:11,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:11,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash 238004817, now seen corresponding path program 1 times [2024-10-24 16:23:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:11,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221615757] [2024-10-24 16:23:11,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:11,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:11,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:11,461 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:11,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 16:23:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:11,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:23:11,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:11,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:23:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:11,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:11,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:11,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221615757] [2024-10-24 16:23:11,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221615757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:11,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:11,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:23:11,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543392103] [2024-10-24 16:23:11,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:11,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:23:11,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:11,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:23:11,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:11,590 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:11,695 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2024-10-24 16:23:11,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:23:11,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-24 16:23:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:11,697 INFO L225 Difference]: With dead ends: 85 [2024-10-24 16:23:11,698 INFO L226 Difference]: Without dead ends: 85 [2024-10-24 16:23:11,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:11,699 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:11,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 158 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-24 16:23:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2024-10-24 16:23:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.66) internal successors, (83), 69 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:23:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2024-10-24 16:23:11,706 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 13 [2024-10-24 16:23:11,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:11,706 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2024-10-24 16:23:11,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2024-10-24 16:23:11,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 16:23:11,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:11,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:11,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:11,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:11,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:11,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:11,911 INFO L85 PathProgramCache]: Analyzing trace with hash 238004818, now seen corresponding path program 1 times [2024-10-24 16:23:11,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:11,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685796499] [2024-10-24 16:23:11,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:11,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:11,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:11,915 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:11,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 16:23:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:11,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 16:23:11,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:11,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:23:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:12,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:12,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:12,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685796499] [2024-10-24 16:23:12,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685796499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:12,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:12,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 16:23:12,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349005528] [2024-10-24 16:23:12,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:12,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:23:12,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:12,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:23:12,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:23:12,217 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:12,491 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2024-10-24 16:23:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:23:12,491 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-24 16:23:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:12,492 INFO L225 Difference]: With dead ends: 84 [2024-10-24 16:23:12,492 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 16:23:12,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:23:12,493 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 78 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:12,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 345 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:23:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 16:23:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2024-10-24 16:23:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 71 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:23:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2024-10-24 16:23:12,501 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 13 [2024-10-24 16:23:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:12,502 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2024-10-24 16:23:12,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2024-10-24 16:23:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 16:23:12,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:12,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:12,507 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-10-24 16:23:12,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:12,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:12,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:12,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1125609592, now seen corresponding path program 1 times [2024-10-24 16:23:12,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:12,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353494554] [2024-10-24 16:23:12,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:12,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:12,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:12,707 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:12,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 16:23:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:12,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:23:12,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:12,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:12,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353494554] [2024-10-24 16:23:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353494554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:12,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:12,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:23:12,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158622439] [2024-10-24 16:23:12,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:12,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:23:12,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:12,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:23:12,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:23:12,780 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:12,878 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2024-10-24 16:23:12,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:23:12,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-24 16:23:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:12,880 INFO L225 Difference]: With dead ends: 127 [2024-10-24 16:23:12,880 INFO L226 Difference]: Without dead ends: 125 [2024-10-24 16:23:12,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:23:12,881 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 45 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:12,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 169 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-24 16:23:12,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 76. [2024-10-24 16:23:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 71 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:23:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2024-10-24 16:23:12,887 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 13 [2024-10-24 16:23:12,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:12,887 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2024-10-24 16:23:12,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:12,887 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2024-10-24 16:23:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 16:23:12,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:12,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:12,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 16:23:13,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:13,088 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:13,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:13,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1125508498, now seen corresponding path program 1 times [2024-10-24 16:23:13,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:13,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592714051] [2024-10-24 16:23:13,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:13,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:13,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:13,090 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:13,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 16:23:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:13,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:23:13,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:13,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:13,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:13,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592714051] [2024-10-24 16:23:13,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592714051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:13,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:13,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:23:13,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851856612] [2024-10-24 16:23:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:13,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:23:13,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:13,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:23:13,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:13,170 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:13,229 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2024-10-24 16:23:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:23:13,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-24 16:23:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:13,230 INFO L225 Difference]: With dead ends: 72 [2024-10-24 16:23:13,230 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 16:23:13,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:13,231 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:13,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 16:23:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-24 16:23:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 66 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2024-10-24 16:23:13,242 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 13 [2024-10-24 16:23:13,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:13,242 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2024-10-24 16:23:13,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2024-10-24 16:23:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:23:13,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:13,243 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:13,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 16:23:13,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:13,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:13,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:13,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1089465406, now seen corresponding path program 1 times [2024-10-24 16:23:13,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:13,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340175187] [2024-10-24 16:23:13,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:13,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:13,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:13,446 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:13,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 16:23:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:13,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:23:13,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:13,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:23:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:13,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:14,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:14,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340175187] [2024-10-24 16:23:14,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340175187] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:14,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:14,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2024-10-24 16:23:14,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175259379] [2024-10-24 16:23:14,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:14,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 16:23:14,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:14,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 16:23:14,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:23:14,384 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 21 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:15,519 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2024-10-24 16:23:15,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 16:23:15,520 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-10-24 16:23:15,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:15,520 INFO L225 Difference]: With dead ends: 84 [2024-10-24 16:23:15,520 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 16:23:15,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2024-10-24 16:23:15,521 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 105 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:15,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 489 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:23:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 16:23:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2024-10-24 16:23:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 72 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2024-10-24 16:23:15,529 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 15 [2024-10-24 16:23:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:15,530 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2024-10-24 16:23:15,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2024-10-24 16:23:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:23:15,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:15,530 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] [2024-10-24 16:23:15,533 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 (8)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:15,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:15,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:15,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:15,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1053616757, now seen corresponding path program 1 times [2024-10-24 16:23:15,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:15,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714847581] [2024-10-24 16:23:15,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:15,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:15,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:15,734 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:15,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 16:23:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:15,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:23:15,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:15,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:23:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:23:15,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:15,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:15,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714847581] [2024-10-24 16:23:15,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714847581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:15,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:15,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:23:15,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512565921] [2024-10-24 16:23:15,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:15,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:23:15,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:15,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:23:15,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:23:15,817 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:15,939 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2024-10-24 16:23:15,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:23:15,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-24 16:23:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:15,941 INFO L225 Difference]: With dead ends: 86 [2024-10-24 16:23:15,941 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 16:23:15,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:23:15,941 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 27 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:15,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 179 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 16:23:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2024-10-24 16:23:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 73 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2024-10-24 16:23:15,947 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 20 [2024-10-24 16:23:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:15,947 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2024-10-24 16:23:15,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:15,947 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2024-10-24 16:23:15,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:23:15,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:15,948 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] [2024-10-24 16:23:15,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 16:23:16,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:16,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:16,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1053616756, now seen corresponding path program 1 times [2024-10-24 16:23:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:16,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854793888] [2024-10-24 16:23:16,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:16,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:16,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:16,151 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:16,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 16:23:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:16,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:23:16,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:16,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:23:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:16,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:16,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:16,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854793888] [2024-10-24 16:23:16,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854793888] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:16,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:23:16,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2024-10-24 16:23:16,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749060969] [2024-10-24 16:23:16,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:16,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:23:16,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:16,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:23:16,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:23:16,915 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:17,568 INFO L93 Difference]: Finished difference Result 125 states and 150 transitions. [2024-10-24 16:23:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:23:17,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-24 16:23:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:17,570 INFO L225 Difference]: With dead ends: 125 [2024-10-24 16:23:17,570 INFO L226 Difference]: Without dead ends: 125 [2024-10-24 16:23:17,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-10-24 16:23:17,570 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 73 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:17,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 255 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:23:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-24 16:23:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 77. [2024-10-24 16:23:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 73 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2024-10-24 16:23:17,574 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 20 [2024-10-24 16:23:17,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:17,574 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-10-24 16:23:17,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2024-10-24 16:23:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:23:17,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:17,575 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] [2024-10-24 16:23:17,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:17,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:17,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:17,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1697617503, now seen corresponding path program 1 times [2024-10-24 16:23:17,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:17,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986966888] [2024-10-24 16:23:17,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:17,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:17,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:17,778 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:17,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 16:23:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:17,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:23:17,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:23:17,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:17,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:17,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986966888] [2024-10-24 16:23:17,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986966888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:17,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:17,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:23:17,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13948297] [2024-10-24 16:23:17,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:17,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:23:17,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:17,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:23:17,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:17,843 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:17,883 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2024-10-24 16:23:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:23:17,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 21 [2024-10-24 16:23:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:17,884 INFO L225 Difference]: With dead ends: 76 [2024-10-24 16:23:17,884 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 16:23:17,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:17,886 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 32 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:17,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 167 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:23:17,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 16:23:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-24 16:23:17,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 72 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2024-10-24 16:23:17,888 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 21 [2024-10-24 16:23:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:17,888 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2024-10-24 16:23:17,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2024-10-24 16:23:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:23:17,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:17,889 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] [2024-10-24 16:23:17,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 16:23:18,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:18,091 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:18,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1697618979, now seen corresponding path program 1 times [2024-10-24 16:23:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:18,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304268401] [2024-10-24 16:23:18,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:18,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:18,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:18,093 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:18,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 16:23:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:18,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 16:23:18,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:18,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:23:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:18,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:18,207 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 14 treesize of output 12 [2024-10-24 16:23:18,210 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 18 treesize of output 16 [2024-10-24 16:23:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:18,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:18,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304268401] [2024-10-24 16:23:18,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304268401] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:18,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:18,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-24 16:23:18,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351501310] [2024-10-24 16:23:18,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:18,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:23:18,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:18,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:23:18,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:23:18,228 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:18,433 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2024-10-24 16:23:18,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:23:18,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 21 [2024-10-24 16:23:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:18,434 INFO L225 Difference]: With dead ends: 116 [2024-10-24 16:23:18,434 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 16:23:18,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:23:18,435 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 52 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:18,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 228 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:23:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 16:23:18,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2024-10-24 16:23:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.626865671641791) internal successors, (109), 85 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:23:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2024-10-24 16:23:18,443 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 21 [2024-10-24 16:23:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:18,443 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2024-10-24 16:23:18,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2024-10-24 16:23:18,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:23:18,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:18,444 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:18,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-24 16:23:18,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:18,645 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:18,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:18,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1805193214, now seen corresponding path program 2 times [2024-10-24 16:23:18,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:18,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495722377] [2024-10-24 16:23:18,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:23:18,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:18,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:18,647 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:18,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 16:23:18,696 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:23:18,696 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:23:18,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:23:18,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:18,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:23:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:19,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:20,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:20,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495722377] [2024-10-24 16:23:20,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495722377] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:20,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:20,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2024-10-24 16:23:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538701789] [2024-10-24 16:23:20,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:20,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 16:23:20,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:20,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 16:23:20,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2024-10-24 16:23:20,239 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. Second operand has 26 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:23,682 INFO L93 Difference]: Finished difference Result 107 states and 143 transitions. [2024-10-24 16:23:23,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-24 16:23:23,683 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-24 16:23:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:23,683 INFO L225 Difference]: With dead ends: 107 [2024-10-24 16:23:23,683 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 16:23:23,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2024-10-24 16:23:23,684 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 95 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:23,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 620 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 16:23:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 16:23:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2024-10-24 16:23:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.6075949367088607) internal successors, (127), 97 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:23:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2024-10-24 16:23:23,687 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 21 [2024-10-24 16:23:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:23,687 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2024-10-24 16:23:23,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2024-10-24 16:23:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 16:23:23,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:23,688 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] [2024-10-24 16:23:23,691 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-10-24 16:23:23,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:23,889 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:23,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1086535195, now seen corresponding path program 1 times [2024-10-24 16:23:23,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:23,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492546203] [2024-10-24 16:23:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:23,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:23,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:23,890 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:23,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 16:23:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:23,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:23:23,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:23:24,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:24,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:24,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492546203] [2024-10-24 16:23:24,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492546203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:24,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:24,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:23:24,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259767388] [2024-10-24 16:23:24,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:24,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:23:24,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:24,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:23:24,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:23:24,003 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:24,068 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2024-10-24 16:23:24,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:23:24,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 22 [2024-10-24 16:23:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:24,069 INFO L225 Difference]: With dead ends: 101 [2024-10-24 16:23:24,069 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 16:23:24,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:23:24,069 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 75 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:24,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 129 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:24,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 16:23:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 16:23:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 96 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:23:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 133 transitions. [2024-10-24 16:23:24,072 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 133 transitions. Word has length 22 [2024-10-24 16:23:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:24,072 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 133 transitions. [2024-10-24 16:23:24,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:23:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 133 transitions. [2024-10-24 16:23:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 16:23:24,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:24,073 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] [2024-10-24 16:23:24,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 16:23:24,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:24,276 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:24,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:24,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1086580939, now seen corresponding path program 1 times [2024-10-24 16:23:24,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:24,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678225925] [2024-10-24 16:23:24,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:24,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:24,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:24,277 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:24,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 16:23:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:24,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:23:24,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:24,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:23:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:24,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:24,477 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 14 treesize of output 12 [2024-10-24 16:23:24,479 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 22 treesize of output 20 [2024-10-24 16:23:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:24,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:24,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678225925] [2024-10-24 16:23:24,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678225925] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:24,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:24,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-10-24 16:23:24,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968203947] [2024-10-24 16:23:24,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:24,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:23:24,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:24,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:23:24,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:23:24,506 INFO L87 Difference]: Start difference. First operand 101 states and 133 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:23:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:24,748 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2024-10-24 16:23:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:23:24,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-24 16:23:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:24,750 INFO L225 Difference]: With dead ends: 125 [2024-10-24 16:23:24,750 INFO L226 Difference]: Without dead ends: 125 [2024-10-24 16:23:24,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:23:24,750 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 134 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:24,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 249 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:23:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-24 16:23:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 103. [2024-10-24 16:23:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.5679012345679013) internal successors, (127), 98 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:23:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2024-10-24 16:23:24,753 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 135 transitions. Word has length 22 [2024-10-24 16:23:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:24,753 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 135 transitions. [2024-10-24 16:23:24,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:23:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 135 transitions. [2024-10-24 16:23:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:23:24,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:24,754 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:24,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-24 16:23:24,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:24,959 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:24,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash -256252909, now seen corresponding path program 1 times [2024-10-24 16:23:24,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:24,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523075942] [2024-10-24 16:23:24,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:24,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:24,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:24,961 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:24,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-24 16:23:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:25,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:23:25,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:25,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:23:25,051 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-10-24 16:23:25,069 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 16:23:25,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-24 16:23:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-24 16:23:25,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:23:25,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:25,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523075942] [2024-10-24 16:23:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523075942] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:25,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:25,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2024-10-24 16:23:25,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022546222] [2024-10-24 16:23:25,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:25,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:23:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:25,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:23:25,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2024-10-24 16:23:25,196 INFO L87 Difference]: Start difference. First operand 103 states and 135 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:25,372 INFO L93 Difference]: Finished difference Result 138 states and 179 transitions. [2024-10-24 16:23:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:23:25,372 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-24 16:23:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:25,373 INFO L225 Difference]: With dead ends: 138 [2024-10-24 16:23:25,373 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 16:23:25,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-10-24 16:23:25,373 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 58 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:25,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 198 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 161 Invalid, 0 Unknown, 88 Unchecked, 0.1s Time] [2024-10-24 16:23:25,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 16:23:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2024-10-24 16:23:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 104 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:23:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 144 transitions. [2024-10-24 16:23:25,380 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 144 transitions. Word has length 24 [2024-10-24 16:23:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:25,380 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 144 transitions. [2024-10-24 16:23:25,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 144 transitions. [2024-10-24 16:23:25,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:23:25,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:25,383 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:25,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-24 16:23:25,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:25,584 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:25,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash -256252908, now seen corresponding path program 1 times [2024-10-24 16:23:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:25,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31379706] [2024-10-24 16:23:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:25,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:25,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:25,586 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:25,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-24 16:23:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:25,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 16:23:25,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:25,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:23:25,937 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-10-24 16:23:25,966 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-24 16:23:25,966 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 16 [2024-10-24 16:23:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-24 16:23:26,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:26,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:26,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31379706] [2024-10-24 16:23:26,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31379706] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:26,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [632451511] [2024-10-24 16:23:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:26,206 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:23:26,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:23:26,207 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:23:26,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-10-24 16:23:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:26,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 16:23:26,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:26,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:23:26,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:23:26,705 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-24 16:23:26,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:23:26,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:23:26,728 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:23:26,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:23:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-24 16:23:26,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:26,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [632451511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:26,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:26,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2024-10-24 16:23:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713561070] [2024-10-24 16:23:26,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:26,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 16:23:26,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:26,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 16:23:26,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=564, Unknown=2, NotChecked=98, Total=756 [2024-10-24 16:23:26,927 INFO L87 Difference]: Start difference. First operand 109 states and 144 transitions. Second operand has 25 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:23:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:27,863 INFO L93 Difference]: Finished difference Result 271 states and 363 transitions. [2024-10-24 16:23:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 16:23:27,864 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-24 16:23:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:27,865 INFO L225 Difference]: With dead ends: 271 [2024-10-24 16:23:27,865 INFO L226 Difference]: Without dead ends: 271 [2024-10-24 16:23:27,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=855, Unknown=2, NotChecked=122, Total=1122 [2024-10-24 16:23:27,866 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 241 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 408 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:27,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 616 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 678 Invalid, 0 Unknown, 408 Unchecked, 0.7s Time] [2024-10-24 16:23:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-24 16:23:27,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 115. [2024-10-24 16:23:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 109 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-24 16:23:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2024-10-24 16:23:27,870 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 24 [2024-10-24 16:23:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:27,870 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2024-10-24 16:23:27,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:23:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2024-10-24 16:23:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:23:27,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:27,871 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:27,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-24 16:23:28,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-10-24 16:23:28,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 16:23:28,272 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:28,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:28,272 INFO L85 PathProgramCache]: Analyzing trace with hash 646176705, now seen corresponding path program 1 times [2024-10-24 16:23:28,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:28,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169522495] [2024-10-24 16:23:28,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:28,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:28,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:28,274 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:28,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-24 16:23:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:28,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:23:28,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:23:28,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:28,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:28,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169522495] [2024-10-24 16:23:28,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169522495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:28,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:28,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:23:28,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499801634] [2024-10-24 16:23:28,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:28,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:23:28,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:28,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:23:28,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:28,353 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:23:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:28,389 INFO L93 Difference]: Finished difference Result 124 states and 163 transitions. [2024-10-24 16:23:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:23:28,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-24 16:23:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:28,390 INFO L225 Difference]: With dead ends: 124 [2024-10-24 16:23:28,390 INFO L226 Difference]: Without dead ends: 124 [2024-10-24 16:23:28,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:28,391 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:28,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 206 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:23:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-24 16:23:28,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2024-10-24 16:23:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.5) internal successors, (147), 111 states have internal predecessors, (147), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-24 16:23:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 158 transitions. [2024-10-24 16:23:28,394 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 158 transitions. Word has length 25 [2024-10-24 16:23:28,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:28,395 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 158 transitions. [2024-10-24 16:23:28,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:23:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 158 transitions. [2024-10-24 16:23:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:23:28,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:28,397 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:28,400 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-10-24 16:23:28,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:28,598 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:28,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:28,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1533680386, now seen corresponding path program 1 times [2024-10-24 16:23:28,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:28,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394259956] [2024-10-24 16:23:28,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:28,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:28,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:28,599 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:28,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-24 16:23:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:28,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:23:28,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 16:23:28,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:28,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:28,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394259956] [2024-10-24 16:23:28,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394259956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:28,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:28,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:23:28,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512763350] [2024-10-24 16:23:28,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:28,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:23:28,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:28,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:23:28,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:23:28,664 INFO L87 Difference]: Start difference. First operand 119 states and 158 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:28,717 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2024-10-24 16:23:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:23:28,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-10-24 16:23:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:28,718 INFO L225 Difference]: With dead ends: 113 [2024-10-24 16:23:28,718 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 16:23:28,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:23:28,719 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:28,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 145 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 16:23:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2024-10-24 16:23:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.449438202247191) internal successors, (129), 102 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-24 16:23:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2024-10-24 16:23:28,724 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 25 [2024-10-24 16:23:28,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:28,724 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2024-10-24 16:23:28,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2024-10-24 16:23:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:23:28,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:28,725 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-10-24 16:23:28,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:28,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:28,925 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:28,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2096606628, now seen corresponding path program 1 times [2024-10-24 16:23:28,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:28,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099029045] [2024-10-24 16:23:28,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:28,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:28,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:28,927 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:28,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-24 16:23:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:28,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:23:28,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:29,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:29,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:29,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099029045] [2024-10-24 16:23:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099029045] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:29,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:29,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2024-10-24 16:23:29,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473434271] [2024-10-24 16:23:29,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:29,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:23:29,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:29,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:23:29,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:23:29,129 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:29,289 INFO L93 Difference]: Finished difference Result 135 states and 168 transitions. [2024-10-24 16:23:29,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:23:29,290 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-10-24 16:23:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:29,290 INFO L225 Difference]: With dead ends: 135 [2024-10-24 16:23:29,291 INFO L226 Difference]: Without dead ends: 135 [2024-10-24 16:23:29,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:23:29,291 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 140 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:29,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 267 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:29,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-24 16:23:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 106. [2024-10-24 16:23:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 98 states have internal predecessors, (122), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-24 16:23:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2024-10-24 16:23:29,294 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 25 [2024-10-24 16:23:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:29,294 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2024-10-24 16:23:29,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2024-10-24 16:23:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:23:29,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:29,295 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:29,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-24 16:23:29,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:29,495 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:29,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1195673944, now seen corresponding path program 2 times [2024-10-24 16:23:29,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:29,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093190258] [2024-10-24 16:23:29,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:23:29,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:29,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:29,500 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:29,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-24 16:23:29,562 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:23:29,562 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:23:29,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 16:23:29,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:29,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:23:29,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:23:30,001 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-24 16:23:30,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:23:30,024 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 21 treesize of output 14 [2024-10-24 16:23:30,039 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:23:30,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:23:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-24 16:23:30,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:34,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:34,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093190258] [2024-10-24 16:23:34,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093190258] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:34,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [736028607] [2024-10-24 16:23:34,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:23:34,324 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:23:34,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:23:34,326 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:23:34,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-10-24 16:23:34,425 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:23:34,425 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:23:34,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 16:23:34,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:34,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:23:34,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:23:34,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:23:34,664 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 21 treesize of output 14 [2024-10-24 16:23:34,677 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:23:34,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:23:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-24 16:23:34,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:38,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [736028607] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:38,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:38,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 17 [2024-10-24 16:23:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151548813] [2024-10-24 16:23:38,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:38,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 16:23:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:38,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 16:23:38,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=285, Unknown=2, NotChecked=34, Total=380 [2024-10-24 16:23:38,868 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:39,487 INFO L93 Difference]: Finished difference Result 172 states and 216 transitions. [2024-10-24 16:23:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 16:23:39,488 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-10-24 16:23:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:39,489 INFO L225 Difference]: With dead ends: 172 [2024-10-24 16:23:39,489 INFO L226 Difference]: Without dead ends: 172 [2024-10-24 16:23:39,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=90, Invalid=464, Unknown=2, NotChecked=44, Total=600 [2024-10-24 16:23:39,489 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 113 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:39,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 468 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 500 Invalid, 0 Unknown, 140 Unchecked, 0.5s Time] [2024-10-24 16:23:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-24 16:23:39,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 106. [2024-10-24 16:23:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 98 states have internal predecessors, (122), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-24 16:23:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2024-10-24 16:23:39,493 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 26 [2024-10-24 16:23:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:39,493 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2024-10-24 16:23:39,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2024-10-24 16:23:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:23:39,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:39,493 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:39,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:39,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:39,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:39,894 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:39,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:39,894 INFO L85 PathProgramCache]: Analyzing trace with hash 8980880, now seen corresponding path program 1 times [2024-10-24 16:23:39,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:39,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081763124] [2024-10-24 16:23:39,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:39,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:39,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:39,897 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:39,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-24 16:23:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:39,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 16:23:39,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:39,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:23:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:23:40,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:23:40,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:40,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081763124] [2024-10-24 16:23:40,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081763124] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:40,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:40,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2024-10-24 16:23:40,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202999582] [2024-10-24 16:23:40,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:40,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:23:40,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:40,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:23:40,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:23:40,073 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:40,224 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2024-10-24 16:23:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:23:40,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-10-24 16:23:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:40,225 INFO L225 Difference]: With dead ends: 122 [2024-10-24 16:23:40,225 INFO L226 Difference]: Without dead ends: 122 [2024-10-24 16:23:40,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:23:40,226 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 38 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:40,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 226 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-24 16:23:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2024-10-24 16:23:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.430232558139535) internal successors, (123), 99 states have internal predecessors, (123), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-24 16:23:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 134 transitions. [2024-10-24 16:23:40,228 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 134 transitions. Word has length 28 [2024-10-24 16:23:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:40,228 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 134 transitions. [2024-10-24 16:23:40,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2024-10-24 16:23:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:23:40,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:40,229 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:40,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:40,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:40,430 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:40,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash 8980881, now seen corresponding path program 1 times [2024-10-24 16:23:40,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:40,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771109189] [2024-10-24 16:23:40,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:40,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:40,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:40,432 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:40,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-24 16:23:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:40,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 16:23:40,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:40,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:23:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:40,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:41,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:41,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771109189] [2024-10-24 16:23:41,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771109189] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:41,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:41,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2024-10-24 16:23:41,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458214105] [2024-10-24 16:23:41,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:41,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 16:23:41,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:41,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 16:23:41,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-10-24 16:23:41,284 INFO L87 Difference]: Start difference. First operand 107 states and 134 transitions. Second operand has 19 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:23:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:42,434 INFO L93 Difference]: Finished difference Result 198 states and 243 transitions. [2024-10-24 16:23:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 16:23:42,437 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2024-10-24 16:23:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:42,437 INFO L225 Difference]: With dead ends: 198 [2024-10-24 16:23:42,437 INFO L226 Difference]: Without dead ends: 198 [2024-10-24 16:23:42,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2024-10-24 16:23:42,438 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 311 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:42,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 512 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 16:23:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-24 16:23:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 129. [2024-10-24 16:23:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 120 states have internal predecessors, (157), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-24 16:23:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 171 transitions. [2024-10-24 16:23:42,441 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 171 transitions. Word has length 28 [2024-10-24 16:23:42,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:42,441 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 171 transitions. [2024-10-24 16:23:42,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:23:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 171 transitions. [2024-10-24 16:23:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:23:42,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:42,446 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:42,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-10-24 16:23:42,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:42,646 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:42,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:42,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2036157380, now seen corresponding path program 3 times [2024-10-24 16:23:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:42,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190213542] [2024-10-24 16:23:42,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 16:23:42,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:42,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:42,648 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:42,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-24 16:23:42,696 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 16:23:42,697 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:23:42,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 16:23:42,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:42,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:23:42,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:23:42,971 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-24 16:23:42,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:23:42,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:23:42,995 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:23:42,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:23:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2024-10-24 16:23:43,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:47,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:47,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190213542] [2024-10-24 16:23:47,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190213542] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:47,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1853591399] [2024-10-24 16:23:47,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 16:23:47,607 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:23:47,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:23:47,613 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:23:47,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-10-24 16:23:47,701 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 16:23:47,702 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:23:47,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 16:23:47,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:47,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-10-24 16:23:47,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:23:47,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:23:47,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:23:47,889 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:23:47,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:23:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2024-10-24 16:23:47,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:52,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1853591399] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:52,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:52,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2024-10-24 16:23:52,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785930157] [2024-10-24 16:23:52,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:52,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:23:52,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:52,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:23:52,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=152, Unknown=2, NotChecked=24, Total=210 [2024-10-24 16:23:52,056 INFO L87 Difference]: Start difference. First operand 129 states and 171 transitions. Second operand has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:52,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:52,627 INFO L93 Difference]: Finished difference Result 150 states and 191 transitions. [2024-10-24 16:23:52,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:23:52,627 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-24 16:23:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:52,628 INFO L225 Difference]: With dead ends: 150 [2024-10-24 16:23:52,628 INFO L226 Difference]: Without dead ends: 150 [2024-10-24 16:23:52,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=66, Invalid=316, Unknown=2, NotChecked=36, Total=420 [2024-10-24 16:23:52,629 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 132 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:52,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 387 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 349 Invalid, 0 Unknown, 106 Unchecked, 0.4s Time] [2024-10-24 16:23:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-24 16:23:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 124. [2024-10-24 16:23:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 116 states have internal predecessors, (152), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-24 16:23:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 163 transitions. [2024-10-24 16:23:52,631 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 163 transitions. Word has length 28 [2024-10-24 16:23:52,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:52,631 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 163 transitions. [2024-10-24 16:23:52,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 163 transitions. [2024-10-24 16:23:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 16:23:52,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:52,632 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:52,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2024-10-24 16:23:52,835 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 (26)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:53,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:53,033 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:53,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:53,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1612647018, now seen corresponding path program 1 times [2024-10-24 16:23:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:53,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729211142] [2024-10-24 16:23:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:53,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:53,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:53,034 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:53,035 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 (28)] Waiting until timeout for monitored process [2024-10-24 16:23:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:53,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 16:23:53,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:23:53,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:53,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:23:53,280 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 25 treesize of output 29 [2024-10-24 16:23:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:23:53,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:53,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729211142] [2024-10-24 16:23:53,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729211142] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:53,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:53,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-24 16:23:53,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717414756] [2024-10-24 16:23:53,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:53,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 16:23:53,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:53,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 16:23:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:23:53,452 INFO L87 Difference]: Start difference. First operand 124 states and 163 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:23:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:53,880 INFO L93 Difference]: Finished difference Result 168 states and 226 transitions. [2024-10-24 16:23:53,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:23:53,881 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-10-24 16:23:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:53,882 INFO L225 Difference]: With dead ends: 168 [2024-10-24 16:23:53,882 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 16:23:53,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-10-24 16:23:53,882 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 109 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:53,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 408 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:23:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 16:23:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 134. [2024-10-24 16:23:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.4864864864864864) internal successors, (165), 124 states have internal predecessors, (165), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-24 16:23:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 182 transitions. [2024-10-24 16:23:53,885 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 182 transitions. Word has length 29 [2024-10-24 16:23:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:53,885 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 182 transitions. [2024-10-24 16:23:53,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:23:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 182 transitions. [2024-10-24 16:23:53,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-24 16:23:53,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:53,886 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:53,893 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 (28)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:54,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:54,086 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:54,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1547549947, now seen corresponding path program 1 times [2024-10-24 16:23:54,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:54,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707817985] [2024-10-24 16:23:54,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:54,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:54,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:54,092 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:54,093 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 (29)] Waiting until timeout for monitored process [2024-10-24 16:23:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:54,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:23:54,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:54,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:23:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:23:54,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:54,299 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 36 treesize of output 32 [2024-10-24 16:23:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:23:54,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:54,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707817985] [2024-10-24 16:23:54,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707817985] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:54,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:54,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-10-24 16:23:54,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695947160] [2024-10-24 16:23:54,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:54,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:23:54,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:54,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:23:54,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:23:54,424 INFO L87 Difference]: Start difference. First operand 134 states and 182 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:23:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:54,740 INFO L93 Difference]: Finished difference Result 194 states and 262 transitions. [2024-10-24 16:23:54,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:23:54,741 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2024-10-24 16:23:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:54,742 INFO L225 Difference]: With dead ends: 194 [2024-10-24 16:23:54,742 INFO L226 Difference]: Without dead ends: 194 [2024-10-24 16:23:54,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:23:54,742 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 44 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:54,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 427 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:23:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-24 16:23:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 168. [2024-10-24 16:23:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 145 states have (on average 1.5448275862068965) internal successors, (224), 157 states have internal predecessors, (224), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-24 16:23:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2024-10-24 16:23:54,746 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 30 [2024-10-24 16:23:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:54,746 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2024-10-24 16:23:54,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:23:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2024-10-24 16:23:54,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 16:23:54,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:54,746 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:54,750 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 (29)] Ended with exit code 0 [2024-10-24 16:23:54,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:54,949 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -729407959, now seen corresponding path program 1 times [2024-10-24 16:23:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681407276] [2024-10-24 16:23:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:54,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:54,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:54,952 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:54,953 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 (30)] Waiting until timeout for monitored process [2024-10-24 16:23:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:55,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 16:23:55,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:55,276 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-10-24 16:23:55,388 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-10-24 16:23:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:23:55,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:55,497 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 36 treesize of output 32 [2024-10-24 16:23:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:23:55,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:55,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681407276] [2024-10-24 16:23:55,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681407276] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:55,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:55,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2024-10-24 16:23:55,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785119746] [2024-10-24 16:23:55,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:55,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 16:23:55,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:55,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 16:23:55,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:23:55,662 INFO L87 Difference]: Start difference. First operand 168 states and 241 transitions. Second operand has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:23:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:56,603 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2024-10-24 16:23:56,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:23:56,605 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2024-10-24 16:23:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:56,605 INFO L225 Difference]: With dead ends: 197 [2024-10-24 16:23:56,605 INFO L226 Difference]: Without dead ends: 195 [2024-10-24 16:23:56,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:23:56,606 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 134 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:56,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 460 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 16:23:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-24 16:23:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 171. [2024-10-24 16:23:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 159 states have internal predecessors, (227), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-24 16:23:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 244 transitions. [2024-10-24 16:23:56,609 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 244 transitions. Word has length 31 [2024-10-24 16:23:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:56,609 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 244 transitions. [2024-10-24 16:23:56,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:23:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 244 transitions. [2024-10-24 16:23:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:23:56,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:56,610 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:56,613 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 (30)] Ended with exit code 0 [2024-10-24 16:23:56,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:56,810 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:56,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1136810105, now seen corresponding path program 1 times [2024-10-24 16:23:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:56,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883231447] [2024-10-24 16:23:56,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:56,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:56,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:56,814 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:56,814 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 (31)] Waiting until timeout for monitored process [2024-10-24 16:23:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:56,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 16:23:56,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:56,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:23:56,948 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-10-24 16:23:56,974 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-10-24 16:23:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:23:56,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:57,014 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 44 treesize of output 40 [2024-10-24 16:23:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:23:57,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:57,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883231447] [2024-10-24 16:23:57,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883231447] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:57,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:57,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-10-24 16:23:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098456526] [2024-10-24 16:23:57,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:57,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:23:57,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:57,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:23:57,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:23:57,164 INFO L87 Difference]: Start difference. First operand 171 states and 244 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:23:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:57,547 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2024-10-24 16:23:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:23:57,548 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2024-10-24 16:23:57,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:57,549 INFO L225 Difference]: With dead ends: 180 [2024-10-24 16:23:57,549 INFO L226 Difference]: Without dead ends: 180 [2024-10-24 16:23:57,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:23:57,550 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 16 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:57,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 368 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:23:57,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-24 16:23:57,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2024-10-24 16:23:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 149 states have (on average 1.5302013422818792) internal successors, (228), 160 states have internal predecessors, (228), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-24 16:23:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 245 transitions. [2024-10-24 16:23:57,555 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 245 transitions. Word has length 32 [2024-10-24 16:23:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:57,555 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 245 transitions. [2024-10-24 16:23:57,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:23:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 245 transitions. [2024-10-24 16:23:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:23:57,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:57,556 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:57,559 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 (31)] Ended with exit code 0 [2024-10-24 16:23:57,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:57,759 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:57,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:57,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1664861710, now seen corresponding path program 1 times [2024-10-24 16:23:57,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:57,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697838528] [2024-10-24 16:23:57,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:57,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:57,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:57,762 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:57,762 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 (32)] Waiting until timeout for monitored process [2024-10-24 16:23:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:57,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:23:57,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:23:57,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 16:23:58,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:58,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697838528] [2024-10-24 16:23:58,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697838528] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:58,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:58,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-10-24 16:23:58,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941428905] [2024-10-24 16:23:58,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:58,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:23:58,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:58,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:23:58,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:23:58,054 INFO L87 Difference]: Start difference. First operand 172 states and 245 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:23:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:58,244 INFO L93 Difference]: Finished difference Result 189 states and 265 transitions. [2024-10-24 16:23:58,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:23:58,246 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 33 [2024-10-24 16:23:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:58,246 INFO L225 Difference]: With dead ends: 189 [2024-10-24 16:23:58,247 INFO L226 Difference]: Without dead ends: 189 [2024-10-24 16:23:58,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-24 16:23:58,247 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 107 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:58,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 429 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-24 16:23:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 183. [2024-10-24 16:23:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 169 states have internal predecessors, (239), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 16:23:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 259 transitions. [2024-10-24 16:23:58,253 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 259 transitions. Word has length 33 [2024-10-24 16:23:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:58,253 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 259 transitions. [2024-10-24 16:23:58,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:23:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 259 transitions. [2024-10-24 16:23:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:23:58,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:58,254 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:58,257 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 (32)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:58,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:58,454 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:58,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:58,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1642368730, now seen corresponding path program 1 times [2024-10-24 16:23:58,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:58,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755672509] [2024-10-24 16:23:58,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:58,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:58,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:58,456 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:58,457 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 (33)] Waiting until timeout for monitored process [2024-10-24 16:23:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:58,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:23:58,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:23:58,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:58,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:58,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755672509] [2024-10-24 16:23:58,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755672509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:58,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:58,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:23:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693270959] [2024-10-24 16:23:58,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:58,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:23:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:58,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:23:58,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:58,551 INFO L87 Difference]: Start difference. First operand 183 states and 259 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:23:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:58,596 INFO L93 Difference]: Finished difference Result 143 states and 185 transitions. [2024-10-24 16:23:58,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:23:58,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-24 16:23:58,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:58,597 INFO L225 Difference]: With dead ends: 143 [2024-10-24 16:23:58,597 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 16:23:58,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:58,598 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:58,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:23:58,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 16:23:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-10-24 16:23:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 119 states have (on average 1.4201680672268908) internal successors, (169), 130 states have internal predecessors, (169), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-24 16:23:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2024-10-24 16:23:58,600 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 32 [2024-10-24 16:23:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:58,601 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2024-10-24 16:23:58,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:23:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2024-10-24 16:23:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:23:58,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:58,601 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:58,604 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 (33)] Ended with exit code 0 [2024-10-24 16:23:58,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:58,804 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:58,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash -238914369, now seen corresponding path program 1 times [2024-10-24 16:23:58,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:58,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822907591] [2024-10-24 16:23:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:58,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:58,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:58,806 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:58,806 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 (34)] Waiting until timeout for monitored process [2024-10-24 16:23:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:58,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:23:58,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:23:58,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:23:59,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:59,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822907591] [2024-10-24 16:23:59,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822907591] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:59,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:59,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2024-10-24 16:23:59,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879784818] [2024-10-24 16:23:59,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:59,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:23:59,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:59,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:23:59,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:23:59,045 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:23:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:59,176 INFO L93 Difference]: Finished difference Result 149 states and 186 transitions. [2024-10-24 16:23:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:23:59,177 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2024-10-24 16:23:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:59,177 INFO L225 Difference]: With dead ends: 149 [2024-10-24 16:23:59,178 INFO L226 Difference]: Without dead ends: 149 [2024-10-24 16:23:59,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:23:59,178 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 90 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:59,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 238 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-24 16:23:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 138. [2024-10-24 16:23:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 127 states have internal predecessors, (161), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-24 16:23:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 175 transitions. [2024-10-24 16:23:59,181 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 175 transitions. Word has length 33 [2024-10-24 16:23:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:59,181 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 175 transitions. [2024-10-24 16:23:59,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:23:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2024-10-24 16:23:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:23:59,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:59,181 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:59,189 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 (34)] Ended with exit code 0 [2024-10-24 16:23:59,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:59,382 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:23:59,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:59,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1123857789, now seen corresponding path program 1 times [2024-10-24 16:23:59,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:59,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795768901] [2024-10-24 16:23:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:59,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:59,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:59,383 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:59,385 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 (35)] Waiting until timeout for monitored process [2024-10-24 16:23:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:59,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:23:59,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:23:59,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:23:59,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:59,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795768901] [2024-10-24 16:23:59,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795768901] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:59,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:59,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-10-24 16:23:59,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861804448] [2024-10-24 16:23:59,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:59,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:23:59,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:59,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:23:59,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:23:59,702 INFO L87 Difference]: Start difference. First operand 138 states and 175 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:23:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:59,908 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2024-10-24 16:23:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:23:59,909 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2024-10-24 16:23:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:59,910 INFO L225 Difference]: With dead ends: 150 [2024-10-24 16:23:59,910 INFO L226 Difference]: Without dead ends: 150 [2024-10-24 16:23:59,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:23:59,910 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 70 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:59,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 390 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:23:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-24 16:23:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-24 16:23:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 128 states have (on average 1.3515625) internal successors, (173), 138 states have internal predecessors, (173), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-24 16:23:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 187 transitions. [2024-10-24 16:23:59,913 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 187 transitions. Word has length 33 [2024-10-24 16:23:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:59,917 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 187 transitions. [2024-10-24 16:23:59,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:23:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 187 transitions. [2024-10-24 16:23:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 16:23:59,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:59,917 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:59,921 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 (35)] Ended with exit code 0 [2024-10-24 16:24:00,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:24:00,118 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:24:00,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:00,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1658605022, now seen corresponding path program 2 times [2024-10-24 16:24:00,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:00,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553838646] [2024-10-24 16:24:00,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:24:00,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:24:00,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:00,120 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:24:00,121 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 (36)] Waiting until timeout for monitored process [2024-10-24 16:24:00,203 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:24:00,203 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:24:00,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-24 16:24:00,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:00,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:24:00,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:24:00,590 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-24 16:24:00,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:24:00,608 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 21 treesize of output 14 [2024-10-24 16:24:00,615 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:24:00,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:24:00,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:24:00,779 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 21 treesize of output 14 [2024-10-24 16:24:00,793 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:24:00,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:24:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-10-24 16:24:00,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:24:01,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:01,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553838646] [2024-10-24 16:24:01,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553838646] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:24:01,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [362300534] [2024-10-24 16:24:01,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:24:01,054 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:24:01,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:24:01,055 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:24:01,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-10-24 16:24:01,185 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:24:01,185 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:24:01,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-24 16:24:01,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:01,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:24:01,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:24:01,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:24:01,428 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 21 treesize of output 14 [2024-10-24 16:24:01,435 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:24:01,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:24:01,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:24:01,545 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 21 treesize of output 14 [2024-10-24 16:24:01,553 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:24:01,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:24:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-10-24 16:24:01,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:24:09,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [362300534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:24:09,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:24:09,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 19 [2024-10-24 16:24:09,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947006804] [2024-10-24 16:24:09,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:24:09,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 16:24:09,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:09,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 16:24:09,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=356, Unknown=1, NotChecked=38, Total=462 [2024-10-24 16:24:09,723 INFO L87 Difference]: Start difference. First operand 150 states and 187 transitions. Second operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:24:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:10,613 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2024-10-24 16:24:10,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 16:24:10,613 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-10-24 16:24:10,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:10,614 INFO L225 Difference]: With dead ends: 175 [2024-10-24 16:24:10,614 INFO L226 Difference]: Without dead ends: 175 [2024-10-24 16:24:10,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=113, Invalid=646, Unknown=1, NotChecked=52, Total=812 [2024-10-24 16:24:10,615 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 89 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:10,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 501 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 594 Invalid, 0 Unknown, 106 Unchecked, 0.6s Time] [2024-10-24 16:24:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-24 16:24:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 161. [2024-10-24 16:24:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 147 states have internal predecessors, (183), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 16:24:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 203 transitions. [2024-10-24 16:24:10,618 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 203 transitions. Word has length 35 [2024-10-24 16:24:10,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:10,618 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 203 transitions. [2024-10-24 16:24:10,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:24:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 203 transitions. [2024-10-24 16:24:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:24:10,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:10,618 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:10,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2024-10-24 16:24:10,822 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 (36)] Ended with exit code 0 [2024-10-24 16:24:11,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:24:11,019 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:24:11,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1676709514, now seen corresponding path program 3 times [2024-10-24 16:24:11,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:11,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268983892] [2024-10-24 16:24:11,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 16:24:11,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:24:11,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:11,021 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:24:11,021 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 (38)] Waiting until timeout for monitored process [2024-10-24 16:24:11,150 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-24 16:24:11,151 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:24:11,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 16:24:11,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:11,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:24:11,766 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:11,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:24:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:14,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:14,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268983892] [2024-10-24 16:24:14,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268983892] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:24:14,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:24:14,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2024-10-24 16:24:14,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62247833] [2024-10-24 16:24:14,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:24:14,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-24 16:24:14,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:14,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-24 16:24:14,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1140, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 16:24:14,607 INFO L87 Difference]: Start difference. First operand 161 states and 203 transitions. Second operand has 38 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 36 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)