./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:21:04,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:21:04,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:21:04,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:21:04,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:21:04,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:21:04,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:21:04,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:21:04,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:21:04,778 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:21:04,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:21:04,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:21:04,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:21:04,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:21:04,783 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:21:04,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:21:04,784 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:21:04,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:21:04,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:21:04,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:21:04,784 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:21:04,785 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:21:04,785 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:21:04,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:21:04,786 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:21:04,786 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:21:04,786 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:21:04,786 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:21:04,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:21:04,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:21:04,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:21:04,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:21:04,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:21:04,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:21:04,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:21:04,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:21:04,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:21:04,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:21:04,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:21:04,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:21:04,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:21:04,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:21:04,789 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-clean/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-clean/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 -> 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 [2024-10-11 19:21:05,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:21:05,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:21:05,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:21:05,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:21:05,036 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:21:05,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-10-11 19:21:06,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:21:06,626 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:21:06,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-10-11 19:21:06,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a79e37c6a/4c86e9b6ab85474d8104c2d8c9e82cb8/FLAGaceebda05 [2024-10-11 19:21:06,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a79e37c6a/4c86e9b6ab85474d8104c2d8c9e82cb8 [2024-10-11 19:21:06,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:21:06,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:21:06,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:21:06,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:21:06,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:21:06,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:06" (1/1) ... [2024-10-11 19:21:06,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c764126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:06, skipping insertion in model container [2024-10-11 19:21:06,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:06" (1/1) ... [2024-10-11 19:21:06,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:21:07,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:21:07,453 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-11 19:21:07,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@19d5d4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:07, skipping insertion in model container [2024-10-11 19:21:07,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:21:07,455 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:21:07,456 INFO L158 Benchmark]: Toolchain (without parser) took 542.39ms. Allocated memory is still 165.7MB. Free memory was 102.6MB in the beginning and 124.7MB in the end (delta: -22.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 19:21:07,457 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:21:07,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 540.77ms. Allocated memory is still 165.7MB. Free memory was 102.6MB in the beginning and 124.7MB in the end (delta: -22.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 19:21:07,458 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 540.77ms. Allocated memory is still 165.7MB. Free memory was 102.6MB in the beginning and 124.7MB in the end (delta: -22.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:21:09,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:21:09,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:21:09,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:21:09,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:21:09,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:21:09,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:21:09,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:21:09,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:21:09,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:21:09,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:21:09,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:21:09,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:21:09,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:21:09,617 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:21:09,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:21:09,618 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:21:09,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:21:09,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:21:09,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:21:09,618 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:21:09,624 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:21:09,624 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:21:09,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:21:09,625 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:21:09,625 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:21:09,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:21:09,625 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:21:09,625 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:21:09,626 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:21:09,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:21:09,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:21:09,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:21:09,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:21:09,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:21:09,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:21:09,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:21:09,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:21:09,627 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:21:09,627 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:21:09,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:21:09,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:21:09,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:21:09,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:21:09,634 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:21:09,635 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-clean/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-clean/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 -> 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 [2024-10-11 19:21:10,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:21:10,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:21:10,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:21:10,084 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:21:10,089 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:21:10,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-10-11 19:21:11,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:21:11,759 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:21:11,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-10-11 19:21:11,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2bd6bdb04/be545e705f3544e5800eb179ec819b96/FLAG9ed2214c5 [2024-10-11 19:21:11,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2bd6bdb04/be545e705f3544e5800eb179ec819b96 [2024-10-11 19:21:11,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:21:11,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:21:11,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:21:11,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:21:11,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:21:11,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:11" (1/1) ... [2024-10-11 19:21:11,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487bc9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:11, skipping insertion in model container [2024-10-11 19:21:11,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:11" (1/1) ... [2024-10-11 19:21:11,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:21:12,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:21:12,370 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:21:12,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:21:12,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:21:12,436 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:21:12,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:21:12,557 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:21:12,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12 WrapperNode [2024-10-11 19:21:12,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:21:12,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:21:12,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:21:12,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:21:12,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 19:21:12,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 19:21:12,661 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1082 [2024-10-11 19:21:12,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:21:12,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:21:12,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:21:12,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:21:12,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 19:21:12,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 19:21:12,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 19:21:12,764 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-11 19:21:12,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 19:21:12,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 19:21:12,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 19:21:12,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 19:21:12,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 19:21:12,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 19:21:12,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:21:12,836 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:21:12,836 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:21:12,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:21:12,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 19:21:12,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:21:12,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:21:12,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:21:12,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:21:12,920 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 19:21:12,920 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 19:21:12,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:21:12,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:21:12,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 19:21:12,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:21:12,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:21:12,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:21:12,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:21:12,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:21:12,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 19:21:12,922 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:21:12,922 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:21:12,922 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 19:21:12,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:21:12,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:21:12,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:21:12,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:21:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:21:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:21:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:21:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:21:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:21:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:21:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:21:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:21:12,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:21:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:21:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:21:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:21:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:21:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:21:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:21:12,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:21:13,099 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:21:13,101 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:21:13,144 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:21:13,177 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:21:13,196 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:21:15,954 INFO L? ?]: Removed 1101 outVars from TransFormulas that were not future-live. [2024-10-11 19:21:15,954 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:21:16,092 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:21:16,093 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 19:21:16,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:16 BoogieIcfgContainer [2024-10-11 19:21:16,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:21:16,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:21:16,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:21:16,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:21:16,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:21:11" (1/3) ... [2024-10-11 19:21:16,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671e8ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:16, skipping insertion in model container [2024-10-11 19:21:16,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (2/3) ... [2024-10-11 19:21:16,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671e8ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:16, skipping insertion in model container [2024-10-11 19:21:16,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:16" (3/3) ... [2024-10-11 19:21:16,106 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test2-2.i [2024-10-11 19:21:16,117 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:21:16,117 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-10-11 19:21:16,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:21:16,184 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;@740e1a26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:21:16,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-10-11 19:21:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 978 states, 438 states have (on average 2.5) internal successors, (1095), 971 states have internal predecessors, (1095), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 19:21:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:21:16,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:16,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:21:16,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:16,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash 55623, now seen corresponding path program 1 times [2024-10-11 19:21:16,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:16,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186152049] [2024-10-11 19:21:16,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:16,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:16,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:16,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:16,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:16,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:16,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:16,356 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-11 19:21:16,365 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-11 19:21:16,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:16,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:16,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186152049] [2024-10-11 19:21:16,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186152049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:16,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:16,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:21:16,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346714647] [2024-10-11 19:21:16,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:16,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:16,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:16,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:16,429 INFO L87 Difference]: Start difference. First operand has 978 states, 438 states have (on average 2.5) internal successors, (1095), 971 states have internal predecessors, (1095), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:17,829 INFO L93 Difference]: Finished difference Result 1128 states and 1205 transitions. [2024-10-11 19:21:17,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:17,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-11 19:21:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:17,857 INFO L225 Difference]: With dead ends: 1128 [2024-10-11 19:21:17,857 INFO L226 Difference]: Without dead ends: 1127 [2024-10-11 19:21:17,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:17,861 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 891 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:17,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 671 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 19:21:17,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2024-10-11 19:21:17,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 963. [2024-10-11 19:21:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 441 states have (on average 2.2970521541950113) internal successors, (1013), 956 states have internal predecessors, (1013), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:21:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1031 transitions. [2024-10-11 19:21:17,931 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1031 transitions. Word has length 2 [2024-10-11 19:21:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:17,931 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1031 transitions. [2024-10-11 19:21:17,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1031 transitions. [2024-10-11 19:21:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:21:17,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:17,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:21:17,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:18,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:18,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:18,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:18,134 INFO L85 PathProgramCache]: Analyzing trace with hash 55624, now seen corresponding path program 1 times [2024-10-11 19:21:18,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:18,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826311172] [2024-10-11 19:21:18,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:18,134 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-11 19:21:18,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:18,137 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:18,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:18,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:21:18,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:18,217 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-11 19:21:18,226 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-11 19:21:18,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:18,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:18,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826311172] [2024-10-11 19:21:18,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826311172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:18,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:18,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:21:18,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603576834] [2024-10-11 19:21:18,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:18,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:18,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:18,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:18,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:18,229 INFO L87 Difference]: Start difference. First operand 963 states and 1031 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:19,990 INFO L93 Difference]: Finished difference Result 1350 states and 1461 transitions. [2024-10-11 19:21:19,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:19,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-11 19:21:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:19,994 INFO L225 Difference]: With dead ends: 1350 [2024-10-11 19:21:19,994 INFO L226 Difference]: Without dead ends: 1350 [2024-10-11 19:21:19,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:19,995 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 419 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:19,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1261 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:21:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2024-10-11 19:21:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1079. [2024-10-11 19:21:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 553 states have (on average 2.236889692585895) internal successors, (1237), 1072 states have internal predecessors, (1237), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1265 transitions. [2024-10-11 19:21:20,016 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1265 transitions. Word has length 2 [2024-10-11 19:21:20,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:20,016 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1265 transitions. [2024-10-11 19:21:20,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:20,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1265 transitions. [2024-10-11 19:21:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 19:21:20,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:20,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:21:20,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 19:21:20,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:20,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:20,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:20,220 INFO L85 PathProgramCache]: Analyzing trace with hash -170130095, now seen corresponding path program 1 times [2024-10-11 19:21:20,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:20,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058013092] [2024-10-11 19:21:20,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:20,221 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-11 19:21:20,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:20,223 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:20,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:20,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:21:20,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:20,338 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-11 19:21:20,342 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-11 19:21:20,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:21:20,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:21:20,395 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:21:20,395 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-11 19:21:20,410 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-11 19:21:20,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:20,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:20,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058013092] [2024-10-11 19:21:20,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058013092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:20,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:20,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:20,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91440438] [2024-10-11 19:21:20,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:20,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:20,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:20,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:20,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:20,412 INFO L87 Difference]: Start difference. First operand 1079 states and 1265 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:22,291 INFO L93 Difference]: Finished difference Result 1232 states and 1426 transitions. [2024-10-11 19:21:22,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:22,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 19:21:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:22,295 INFO L225 Difference]: With dead ends: 1232 [2024-10-11 19:21:22,296 INFO L226 Difference]: Without dead ends: 1232 [2024-10-11 19:21:22,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:22,296 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 2033 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2041 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:22,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2041 Valid, 346 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 19:21:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2024-10-11 19:21:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 951. [2024-10-11 19:21:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 441 states have (on average 2.2675736961451247) internal successors, (1000), 944 states have internal predecessors, (1000), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:21:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1018 transitions. [2024-10-11 19:21:22,311 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1018 transitions. Word has length 6 [2024-10-11 19:21:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:22,313 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1018 transitions. [2024-10-11 19:21:22,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1018 transitions. [2024-10-11 19:21:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:21:22,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:22,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:22,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 19:21:22,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:22,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:22,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash -979065647, now seen corresponding path program 1 times [2024-10-11 19:21:22,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:22,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134722094] [2024-10-11 19:21:22,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:22,517 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-11 19:21:22,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:22,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:22,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:22,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:21:22,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:22,632 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-11 19:21:22,658 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-11 19:21:22,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:22,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:22,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134722094] [2024-10-11 19:21:22,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134722094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:22,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:22,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:22,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422374435] [2024-10-11 19:21:22,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:22,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:22,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:22,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:22,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:22,660 INFO L87 Difference]: Start difference. First operand 951 states and 1018 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:24,379 INFO L93 Difference]: Finished difference Result 1219 states and 1325 transitions. [2024-10-11 19:21:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:24,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 19:21:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:24,384 INFO L225 Difference]: With dead ends: 1219 [2024-10-11 19:21:24,384 INFO L226 Difference]: Without dead ends: 1219 [2024-10-11 19:21:24,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:24,385 INFO L432 NwaCegarLoop]: 933 mSDtfsCounter, 460 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:24,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1299 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:21:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-10-11 19:21:24,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 968. [2024-10-11 19:21:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 468 states have (on average 2.2606837606837606) internal successors, (1058), 961 states have internal predecessors, (1058), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:21:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1076 transitions. [2024-10-11 19:21:24,399 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1076 transitions. Word has length 7 [2024-10-11 19:21:24,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:24,400 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1076 transitions. [2024-10-11 19:21:24,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1076 transitions. [2024-10-11 19:21:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:21:24,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:24,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:24,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 19:21:24,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:24,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:24,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:24,602 INFO L85 PathProgramCache]: Analyzing trace with hash -979065648, now seen corresponding path program 1 times [2024-10-11 19:21:24,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:24,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071764846] [2024-10-11 19:21:24,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:24,603 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-11 19:21:24,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:24,605 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:24,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:24,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:24,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:24,706 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-11 19:21:24,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-11 19:21:24,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:24,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:24,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071764846] [2024-10-11 19:21:24,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071764846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:24,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:24,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:24,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557646782] [2024-10-11 19:21:24,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:24,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:24,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:24,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:24,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:24,718 INFO L87 Difference]: Start difference. First operand 968 states and 1076 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:25,844 INFO L93 Difference]: Finished difference Result 1126 states and 1262 transitions. [2024-10-11 19:21:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:25,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 19:21:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:25,847 INFO L225 Difference]: With dead ends: 1126 [2024-10-11 19:21:25,847 INFO L226 Difference]: Without dead ends: 1126 [2024-10-11 19:21:25,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:25,848 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 681 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:25,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 988 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:21:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2024-10-11 19:21:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 921. [2024-10-11 19:21:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 468 states have (on average 2.1517094017094016) internal successors, (1007), 914 states have internal predecessors, (1007), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:21:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1025 transitions. [2024-10-11 19:21:25,860 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1025 transitions. Word has length 7 [2024-10-11 19:21:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:25,860 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1025 transitions. [2024-10-11 19:21:25,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1025 transitions. [2024-10-11 19:21:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 19:21:25,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:25,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:25,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 19:21:26,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:26,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:26,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1432976317, now seen corresponding path program 1 times [2024-10-11 19:21:26,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:26,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409072144] [2024-10-11 19:21:26,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:26,064 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-11 19:21:26,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:26,065 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:26,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:26,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:26,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:26,236 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-11 19:21:26,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:26,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:26,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409072144] [2024-10-11 19:21:26,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409072144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:26,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:26,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:26,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297091780] [2024-10-11 19:21:26,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:26,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:26,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:26,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:26,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:26,238 INFO L87 Difference]: Start difference. First operand 921 states and 1025 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:27,058 INFO L93 Difference]: Finished difference Result 1326 states and 1496 transitions. [2024-10-11 19:21:27,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:27,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 19:21:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:27,063 INFO L225 Difference]: With dead ends: 1326 [2024-10-11 19:21:27,067 INFO L226 Difference]: Without dead ends: 1326 [2024-10-11 19:21:27,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:27,068 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 431 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:27,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1665 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:21:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2024-10-11 19:21:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1075. [2024-10-11 19:21:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 617 states have (on average 2.081037277147488) internal successors, (1284), 1068 states have internal predecessors, (1284), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1312 transitions. [2024-10-11 19:21:27,103 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1312 transitions. Word has length 10 [2024-10-11 19:21:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:27,104 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1312 transitions. [2024-10-11 19:21:27,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1312 transitions. [2024-10-11 19:21:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 19:21:27,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:27,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:27,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:27,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:27,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:27,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:27,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1214525722, now seen corresponding path program 1 times [2024-10-11 19:21:27,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:27,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475577078] [2024-10-11 19:21:27,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:27,315 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-11 19:21:27,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:27,317 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:27,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:27,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:21:27,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:27,435 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-11 19:21:27,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:27,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:27,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475577078] [2024-10-11 19:21:27,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475577078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:27,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:27,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:27,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264577937] [2024-10-11 19:21:27,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:27,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:27,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:27,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:27,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:27,440 INFO L87 Difference]: Start difference. First operand 1075 states and 1312 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:27,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:27,919 INFO L93 Difference]: Finished difference Result 1021 states and 1232 transitions. [2024-10-11 19:21:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:27,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 19:21:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:27,925 INFO L225 Difference]: With dead ends: 1021 [2024-10-11 19:21:27,925 INFO L226 Difference]: Without dead ends: 1021 [2024-10-11 19:21:27,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:27,926 INFO L432 NwaCegarLoop]: 800 mSDtfsCounter, 61 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:27,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1558 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:21:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-10-11 19:21:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2024-10-11 19:21:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 587 states have (on average 2.0511073253833048) internal successors, (1204), 1014 states have internal predecessors, (1204), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1232 transitions. [2024-10-11 19:21:27,950 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1232 transitions. Word has length 12 [2024-10-11 19:21:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:27,950 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1232 transitions. [2024-10-11 19:21:27,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1232 transitions. [2024-10-11 19:21:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 19:21:27,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:27,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:27,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 19:21:28,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:28,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr424REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:28,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:28,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2110353888, now seen corresponding path program 1 times [2024-10-11 19:21:28,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:28,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9595922] [2024-10-11 19:21:28,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:28,157 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-11 19:21:28,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:28,158 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:28,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:28,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:21:28,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:28,359 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-11 19:21:28,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:28,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:28,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9595922] [2024-10-11 19:21:28,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9595922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:28,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:28,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:28,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103282990] [2024-10-11 19:21:28,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:28,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:28,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:28,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:28,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:28,360 INFO L87 Difference]: Start difference. First operand 1021 states and 1232 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:29,512 INFO L93 Difference]: Finished difference Result 1250 states and 1418 transitions. [2024-10-11 19:21:29,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:29,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 19:21:29,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:29,520 INFO L225 Difference]: With dead ends: 1250 [2024-10-11 19:21:29,520 INFO L226 Difference]: Without dead ends: 1250 [2024-10-11 19:21:29,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:21:29,520 INFO L432 NwaCegarLoop]: 859 mSDtfsCounter, 394 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:29,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 2358 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:21:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-10-11 19:21:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1023. [2024-10-11 19:21:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 589 states have (on average 2.0475382003395586) internal successors, (1206), 1016 states have internal predecessors, (1206), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1234 transitions. [2024-10-11 19:21:29,535 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1234 transitions. Word has length 13 [2024-10-11 19:21:29,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:29,535 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1234 transitions. [2024-10-11 19:21:29,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:29,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1234 transitions. [2024-10-11 19:21:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 19:21:29,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:29,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:29,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:29,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:29,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:29,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2110346978, now seen corresponding path program 1 times [2024-10-11 19:21:29,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:29,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191506725] [2024-10-11 19:21:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:29,741 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-11 19:21:29,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:29,743 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:29,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:29,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:21:29,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:29,898 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:21:29,899 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:21:29,899 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:21:29,902 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 30 treesize of output 39 [2024-10-11 19:21:29,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:21:29,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-11 19:21:29,938 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-11 19:21:29,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:29,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:29,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191506725] [2024-10-11 19:21:29,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191506725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:29,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:29,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:29,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315363185] [2024-10-11 19:21:29,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:29,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:29,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:29,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:29,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:29,940 INFO L87 Difference]: Start difference. First operand 1023 states and 1234 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:30,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:30,812 INFO L93 Difference]: Finished difference Result 1775 states and 2009 transitions. [2024-10-11 19:21:30,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:30,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 19:21:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:30,824 INFO L225 Difference]: With dead ends: 1775 [2024-10-11 19:21:30,825 INFO L226 Difference]: Without dead ends: 1775 [2024-10-11 19:21:30,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:21:30,827 INFO L432 NwaCegarLoop]: 978 mSDtfsCounter, 842 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:30,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 2745 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:21:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2024-10-11 19:21:30,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1022. [2024-10-11 19:21:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 588 states have (on average 2.0476190476190474) internal successors, (1204), 1015 states have internal predecessors, (1204), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1232 transitions. [2024-10-11 19:21:30,846 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1232 transitions. Word has length 13 [2024-10-11 19:21:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:30,848 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1232 transitions. [2024-10-11 19:21:30,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1232 transitions. [2024-10-11 19:21:30,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 19:21:30,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:30,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:30,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 19:21:31,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:31,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:31,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:31,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1015086425, now seen corresponding path program 1 times [2024-10-11 19:21:31,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:31,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769989283] [2024-10-11 19:21:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:31,051 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-11 19:21:31,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:31,056 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:31,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:31,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:21:31,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:31,178 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-11 19:21:31,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:31,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:31,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769989283] [2024-10-11 19:21:31,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769989283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:31,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:31,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:31,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307412290] [2024-10-11 19:21:31,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:31,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:31,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:31,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:31,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:31,180 INFO L87 Difference]: Start difference. First operand 1022 states and 1232 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:31,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:31,586 INFO L93 Difference]: Finished difference Result 968 states and 1152 transitions. [2024-10-11 19:21:31,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:31,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 19:21:31,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:31,590 INFO L225 Difference]: With dead ends: 968 [2024-10-11 19:21:31,590 INFO L226 Difference]: Without dead ends: 968 [2024-10-11 19:21:31,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:31,590 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 61 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:31,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1484 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 19:21:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-10-11 19:21:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 968. [2024-10-11 19:21:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 558 states have (on average 2.014336917562724) internal successors, (1124), 961 states have internal predecessors, (1124), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1152 transitions. [2024-10-11 19:21:31,600 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1152 transitions. Word has length 15 [2024-10-11 19:21:31,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:31,600 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1152 transitions. [2024-10-11 19:21:31,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1152 transitions. [2024-10-11 19:21:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 19:21:31,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:31,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:31,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 19:21:31,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:31,802 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:31,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:31,802 INFO L85 PathProgramCache]: Analyzing trace with hash -540480991, now seen corresponding path program 1 times [2024-10-11 19:21:31,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:31,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598486874] [2024-10-11 19:21:31,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:31,803 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-11 19:21:31,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:31,805 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:31,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:31,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:31,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:31,942 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-11 19:21:31,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:31,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:31,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598486874] [2024-10-11 19:21:31,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598486874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:31,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:31,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:31,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900629862] [2024-10-11 19:21:31,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:31,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:31,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:31,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:31,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:31,948 INFO L87 Difference]: Start difference. First operand 968 states and 1152 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:32,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:32,700 INFO L93 Difference]: Finished difference Result 952 states and 1108 transitions. [2024-10-11 19:21:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:21:32,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 19:21:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:32,705 INFO L225 Difference]: With dead ends: 952 [2024-10-11 19:21:32,705 INFO L226 Difference]: Without dead ends: 952 [2024-10-11 19:21:32,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:21:32,706 INFO L432 NwaCegarLoop]: 732 mSDtfsCounter, 45 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:32,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2178 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:21:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-10-11 19:21:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2024-10-11 19:21:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 556 states have (on average 1.9424460431654675) internal successors, (1080), 945 states have internal predecessors, (1080), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1108 transitions. [2024-10-11 19:21:32,717 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1108 transitions. Word has length 17 [2024-10-11 19:21:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:32,717 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1108 transitions. [2024-10-11 19:21:32,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1108 transitions. [2024-10-11 19:21:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:21:32,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:32,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:32,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:32,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:32,919 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:32,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1534247825, now seen corresponding path program 1 times [2024-10-11 19:21:32,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:32,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974559168] [2024-10-11 19:21:32,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:32,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:32,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:32,923 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:32,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:33,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:21:33,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:33,047 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-11 19:21:33,090 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-11 19:21:33,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:33,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:33,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974559168] [2024-10-11 19:21:33,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974559168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:33,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:33,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:33,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053712227] [2024-10-11 19:21:33,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:33,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:33,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:33,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:33,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:33,092 INFO L87 Difference]: Start difference. First operand 952 states and 1108 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:34,213 INFO L93 Difference]: Finished difference Result 956 states and 1108 transitions. [2024-10-11 19:21:34,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:34,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-11 19:21:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:34,216 INFO L225 Difference]: With dead ends: 956 [2024-10-11 19:21:34,216 INFO L226 Difference]: Without dead ends: 956 [2024-10-11 19:21:34,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:21:34,217 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 583 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:34,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 936 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:21:34,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-10-11 19:21:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 948. [2024-10-11 19:21:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 556 states have (on average 1.9280575539568345) internal successors, (1072), 941 states have internal predecessors, (1072), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1100 transitions. [2024-10-11 19:21:34,226 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1100 transitions. Word has length 31 [2024-10-11 19:21:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:34,226 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1100 transitions. [2024-10-11 19:21:34,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1100 transitions. [2024-10-11 19:21:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:21:34,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:34,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:34,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 19:21:34,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:34,428 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:34,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1534247824, now seen corresponding path program 1 times [2024-10-11 19:21:34,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:34,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849100393] [2024-10-11 19:21:34,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:34,429 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-11 19:21:34,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:34,431 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:34,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:34,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:21:34,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:34,562 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-11 19:21:34,660 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-11 19:21:34,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:34,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:34,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849100393] [2024-10-11 19:21:34,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849100393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:34,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:34,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:34,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223983222] [2024-10-11 19:21:34,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:34,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:34,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:34,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:34,662 INFO L87 Difference]: Start difference. First operand 948 states and 1100 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:36,401 INFO L93 Difference]: Finished difference Result 1231 states and 1425 transitions. [2024-10-11 19:21:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:36,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-11 19:21:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:36,404 INFO L225 Difference]: With dead ends: 1231 [2024-10-11 19:21:36,404 INFO L226 Difference]: Without dead ends: 1231 [2024-10-11 19:21:36,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:21:36,405 INFO L432 NwaCegarLoop]: 874 mSDtfsCounter, 358 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:36,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1752 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:21:36,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-10-11 19:21:36,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 944. [2024-10-11 19:21:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 556 states have (on average 1.9136690647482015) internal successors, (1064), 937 states have internal predecessors, (1064), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1092 transitions. [2024-10-11 19:21:36,423 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1092 transitions. Word has length 31 [2024-10-11 19:21:36,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:36,424 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1092 transitions. [2024-10-11 19:21:36,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:36,424 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1092 transitions. [2024-10-11 19:21:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 19:21:36,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:36,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:36,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:36,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:36,629 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:36,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1733807225, now seen corresponding path program 1 times [2024-10-11 19:21:36,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:36,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100588491] [2024-10-11 19:21:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:36,630 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-11 19:21:36,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:36,632 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:36,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:36,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:36,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:36,820 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-11 19:21:36,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:36,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:36,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100588491] [2024-10-11 19:21:36,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100588491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:36,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:36,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:36,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235863893] [2024-10-11 19:21:36,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:36,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:36,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:36,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:36,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:36,822 INFO L87 Difference]: Start difference. First operand 944 states and 1092 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:37,362 INFO L93 Difference]: Finished difference Result 932 states and 1072 transitions. [2024-10-11 19:21:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:21:37,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 19:21:37,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:37,366 INFO L225 Difference]: With dead ends: 932 [2024-10-11 19:21:37,366 INFO L226 Difference]: Without dead ends: 932 [2024-10-11 19:21:37,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:21:37,366 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 15 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:37,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2161 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:21:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-10-11 19:21:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2024-10-11 19:21:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 544 states have (on average 1.9191176470588236) internal successors, (1044), 925 states have internal predecessors, (1044), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1072 transitions. [2024-10-11 19:21:37,375 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1072 transitions. Word has length 50 [2024-10-11 19:21:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:37,375 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1072 transitions. [2024-10-11 19:21:37,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1072 transitions. [2024-10-11 19:21:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 19:21:37,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:37,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:37,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 19:21:37,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:37,581 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:37,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1202208248, now seen corresponding path program 1 times [2024-10-11 19:21:37,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:37,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396070748] [2024-10-11 19:21:37,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:37,583 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-11 19:21:37,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:37,585 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:37,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:37,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:21:37,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:37,836 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-11 19:21:37,840 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-11 19:21:38,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:21:38,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:21:38,152 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:21:38,152 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-11 19:21:38,159 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-11 19:21:38,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:38,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396070748] [2024-10-11 19:21:38,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396070748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:38,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:38,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:38,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284062351] [2024-10-11 19:21:38,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:38,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:38,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:38,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:38,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:38,161 INFO L87 Difference]: Start difference. First operand 932 states and 1072 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:39,358 INFO L93 Difference]: Finished difference Result 894 states and 1034 transitions. [2024-10-11 19:21:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:39,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 19:21:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:39,360 INFO L225 Difference]: With dead ends: 894 [2024-10-11 19:21:39,360 INFO L226 Difference]: Without dead ends: 894 [2024-10-11 19:21:39,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:39,361 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 516 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:39,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 510 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:21:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-10-11 19:21:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 867. [2024-10-11 19:21:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 517 states have (on average 1.8220502901353965) internal successors, (942), 860 states have internal predecessors, (942), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 970 transitions. [2024-10-11 19:21:39,369 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 970 transitions. Word has length 54 [2024-10-11 19:21:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:39,369 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 970 transitions. [2024-10-11 19:21:39,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 970 transitions. [2024-10-11 19:21:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 19:21:39,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:39,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 19:21:39,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:39,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:39,571 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:39,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:39,571 INFO L85 PathProgramCache]: Analyzing trace with hash -307702477, now seen corresponding path program 1 times [2024-10-11 19:21:39,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:39,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720984512] [2024-10-11 19:21:39,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:39,572 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-11 19:21:39,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:39,574 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:39,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:39,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:21:39,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:39,771 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-11 19:21:39,779 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 19 treesize of output 1 [2024-10-11 19:21:39,820 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 23 treesize of output 11 [2024-10-11 19:21:39,826 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-11 19:21:39,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:39,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:39,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720984512] [2024-10-11 19:21:39,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720984512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:39,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:39,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:39,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318700916] [2024-10-11 19:21:39,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:39,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:21:39,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:39,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:21:39,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:21:39,828 INFO L87 Difference]: Start difference. First operand 867 states and 970 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:41,294 INFO L93 Difference]: Finished difference Result 866 states and 969 transitions. [2024-10-11 19:21:41,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:21:41,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-11 19:21:41,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:41,297 INFO L225 Difference]: With dead ends: 866 [2024-10-11 19:21:41,297 INFO L226 Difference]: Without dead ends: 866 [2024-10-11 19:21:41,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:21:41,297 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 2 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:41,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1865 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 19:21:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-10-11 19:21:41,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2024-10-11 19:21:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 517 states have (on average 1.8201160541586074) internal successors, (941), 859 states have internal predecessors, (941), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 969 transitions. [2024-10-11 19:21:41,305 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 969 transitions. Word has length 58 [2024-10-11 19:21:41,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:41,305 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 969 transitions. [2024-10-11 19:21:41,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 969 transitions. [2024-10-11 19:21:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 19:21:41,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:41,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 19:21:41,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:41,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:41,507 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:41,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:41,507 INFO L85 PathProgramCache]: Analyzing trace with hash -307702476, now seen corresponding path program 1 times [2024-10-11 19:21:41,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:41,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149246597] [2024-10-11 19:21:41,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:41,508 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-11 19:21:41,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:41,509 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:41,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 19:21:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:41,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:21:41,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:41,716 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-11 19:21:41,728 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 19 treesize of output 1 [2024-10-11 19:21:41,732 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 13 treesize of output 9 [2024-10-11 19:21:41,756 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 21 treesize of output 9 [2024-10-11 19:21:41,767 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-11 19:21:41,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:41,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:41,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149246597] [2024-10-11 19:21:41,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149246597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:41,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:41,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:41,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25164169] [2024-10-11 19:21:41,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:41,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:21:41,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:21:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:21:41,769 INFO L87 Difference]: Start difference. First operand 866 states and 969 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:43,527 INFO L93 Difference]: Finished difference Result 865 states and 968 transitions. [2024-10-11 19:21:43,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:21:43,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-11 19:21:43,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:43,531 INFO L225 Difference]: With dead ends: 865 [2024-10-11 19:21:43,531 INFO L226 Difference]: Without dead ends: 865 [2024-10-11 19:21:43,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:21:43,532 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 1 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:43,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1896 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:21:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-10-11 19:21:43,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-10-11 19:21:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 516 states have (on average 1.821705426356589) internal successors, (940), 858 states have internal predecessors, (940), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:21:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 968 transitions. [2024-10-11 19:21:43,544 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 968 transitions. Word has length 58 [2024-10-11 19:21:43,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:43,545 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 968 transitions. [2024-10-11 19:21:43,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 968 transitions. [2024-10-11 19:21:43,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 19:21:43,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:43,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:43,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 19:21:43,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:43,750 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:43,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:43,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1320478135, now seen corresponding path program 1 times [2024-10-11 19:21:43,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:43,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632214576] [2024-10-11 19:21:43,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:43,751 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-11 19:21:43,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:43,755 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:43,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:44,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:44,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:44,031 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-11 19:21:44,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:44,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:44,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632214576] [2024-10-11 19:21:44,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632214576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:44,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:44,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:44,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10580907] [2024-10-11 19:21:44,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:44,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:44,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:44,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:44,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:44,037 INFO L87 Difference]: Start difference. First operand 865 states and 968 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-11 19:21:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:44,541 INFO L93 Difference]: Finished difference Result 867 states and 971 transitions. [2024-10-11 19:21:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:44,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-11 19:21:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:44,546 INFO L225 Difference]: With dead ends: 867 [2024-10-11 19:21:44,546 INFO L226 Difference]: Without dead ends: 867 [2024-10-11 19:21:44,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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-11 19:21:44,546 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 0 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:44,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2097 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:21:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-10-11 19:21:44,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2024-10-11 19:21:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 517 states have (on average 1.8220502901353965) internal successors, (942), 860 states have internal predecessors, (942), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:21:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 971 transitions. [2024-10-11 19:21:44,556 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 971 transitions. Word has length 64 [2024-10-11 19:21:44,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:44,556 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 971 transitions. [2024-10-11 19:21:44,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-11 19:21:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 971 transitions. [2024-10-11 19:21:44,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 19:21:44,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:44,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:44,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:44,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:44,758 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:44,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:44,758 INFO L85 PathProgramCache]: Analyzing trace with hash -259550089, now seen corresponding path program 1 times [2024-10-11 19:21:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:44,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328600705] [2024-10-11 19:21:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:44,759 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-11 19:21:44,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:44,760 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:44,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:44,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:21:44,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:45,025 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-11 19:21:45,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:21:45,099 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-11 19:21:45,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328600705] [2024-10-11 19:21:45,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328600705] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:21:45,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:21:45,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:21:45,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058645575] [2024-10-11 19:21:45,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:21:45,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:21:45,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:45,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:21:45,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:21:45,101 INFO L87 Difference]: Start difference. First operand 867 states and 971 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:21:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:46,171 INFO L93 Difference]: Finished difference Result 876 states and 985 transitions. [2024-10-11 19:21:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:21:46,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-10-11 19:21:46,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:46,176 INFO L225 Difference]: With dead ends: 876 [2024-10-11 19:21:46,176 INFO L226 Difference]: Without dead ends: 876 [2024-10-11 19:21:46,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:21:46,177 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 4 mSDsluCounter, 4182 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4881 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:46,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4881 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 19:21:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-10-11 19:21:46,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 875. [2024-10-11 19:21:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 524 states have (on average 1.8225190839694656) internal successors, (955), 867 states have internal predecessors, (955), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:21:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 984 transitions. [2024-10-11 19:21:46,186 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 984 transitions. Word has length 65 [2024-10-11 19:21:46,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:46,186 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 984 transitions. [2024-10-11 19:21:46,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:21:46,186 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 984 transitions. [2024-10-11 19:21:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 19:21:46,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:46,187 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:46,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:46,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:46,388 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:46,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2058709577, now seen corresponding path program 2 times [2024-10-11 19:21:46,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:46,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802197992] [2024-10-11 19:21:46,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:21:46,389 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-11 19:21:46,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:46,390 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:46,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:46,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:21:46,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:21:46,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:21:46,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:46,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:21:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:46,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802197992] [2024-10-11 19:21:46,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802197992] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:21:46,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:21:46,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:21:46,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652616475] [2024-10-11 19:21:46,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:21:46,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:21:46,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:46,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:21:46,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:21:46,994 INFO L87 Difference]: Start difference. First operand 875 states and 984 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:21:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:48,342 INFO L93 Difference]: Finished difference Result 887 states and 1003 transitions. [2024-10-11 19:21:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:21:48,345 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-10-11 19:21:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:48,347 INFO L225 Difference]: With dead ends: 887 [2024-10-11 19:21:48,347 INFO L226 Difference]: Without dead ends: 885 [2024-10-11 19:21:48,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 19:21:48,349 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 7 mSDsluCounter, 4883 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5582 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:48,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5582 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:21:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-11 19:21:48,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 884. [2024-10-11 19:21:48,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 533 states have (on average 1.8142589118198875) internal successors, (967), 876 states have internal predecessors, (967), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:21:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 996 transitions. [2024-10-11 19:21:48,358 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 996 transitions. Word has length 68 [2024-10-11 19:21:48,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:48,358 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 996 transitions. [2024-10-11 19:21:48,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:21:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 996 transitions. [2024-10-11 19:21:48,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 19:21:48,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:48,359 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:48,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:48,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:48,564 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:48,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash -326754889, now seen corresponding path program 3 times [2024-10-11 19:21:48,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:48,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816404006] [2024-10-11 19:21:48,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:21:48,565 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-11 19:21:48,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:48,566 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:48,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:49,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:21:49,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:21:49,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:21:49,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:49,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:21:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:49,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:49,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816404006] [2024-10-11 19:21:49,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816404006] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:21:49,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:21:49,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:21:49,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865806247] [2024-10-11 19:21:49,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:21:49,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:21:49,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:49,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:21:49,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:21:49,685 INFO L87 Difference]: Start difference. First operand 884 states and 996 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:21:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:52,791 INFO L93 Difference]: Finished difference Result 905 states and 1032 transitions. [2024-10-11 19:21:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:21:52,792 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2024-10-11 19:21:52,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:52,794 INFO L225 Difference]: With dead ends: 905 [2024-10-11 19:21:52,794 INFO L226 Difference]: Without dead ends: 902 [2024-10-11 19:21:52,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 19:21:52,795 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 13 mSDsluCounter, 7676 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8375 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:52,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8375 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 19:21:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-11 19:21:52,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2024-10-11 19:21:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 551 states have (on average 1.7967332123411979) internal successors, (990), 894 states have internal predecessors, (990), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:21:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1019 transitions. [2024-10-11 19:21:52,803 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1019 transitions. Word has length 74 [2024-10-11 19:21:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:52,803 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1019 transitions. [2024-10-11 19:21:52,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:21:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1019 transitions. [2024-10-11 19:21:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 19:21:52,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:52,804 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:52,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Ended with exit code 0 [2024-10-11 19:21:53,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:53,008 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:21:53,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:53,009 INFO L85 PathProgramCache]: Analyzing trace with hash 220933559, now seen corresponding path program 4 times [2024-10-11 19:21:53,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:53,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382576111] [2024-10-11 19:21:53,009 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:21:53,009 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-11 19:21:53,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:53,012 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:21:53,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-11 19:21:53,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:21:53,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:21:53,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 19:21:53,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:53,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:21:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:55,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:55,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382576111] [2024-10-11 19:21:55,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382576111] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:21:55,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:21:55,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:21:55,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473928726] [2024-10-11 19:21:55,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:21:55,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:21:55,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:55,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:21:55,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:21:55,057 INFO L87 Difference]: Start difference. First operand 902 states and 1019 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:22:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:03,625 INFO L93 Difference]: Finished difference Result 939 states and 1087 transitions. [2024-10-11 19:22:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:22:03,625 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-10-11 19:22:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:03,628 INFO L225 Difference]: With dead ends: 939 [2024-10-11 19:22:03,628 INFO L226 Difference]: Without dead ends: 936 [2024-10-11 19:22:03,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 19:22:03,630 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 25 mSDsluCounter, 16048 mSDsCounter, 0 mSdLazyCounter, 4094 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16747 SdHoareTripleChecker+Invalid, 4124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:03,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16747 Invalid, 4124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4094 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-11 19:22:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2024-10-11 19:22:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 936. [2024-10-11 19:22:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 585 states have (on average 1.7658119658119658) internal successors, (1033), 928 states have internal predecessors, (1033), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:22:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1062 transitions. [2024-10-11 19:22:03,642 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1062 transitions. Word has length 86 [2024-10-11 19:22:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:03,642 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1062 transitions. [2024-10-11 19:22:03,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:22:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1062 transitions. [2024-10-11 19:22:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 19:22:03,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:03,643 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:03,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-11 19:22:03,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:03,848 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:22:03,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash -499419721, now seen corresponding path program 5 times [2024-10-11 19:22:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:03,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628883057] [2024-10-11 19:22:03,849 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:22:03,849 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-11 19:22:03,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:03,851 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:03,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:22:04,836 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:22:04,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:22:04,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 19:22:04,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:04,868 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-11 19:22:04,968 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:22:04,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-11 19:22:04,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:22:05,093 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 24 treesize of output 12 [2024-10-11 19:22:05,950 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:22:05,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-11 19:22:05,980 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 33 treesize of output 15 [2024-10-11 19:22:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-11 19:22:06,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:22:06,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:06,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628883057] [2024-10-11 19:22:06,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628883057] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:22:06,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1320065624] [2024-10-11 19:22:06,290 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:22:06,291 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 19:22:06,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 19:22:06,293 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 19:22:06,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process