./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_BER_nondet_test3-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_BER_nondet_test3-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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:01:47,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:01:47,538 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:01:47,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:01:47,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:01:47,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:01:47,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:01:47,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:01:47,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:01:47,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:01:47,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:01:47,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:01:47,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:01:47,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:01:47,580 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:01:47,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:01:47,582 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:01:47,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:01:47,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:01:47,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:01:47,583 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:01:47,584 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:01:47,584 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:01:47,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:01:47,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:01:47,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:01:47,587 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:01:47,587 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:01:47,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:01:47,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:01:47,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:01:47,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:01:47,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:01:47,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:01:47,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:01:47,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:01:47,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:01:47,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:01:47,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:01:47,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:01:47,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:01:47,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:01:47,592 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-10-11 19:01:47,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:01:47,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:01:47,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:01:47,899 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:01:47,899 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:01:47,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2024-10-11 19:01:49,406 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:01:49,708 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:01:49,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2024-10-11 19:01:49,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c7bd817d8/6b1608e6093345e487e2366de87ad97b/FLAGc42106521 [2024-10-11 19:01:49,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c7bd817d8/6b1608e6093345e487e2366de87ad97b [2024-10-11 19:01:49,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:01:49,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:01:49,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:01:49,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:01:49,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:01:49,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:01:49" (1/1) ... [2024-10-11 19:01:49,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9f9442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:49, skipping insertion in model container [2024-10-11 19:01:49,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:01:49" (1/1) ... [2024-10-11 19:01:50,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:01:50,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:01:50,542 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:01:50,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3cc98241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:50, skipping insertion in model container [2024-10-11 19:01:50,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:01:50,543 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:01:50,545 INFO L158 Benchmark]: Toolchain (without parser) took 569.73ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 85.2MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 19:01:50,546 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 129.4MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:01:50,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.56ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 85.2MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 19:01:50,548 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.12ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 129.4MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.56ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 85.2MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 739]: 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_BER_nondet_test3-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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:01:52,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:01:52,728 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:01:52,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:01:52,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:01:52,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:01:52,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:01:52,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:01:52,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:01:52,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:01:52,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:01:52,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:01:52,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:01:52,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:01:52,778 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:01:52,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:01:52,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:01:52,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:01:52,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:01:52,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:01:52,780 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:01:52,780 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:01:52,781 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:01:52,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:01:52,781 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:01:52,781 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:01:52,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:01:52,782 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:01:52,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:01:52,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:01:52,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:01:52,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:01:52,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:01:52,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:01:52,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:01:52,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:01:52,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:01:52,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:01:52,786 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:01:52,786 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:01:52,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:01:52,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:01:52,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:01:52,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:01:52,788 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:01:52,788 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-10-11 19:01:53,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:01:53,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:01:53,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:01:53,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:01:53,150 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:01:53,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2024-10-11 19:01:54,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:01:55,047 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:01:55,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2024-10-11 19:01:55,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/44478b15a/0ec75cf3648e47919bee3192ce0aad9a/FLAG210ecd094 [2024-10-11 19:01:55,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/44478b15a/0ec75cf3648e47919bee3192ce0aad9a [2024-10-11 19:01:55,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:01:55,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:01:55,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:01:55,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:01:55,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:01:55,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:01:55" (1/1) ... [2024-10-11 19:01:55,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4367c71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:55, skipping insertion in model container [2024-10-11 19:01:55,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:01:55" (1/1) ... [2024-10-11 19:01:55,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:01:55,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:01:55,766 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:01:55,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:01:55,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:01:55,913 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:01:56,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:01:56,054 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:01:56,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:56 WrapperNode [2024-10-11 19:01:56,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:01:56,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:01:56,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:01:56,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:01:56,064 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:01:56" (1/1) ... [2024-10-11 19:01:56,109 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:01:56" (1/1) ... [2024-10-11 19:01:56,190 INFO L138 Inliner]: procedures = 180, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1217 [2024-10-11 19:01:56,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:01:56,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:01:56,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:01:56,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:01:56,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:56" (1/1) ... [2024-10-11 19:01:56,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:56" (1/1) ... [2024-10-11 19:01:56,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:56" (1/1) ... [2024-10-11 19:01:56,339 INFO L175 MemorySlicer]: Split 302 memory accesses to 3 slices as follows [2, 34, 266]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2024-10-11 19:01:56,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:56" (1/1) ... [2024-10-11 19:01:56,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:56" (1/1) ... [2024-10-11 19:01:56,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:56" (1/1) ... [2024-10-11 19:01:56,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:56" (1/1) ... [2024-10-11 19:01:56,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:56" (1/1) ... [2024-10-11 19:01:56,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:56" (1/1) ... [2024-10-11 19:01:56,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:01:56,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:01:56,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:01:56,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:01:56,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:56" (1/1) ... [2024-10-11 19:01:56,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:01:56,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:01:56,481 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:01:56,484 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:01:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:01:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:01:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 19:01:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:01:56,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:01:56,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:01:56,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:01:56,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:01:56,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:01:56,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:01:56,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 19:01:56,534 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:01:56,534 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:01:56,535 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 19:01:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:01:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:01:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:01:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:01:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:01:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:01:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:01:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:01:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:01:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:01:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:01:56,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:01:56,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:01:56,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:01:56,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:01:56,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:01:56,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:01:56,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:01:56,787 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:01:56,794 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:01:56,798 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:01:56,855 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:01:56,886 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:02:01,608 INFO L? ?]: Removed 1301 outVars from TransFormulas that were not future-live. [2024-10-11 19:02:01,608 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:02:01,797 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:02:01,799 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-11 19:02:01,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:02:01 BoogieIcfgContainer [2024-10-11 19:02:01,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:02:01,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:02:01,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:02:01,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:02:01,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:01:55" (1/3) ... [2024-10-11 19:02:01,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268fee43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:02:01, skipping insertion in model container [2024-10-11 19:02:01,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:56" (2/3) ... [2024-10-11 19:02:01,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268fee43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:02:01, skipping insertion in model container [2024-10-11 19:02:01,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:02:01" (3/3) ... [2024-10-11 19:02:01,809 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test3-2.i [2024-10-11 19:02:01,826 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:02:01,826 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 630 error locations. [2024-10-11 19:02:01,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:02:01,912 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;@1378d7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:02:01,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 630 error locations. [2024-10-11 19:02:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 1141 states, 506 states have (on average 2.525691699604743) internal successors, (1278), 1134 states have internal predecessors, (1278), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 19:02:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 19:02:01,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:01,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 19:02:01,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr628ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:01,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1966278, now seen corresponding path program 1 times [2024-10-11 19:02:01,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:01,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229595449] [2024-10-11 19:02:01,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:01,947 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:02:01,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:01,951 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:02:01,953 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:02:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:02,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:02:02,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:02,220 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_56| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-11 19:02:02,221 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:02:02,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:02,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:02,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229595449] [2024-10-11 19:02:02,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229595449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:02,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:02:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363527163] [2024-10-11 19:02:02,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:02,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:02,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:02,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:02,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-11 19:02:02,299 INFO L87 Difference]: Start difference. First operand has 1141 states, 506 states have (on average 2.525691699604743) internal successors, (1278), 1134 states have internal predecessors, (1278), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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:02:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:05,475 INFO L93 Difference]: Finished difference Result 1661 states and 1785 transitions. [2024-10-11 19:02:05,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:02:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-10-11 19:02:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:05,499 INFO L225 Difference]: With dead ends: 1661 [2024-10-11 19:02:05,499 INFO L226 Difference]: Without dead ends: 1659 [2024-10-11 19:02:05,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-11 19:02:05,504 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 564 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1786 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:05,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1414 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1012 Invalid, 0 Unknown, 1786 Unchecked, 3.0s Time] [2024-10-11 19:02:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2024-10-11 19:02:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1130. [2024-10-11 19:02:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 501 states have (on average 2.37125748502994) internal successors, (1188), 1123 states have internal predecessors, (1188), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 19:02:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1198 transitions. [2024-10-11 19:02:05,603 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1198 transitions. Word has length 3 [2024-10-11 19:02:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:05,604 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1198 transitions. [2024-10-11 19:02:05,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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:02:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1198 transitions. [2024-10-11 19:02:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 19:02:05,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:05,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 19:02:05,610 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:02:05,806 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:02:05,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:05,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:05,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1964413, now seen corresponding path program 1 times [2024-10-11 19:02:05,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:05,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451648887] [2024-10-11 19:02:05,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:05,808 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:02:05,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:05,809 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:02:05,811 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:02:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:05,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:02:05,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:05,942 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:02:05,953 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:02:05,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:05,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:05,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451648887] [2024-10-11 19:02:05,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451648887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:05,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:05,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:02:05,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280377834] [2024-10-11 19:02:05,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:05,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:02:05,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:05,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:02:05,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:02:05,956 INFO L87 Difference]: Start difference. First operand 1130 states and 1198 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:02:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:07,854 INFO L93 Difference]: Finished difference Result 1301 states and 1380 transitions. [2024-10-11 19:02:07,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:02:07,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-11 19:02:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:07,860 INFO L225 Difference]: With dead ends: 1301 [2024-10-11 19:02:07,860 INFO L226 Difference]: Without dead ends: 1301 [2024-10-11 19:02:07,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:02:07,862 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 1051 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:07,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 764 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 19:02:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2024-10-11 19:02:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1129. [2024-10-11 19:02:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 510 states have (on average 2.331372549019608) internal successors, (1189), 1121 states have internal predecessors, (1189), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 19:02:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1199 transitions. [2024-10-11 19:02:07,886 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1199 transitions. Word has length 3 [2024-10-11 19:02:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:07,887 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1199 transitions. [2024-10-11 19:02:07,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:02:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1199 transitions. [2024-10-11 19:02:07,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 19:02:07,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:07,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 19:02:07,891 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 (3)] Forceful destruction successful, exit code 0 [2024-10-11 19:02:08,088 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:02:08,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:08,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:08,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1964414, now seen corresponding path program 1 times [2024-10-11 19:02:08,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:08,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285292286] [2024-10-11 19:02:08,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:08,090 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:02:08,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:08,093 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:02:08,094 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:02:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:08,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:02:08,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:08,234 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:02:08,264 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:02:08,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:08,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:08,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285292286] [2024-10-11 19:02:08,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285292286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:08,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:08,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:02:08,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040686062] [2024-10-11 19:02:08,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:08,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:02:08,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:08,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:02:08,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:02:08,267 INFO L87 Difference]: Start difference. First operand 1129 states and 1199 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:02:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:11,018 INFO L93 Difference]: Finished difference Result 1681 states and 1796 transitions. [2024-10-11 19:02:11,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:02:11,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-11 19:02:11,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:11,024 INFO L225 Difference]: With dead ends: 1681 [2024-10-11 19:02:11,024 INFO L226 Difference]: Without dead ends: 1681 [2024-10-11 19:02:11,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:02:11,026 INFO L432 NwaCegarLoop]: 836 mSDtfsCounter, 591 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:11,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1411 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 19:02:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2024-10-11 19:02:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1304. [2024-10-11 19:02:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 685 states have (on average 2.3021897810218976) internal successors, (1577), 1295 states have internal predecessors, (1577), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:02:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1589 transitions. [2024-10-11 19:02:11,055 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1589 transitions. Word has length 3 [2024-10-11 19:02:11,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:11,055 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1589 transitions. [2024-10-11 19:02:11,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:02:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1589 transitions. [2024-10-11 19:02:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:02:11,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:11,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:02:11,060 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 (4)] Forceful destruction successful, exit code 0 [2024-10-11 19:02:11,257 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:02:11,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:11,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:11,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1700804999, now seen corresponding path program 1 times [2024-10-11 19:02:11,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:11,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920367397] [2024-10-11 19:02:11,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:11,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:02:11,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:11,263 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:02:11,264 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:02:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:11,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:02:11,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:11,412 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:02:11,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:02:11,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:02:11,512 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:02:11,532 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:02:11,532 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:02:11,554 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:02:11,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:11,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920367397] [2024-10-11 19:02:11,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920367397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:11,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:11,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:02:11,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715022671] [2024-10-11 19:02:11,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:11,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:11,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:11,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:11,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:02:11,557 INFO L87 Difference]: Start difference. First operand 1304 states and 1589 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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:02:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:14,059 INFO L93 Difference]: Finished difference Result 1470 states and 1765 transitions. [2024-10-11 19:02:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:02:14,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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:02:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:14,065 INFO L225 Difference]: With dead ends: 1470 [2024-10-11 19:02:14,066 INFO L226 Difference]: Without dead ends: 1470 [2024-10-11 19:02:14,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:02:14,067 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1329 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:14,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 395 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 19:02:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2024-10-11 19:02:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1117. [2024-10-11 19:02:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 510 states have (on average 2.303921568627451) internal successors, (1175), 1109 states have internal predecessors, (1175), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 19:02:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1185 transitions. [2024-10-11 19:02:14,089 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1185 transitions. Word has length 7 [2024-10-11 19:02:14,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:14,091 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1185 transitions. [2024-10-11 19:02:14,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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:02:14,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1185 transitions. [2024-10-11 19:02:14,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 19:02:14,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:14,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:02:14,100 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 (5)] Forceful destruction successful, exit code 0 [2024-10-11 19:02:14,294 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:02:14,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:14,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1185347414, now seen corresponding path program 1 times [2024-10-11 19:02:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:14,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52239366] [2024-10-11 19:02:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:14,297 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:02:14,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:14,300 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:02:14,301 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:02:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:14,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:02:14,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:14,454 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:02:14,466 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:02:14,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:14,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:14,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52239366] [2024-10-11 19:02:14,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52239366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:14,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:14,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:02:14,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264855490] [2024-10-11 19:02:14,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:14,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:02:14,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:14,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:02:14,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:02:14,468 INFO L87 Difference]: Start difference. First operand 1117 states and 1185 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:02:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:16,198 INFO L93 Difference]: Finished difference Result 1419 states and 1518 transitions. [2024-10-11 19:02:16,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:02:16,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-11 19:02:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:16,204 INFO L225 Difference]: With dead ends: 1419 [2024-10-11 19:02:16,204 INFO L226 Difference]: Without dead ends: 1419 [2024-10-11 19:02:16,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:02:16,205 INFO L432 NwaCegarLoop]: 957 mSDtfsCounter, 833 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:16,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1253 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:02:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2024-10-11 19:02:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1069. [2024-10-11 19:02:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 510 states have (on average 2.2098039215686276) internal successors, (1127), 1061 states have internal predecessors, (1127), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 19:02:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1137 transitions. [2024-10-11 19:02:16,231 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1137 transitions. Word has length 8 [2024-10-11 19:02:16,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:16,231 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1137 transitions. [2024-10-11 19:02:16,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:02:16,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1137 transitions. [2024-10-11 19:02:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 19:02:16,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:16,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:02:16,239 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:02:16,436 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:02:16,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:16,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:16,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1185347415, now seen corresponding path program 1 times [2024-10-11 19:02:16,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:16,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596792488] [2024-10-11 19:02:16,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:16,438 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:02:16,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:16,441 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:02:16,442 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:02:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:16,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:02:16,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:16,570 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:02:16,589 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:02:16,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:16,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:16,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596792488] [2024-10-11 19:02:16,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596792488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:16,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:16,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:02:16,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426445228] [2024-10-11 19:02:16,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:16,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:02:16,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:16,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:02:16,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:02:16,591 INFO L87 Difference]: Start difference. First operand 1069 states and 1137 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:02:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:18,785 INFO L93 Difference]: Finished difference Result 1493 states and 1595 transitions. [2024-10-11 19:02:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:02:18,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-11 19:02:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:18,792 INFO L225 Difference]: With dead ends: 1493 [2024-10-11 19:02:18,792 INFO L226 Difference]: Without dead ends: 1493 [2024-10-11 19:02:18,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:02:18,793 INFO L432 NwaCegarLoop]: 1118 mSDtfsCounter, 623 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:18,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1554 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 19:02:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2024-10-11 19:02:18,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1086. [2024-10-11 19:02:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 537 states have (on average 2.1992551210428304) internal successors, (1181), 1078 states have internal predecessors, (1181), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 19:02:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1191 transitions. [2024-10-11 19:02:18,814 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1191 transitions. Word has length 8 [2024-10-11 19:02:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:18,814 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1191 transitions. [2024-10-11 19:02:18,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:02:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1191 transitions. [2024-10-11 19:02:18,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 19:02:18,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:18,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:02:18,819 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:02:19,015 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:02:19,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:19,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:19,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1747244489, now seen corresponding path program 1 times [2024-10-11 19:02:19,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:19,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455740622] [2024-10-11 19:02:19,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:19,017 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:02:19,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:19,018 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:02:19,019 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:02:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:19,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:02:19,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:19,221 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:02:19,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:19,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:19,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455740622] [2024-10-11 19:02:19,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455740622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:19,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:19,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:02:19,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780482232] [2024-10-11 19:02:19,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:19,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:19,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:19,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:19,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:02:19,223 INFO L87 Difference]: Start difference. First operand 1086 states and 1191 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:02:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:20,645 INFO L93 Difference]: Finished difference Result 1624 states and 1814 transitions. [2024-10-11 19:02:20,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:02:20,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-10-11 19:02:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:20,651 INFO L225 Difference]: With dead ends: 1624 [2024-10-11 19:02:20,651 INFO L226 Difference]: Without dead ends: 1624 [2024-10-11 19:02:20,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:02:20,652 INFO L432 NwaCegarLoop]: 1097 mSDtfsCounter, 572 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 2984 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:20,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 2984 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 19:02:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2024-10-11 19:02:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1292. [2024-10-11 19:02:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 742 states have (on average 2.1576819407008085) internal successors, (1601), 1283 states have internal predecessors, (1601), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:02:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1613 transitions. [2024-10-11 19:02:20,679 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1613 transitions. Word has length 11 [2024-10-11 19:02:20,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:20,680 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1613 transitions. [2024-10-11 19:02:20,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:02:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1613 transitions. [2024-10-11 19:02:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 19:02:20,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:20,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:02:20,687 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 (8)] Forceful destruction successful, exit code 0 [2024-10-11 19:02:20,881 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:02:20,881 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:20,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash -361479344, now seen corresponding path program 1 times [2024-10-11 19:02:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732789447] [2024-10-11 19:02:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:20,882 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:02:20,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:20,884 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:02:20,885 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:02:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:21,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:02:21,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:21,019 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:02:21,020 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:21,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:21,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732789447] [2024-10-11 19:02:21,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732789447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:21,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:21,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:02:21,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849804323] [2024-10-11 19:02:21,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:21,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:02:21,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:21,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:02:21,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:02:21,021 INFO L87 Difference]: Start difference. First operand 1292 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) 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:02:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:21,575 INFO L93 Difference]: Finished difference Result 1238 states and 1533 transitions. [2024-10-11 19:02:21,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:02:21,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) 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:02:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:21,579 INFO L225 Difference]: With dead ends: 1238 [2024-10-11 19:02:21,579 INFO L226 Difference]: Without dead ends: 1238 [2024-10-11 19:02:21,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:02:21,580 INFO L432 NwaCegarLoop]: 951 mSDtfsCounter, 61 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:21,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1860 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:02:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2024-10-11 19:02:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1238. [2024-10-11 19:02:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 712 states have (on average 2.1362359550561796) internal successors, (1521), 1229 states have internal predecessors, (1521), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:02:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1533 transitions. [2024-10-11 19:02:21,602 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1533 transitions. Word has length 13 [2024-10-11 19:02:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:21,602 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1533 transitions. [2024-10-11 19:02:21,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) 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:02:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1533 transitions. [2024-10-11 19:02:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 19:02:21,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:21,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:02:21,609 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:02:21,805 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:02:21,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:21,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:21,806 INFO L85 PathProgramCache]: Analyzing trace with hash 510726826, now seen corresponding path program 1 times [2024-10-11 19:02:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:21,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117984426] [2024-10-11 19:02:21,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:21,806 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:02:21,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:21,807 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:02:21,808 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:02:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:21,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:02:21,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:21,959 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:02:21,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:21,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117984426] [2024-10-11 19:02:21,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117984426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:21,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:21,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:02:21,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437309532] [2024-10-11 19:02:21,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:21,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:21,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:21,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:21,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:02:21,961 INFO L87 Difference]: Start difference. First operand 1238 states and 1533 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:02:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:22,780 INFO L93 Difference]: Finished difference Result 1222 states and 1489 transitions. [2024-10-11 19:02:22,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:02:22,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:02:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:22,784 INFO L225 Difference]: With dead ends: 1222 [2024-10-11 19:02:22,784 INFO L226 Difference]: Without dead ends: 1222 [2024-10-11 19:02:22,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:02:22,785 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 45 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:22,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2742 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:02:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2024-10-11 19:02:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1222. [2024-10-11 19:02:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 710 states have (on average 2.080281690140845) internal successors, (1477), 1213 states have internal predecessors, (1477), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:02:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1489 transitions. [2024-10-11 19:02:22,803 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1489 transitions. Word has length 15 [2024-10-11 19:02:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:22,803 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1489 transitions. [2024-10-11 19:02:22,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:02:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1489 transitions. [2024-10-11 19:02:22,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 19:02:22,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:22,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:02:22,809 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:02:23,005 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:02:23,005 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:23,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1828420211, now seen corresponding path program 1 times [2024-10-11 19:02:23,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:23,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378724456] [2024-10-11 19:02:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:23,006 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:02:23,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:23,009 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:02:23,010 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:02:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:23,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:02:23,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:23,181 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:02:23,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:23,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:23,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378724456] [2024-10-11 19:02:23,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378724456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:23,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:23,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:02:23,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765767834] [2024-10-11 19:02:23,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:23,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:02:23,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:23,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:02:23,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:02:23,182 INFO L87 Difference]: Start difference. First operand 1222 states and 1489 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:02:23,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:23,699 INFO L93 Difference]: Finished difference Result 1168 states and 1409 transitions. [2024-10-11 19:02:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:02:23,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-10-11 19:02:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:23,703 INFO L225 Difference]: With dead ends: 1168 [2024-10-11 19:02:23,703 INFO L226 Difference]: Without dead ends: 1168 [2024-10-11 19:02:23,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:02:23,704 INFO L432 NwaCegarLoop]: 893 mSDtfsCounter, 61 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:23,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1744 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:02:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-10-11 19:02:23,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1168. [2024-10-11 19:02:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 680 states have (on average 2.054411764705882) internal successors, (1397), 1159 states have internal predecessors, (1397), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:02:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1409 transitions. [2024-10-11 19:02:23,741 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1409 transitions. Word has length 16 [2024-10-11 19:02:23,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:23,742 INFO L471 AbstractCegarLoop]: Abstraction has 1168 states and 1409 transitions. [2024-10-11 19:02:23,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:02:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1409 transitions. [2024-10-11 19:02:23,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 19:02:23,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:23,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:02:23,749 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:02:23,943 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:02:23,943 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr628ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:23,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:23,944 INFO L85 PathProgramCache]: Analyzing trace with hash 740610282, now seen corresponding path program 1 times [2024-10-11 19:02:23,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:23,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926330775] [2024-10-11 19:02:23,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:23,944 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:02:23,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:23,946 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:02:23,946 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:02:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:24,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:02:24,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:24,257 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_57| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-11 19:02:24,258 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:02:24,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:24,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:24,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926330775] [2024-10-11 19:02:24,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926330775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:24,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:24,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:02:24,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524998343] [2024-10-11 19:02:24,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:24,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:24,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:24,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:24,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-11 19:02:24,260 INFO L87 Difference]: Start difference. First operand 1168 states and 1409 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:02:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:25,666 INFO L93 Difference]: Finished difference Result 1438 states and 1754 transitions. [2024-10-11 19:02:25,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:02:25,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-10-11 19:02:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:25,669 INFO L225 Difference]: With dead ends: 1438 [2024-10-11 19:02:25,670 INFO L226 Difference]: Without dead ends: 1430 [2024-10-11 19:02:25,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-11 19:02:25,670 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 226 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1252 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:25,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1328 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 698 Invalid, 0 Unknown, 1252 Unchecked, 1.4s Time] [2024-10-11 19:02:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-10-11 19:02:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1221. [2024-10-11 19:02:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 732 states have (on average 1.9972677595628416) internal successors, (1462), 1211 states have internal predecessors, (1462), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 19:02:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1476 transitions. [2024-10-11 19:02:25,687 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1476 transitions. Word has length 16 [2024-10-11 19:02:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:25,688 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1476 transitions. [2024-10-11 19:02:25,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:02:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1476 transitions. [2024-10-11 19:02:25,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 19:02:25,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:25,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:02:25,694 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:02:25,892 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:02:25,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:25,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash -470201593, now seen corresponding path program 1 times [2024-10-11 19:02:25,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:25,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904086767] [2024-10-11 19:02:25,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:25,894 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:02:25,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:25,895 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:02:25,896 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:02:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:26,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:02:26,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:26,102 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:02:26,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:26,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:26,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904086767] [2024-10-11 19:02:26,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904086767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:26,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:26,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:02:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803560491] [2024-10-11 19:02:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:26,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:26,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:26,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:26,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:02:26,105 INFO L87 Difference]: Start difference. First operand 1221 states and 1476 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:02:26,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:26,769 INFO L93 Difference]: Finished difference Result 1205 states and 1432 transitions. [2024-10-11 19:02:26,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:02:26,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-10-11 19:02:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:26,773 INFO L225 Difference]: With dead ends: 1205 [2024-10-11 19:02:26,773 INFO L226 Difference]: Without dead ends: 1205 [2024-10-11 19:02:26,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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:02:26,774 INFO L432 NwaCegarLoop]: 862 mSDtfsCounter, 45 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:26,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2568 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:02:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2024-10-11 19:02:26,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1205. [2024-10-11 19:02:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 730 states have (on average 1.9424657534246574) internal successors, (1418), 1195 states have internal predecessors, (1418), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 19:02:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1432 transitions. [2024-10-11 19:02:26,795 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1432 transitions. Word has length 18 [2024-10-11 19:02:26,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:26,798 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1432 transitions. [2024-10-11 19:02:26,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:02:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1432 transitions. [2024-10-11 19:02:26,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 19:02:26,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:26,799 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] [2024-10-11 19:02:26,805 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:02:27,000 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:02:27,001 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:27,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash 113548312, now seen corresponding path program 1 times [2024-10-11 19:02:27,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:27,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645611685] [2024-10-11 19:02:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:27,002 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:02:27,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:27,005 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:02:27,006 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:02:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:27,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:02:27,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:27,147 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:02:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:02:27,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:27,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:27,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645611685] [2024-10-11 19:02:27,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645611685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:27,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:27,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:02:27,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293733883] [2024-10-11 19:02:27,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:27,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:27,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:27,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:27,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:02:27,216 INFO L87 Difference]: Start difference. First operand 1205 states and 1432 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:02:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:28,710 INFO L93 Difference]: Finished difference Result 1385 states and 1613 transitions. [2024-10-11 19:02:28,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:02:28,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-10-11 19:02:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:28,714 INFO L225 Difference]: With dead ends: 1385 [2024-10-11 19:02:28,714 INFO L226 Difference]: Without dead ends: 1385 [2024-10-11 19:02:28,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:02:28,715 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 874 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:28,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1144 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:02:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-10-11 19:02:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1201. [2024-10-11 19:02:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 730 states have (on average 1.926027397260274) internal successors, (1406), 1191 states have internal predecessors, (1406), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 19:02:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1420 transitions. [2024-10-11 19:02:28,731 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1420 transitions. Word has length 29 [2024-10-11 19:02:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:28,732 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1420 transitions. [2024-10-11 19:02:28,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:02:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1420 transitions. [2024-10-11 19:02:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 19:02:28,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:28,733 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] [2024-10-11 19:02:28,738 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:02:28,933 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:02:28,934 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:28,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash 113548313, now seen corresponding path program 1 times [2024-10-11 19:02:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:28,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011646962] [2024-10-11 19:02:28,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:28,935 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:02:28,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:28,938 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:02:28,939 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:02:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:29,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:02:29,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:29,087 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:02:29,233 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:02:29,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:29,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:29,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011646962] [2024-10-11 19:02:29,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011646962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:29,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:29,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:02:29,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049122338] [2024-10-11 19:02:29,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:29,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:29,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:29,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:29,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:02:29,235 INFO L87 Difference]: Start difference. First operand 1201 states and 1420 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:02:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:31,770 INFO L93 Difference]: Finished difference Result 1819 states and 2173 transitions. [2024-10-11 19:02:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:02:31,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-10-11 19:02:31,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:31,775 INFO L225 Difference]: With dead ends: 1819 [2024-10-11 19:02:31,776 INFO L226 Difference]: Without dead ends: 1819 [2024-10-11 19:02:31,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:02:31,776 INFO L432 NwaCegarLoop]: 679 mSDtfsCounter, 526 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:31,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1604 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 19:02:31,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2024-10-11 19:02:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1471. [2024-10-11 19:02:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 998 states have (on average 1.934869739478958) internal successors, (1931), 1459 states have internal predecessors, (1931), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:02:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1949 transitions. [2024-10-11 19:02:31,799 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1949 transitions. Word has length 29 [2024-10-11 19:02:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:31,799 INFO L471 AbstractCegarLoop]: Abstraction has 1471 states and 1949 transitions. [2024-10-11 19:02:31,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:02:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1949 transitions. [2024-10-11 19:02:31,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 19:02:31,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:31,800 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] [2024-10-11 19:02:31,805 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 (15)] Ended with exit code 0 [2024-10-11 19:02:32,001 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:02:32,001 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:32,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1199026005, now seen corresponding path program 1 times [2024-10-11 19:02:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:32,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321341811] [2024-10-11 19:02:32,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:32,002 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:02:32,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:32,003 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:02:32,004 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:02:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:32,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:02:32,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:32,194 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:02:32,266 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:02:32,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:32,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:32,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321341811] [2024-10-11 19:02:32,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321341811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:32,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:32,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:02:32,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767058692] [2024-10-11 19:02:32,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:32,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:32,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:32,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:32,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:02:32,268 INFO L87 Difference]: Start difference. First operand 1471 states and 1949 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:02:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:34,032 INFO L93 Difference]: Finished difference Result 1877 states and 2479 transitions. [2024-10-11 19:02:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:02:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-10-11 19:02:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:34,038 INFO L225 Difference]: With dead ends: 1877 [2024-10-11 19:02:34,038 INFO L226 Difference]: Without dead ends: 1877 [2024-10-11 19:02:34,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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:02:34,039 INFO L432 NwaCegarLoop]: 827 mSDtfsCounter, 703 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:34,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1670 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:02:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2024-10-11 19:02:34,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1467. [2024-10-11 19:02:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 998 states have (on average 1.9268537074148298) internal successors, (1923), 1455 states have internal predecessors, (1923), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:02:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1941 transitions. [2024-10-11 19:02:34,074 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1941 transitions. Word has length 32 [2024-10-11 19:02:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:34,074 INFO L471 AbstractCegarLoop]: Abstraction has 1467 states and 1941 transitions. [2024-10-11 19:02:34,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:02:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1941 transitions. [2024-10-11 19:02:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 19:02:34,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:34,075 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] [2024-10-11 19:02:34,082 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 (16)] Forceful destruction successful, exit code 0 [2024-10-11 19:02:34,276 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:02:34,276 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:34,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:34,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1199026006, now seen corresponding path program 1 times [2024-10-11 19:02:34,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:34,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141041367] [2024-10-11 19:02:34,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:34,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:02:34,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:34,280 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:02:34,281 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:02:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:34,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:02:34,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:34,443 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:02:34,564 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:02:34,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:34,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:34,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141041367] [2024-10-11 19:02:34,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141041367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:34,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:34,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:02:34,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112786674] [2024-10-11 19:02:34,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:34,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:34,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:34,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:34,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:02:34,565 INFO L87 Difference]: Start difference. First operand 1467 states and 1941 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:02:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:36,958 INFO L93 Difference]: Finished difference Result 1934 states and 2500 transitions. [2024-10-11 19:02:36,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:02:36,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-10-11 19:02:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:36,965 INFO L225 Difference]: With dead ends: 1934 [2024-10-11 19:02:36,965 INFO L226 Difference]: Without dead ends: 1934 [2024-10-11 19:02:36,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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:02:36,966 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 489 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:36,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 2099 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 19:02:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2024-10-11 19:02:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1463. [2024-10-11 19:02:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 998 states have (on average 1.9188376753507015) internal successors, (1915), 1451 states have internal predecessors, (1915), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:02:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 1933 transitions. [2024-10-11 19:02:36,988 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 1933 transitions. Word has length 32 [2024-10-11 19:02:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:36,988 INFO L471 AbstractCegarLoop]: Abstraction has 1463 states and 1933 transitions. [2024-10-11 19:02:36,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:02:36,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1933 transitions. [2024-10-11 19:02:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 19:02:36,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:36,990 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] [2024-10-11 19:02:36,997 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:02:37,190 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:02:37,190 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:37,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:37,191 INFO L85 PathProgramCache]: Analyzing trace with hash -835146401, now seen corresponding path program 1 times [2024-10-11 19:02:37,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:37,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904635429] [2024-10-11 19:02:37,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:37,191 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:02:37,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:37,192 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:02:37,193 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:02:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:37,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:02:37,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:37,384 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:02:37,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:37,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:37,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904635429] [2024-10-11 19:02:37,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904635429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:37,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:37,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:02:37,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523562303] [2024-10-11 19:02:37,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:37,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:37,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:37,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:37,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:02:37,386 INFO L87 Difference]: Start difference. First operand 1463 states and 1933 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:02:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:38,032 INFO L93 Difference]: Finished difference Result 1433 states and 1883 transitions. [2024-10-11 19:02:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:02:38,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2024-10-11 19:02:38,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:38,036 INFO L225 Difference]: With dead ends: 1433 [2024-10-11 19:02:38,036 INFO L226 Difference]: Without dead ends: 1433 [2024-10-11 19:02:38,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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:02:38,036 INFO L432 NwaCegarLoop]: 852 mSDtfsCounter, 21 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:38,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2533 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:02:38,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2024-10-11 19:02:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2024-10-11 19:02:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 968 states have (on average 1.9266528925619835) internal successors, (1865), 1421 states have internal predecessors, (1865), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:02:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1883 transitions. [2024-10-11 19:02:38,050 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1883 transitions. Word has length 48 [2024-10-11 19:02:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:38,050 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 1883 transitions. [2024-10-11 19:02:38,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:02:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1883 transitions. [2024-10-11 19:02:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 19:02:38,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:38,051 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] [2024-10-11 19:02:38,057 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:02:38,256 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:02:38,256 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:38,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:38,263 INFO L85 PathProgramCache]: Analyzing trace with hash -612521905, now seen corresponding path program 1 times [2024-10-11 19:02:38,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:38,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64655610] [2024-10-11 19:02:38,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:38,264 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:02:38,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:38,267 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:02:38,269 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:02:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:38,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:02:38,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:38,546 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:02:38,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:38,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64655610] [2024-10-11 19:02:38,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64655610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:38,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:38,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:02:38,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458768856] [2024-10-11 19:02:38,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:38,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:38,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:38,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:38,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:02:38,549 INFO L87 Difference]: Start difference. First operand 1433 states and 1883 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:02:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:39,403 INFO L93 Difference]: Finished difference Result 1421 states and 1863 transitions. [2024-10-11 19:02:39,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:02:39,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2024-10-11 19:02:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:39,408 INFO L225 Difference]: With dead ends: 1421 [2024-10-11 19:02:39,408 INFO L226 Difference]: Without dead ends: 1421 [2024-10-11 19:02:39,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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:02:39,409 INFO L432 NwaCegarLoop]: 848 mSDtfsCounter, 15 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2527 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:39,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2527 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:02:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2024-10-11 19:02:39,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1421. [2024-10-11 19:02:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 956 states have (on average 1.9299163179916319) internal successors, (1845), 1409 states have internal predecessors, (1845), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:02:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1863 transitions. [2024-10-11 19:02:39,426 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1863 transitions. Word has length 51 [2024-10-11 19:02:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:39,426 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 1863 transitions. [2024-10-11 19:02:39,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:02:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1863 transitions. [2024-10-11 19:02:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 19:02:39,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:39,427 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] [2024-10-11 19:02:39,432 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:02:39,627 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:02:39,627 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:39,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:39,628 INFO L85 PathProgramCache]: Analyzing trace with hash -643187872, now seen corresponding path program 1 times [2024-10-11 19:02:39,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:39,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984609410] [2024-10-11 19:02:39,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:39,628 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:02:39,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:39,630 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:02:39,631 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:02:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:39,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:02:39,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:39,828 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:02:39,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:39,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984609410] [2024-10-11 19:02:39,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984609410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:39,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:39,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:02:39,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857448971] [2024-10-11 19:02:39,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:39,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:02:39,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:39,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:02:39,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:02:39,830 INFO L87 Difference]: Start difference. First operand 1421 states and 1863 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:02:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:40,438 INFO L93 Difference]: Finished difference Result 1440 states and 1551 transitions. [2024-10-11 19:02:40,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:02:40,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2024-10-11 19:02:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:40,443 INFO L225 Difference]: With dead ends: 1440 [2024-10-11 19:02:40,443 INFO L226 Difference]: Without dead ends: 1440 [2024-10-11 19:02:40,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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:02:40,443 INFO L432 NwaCegarLoop]: 1090 mSDtfsCounter, 287 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:40,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1894 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:02:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2024-10-11 19:02:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1116. [2024-10-11 19:02:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 653 states have (on average 1.8300153139356814) internal successors, (1195), 1106 states have internal predecessors, (1195), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 19:02:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1209 transitions. [2024-10-11 19:02:40,456 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1209 transitions. Word has length 52 [2024-10-11 19:02:40,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:40,456 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1209 transitions. [2024-10-11 19:02:40,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:02:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1209 transitions. [2024-10-11 19:02:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 19:02:40,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:40,457 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] [2024-10-11 19:02:40,461 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:02:40,657 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:02:40,657 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:40,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1768872894, now seen corresponding path program 1 times [2024-10-11 19:02:40,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:40,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134017325] [2024-10-11 19:02:40,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:40,658 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:02:40,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:40,659 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:02:40,660 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:02:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:40,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:02:40,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:40,884 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:02:40,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:02:40,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:02:40,888 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:02:40,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:02:40,946 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:02:41,001 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:02:41,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:41,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:41,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134017325] [2024-10-11 19:02:41,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134017325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:41,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:41,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:02:41,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632973375] [2024-10-11 19:02:41,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:41,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:02:41,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:41,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:02:41,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:02:41,004 INFO L87 Difference]: Start difference. First operand 1116 states and 1209 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:02:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:42,537 INFO L93 Difference]: Finished difference Result 1725 states and 1854 transitions. [2024-10-11 19:02:42,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:02:42,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 19:02:42,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:42,541 INFO L225 Difference]: With dead ends: 1725 [2024-10-11 19:02:42,541 INFO L226 Difference]: Without dead ends: 1722 [2024-10-11 19:02:42,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:02:42,542 INFO L432 NwaCegarLoop]: 1024 mSDtfsCounter, 1930 mSDsluCounter, 2879 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 3903 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:42,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 3903 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 19:02:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2024-10-11 19:02:42,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1068. [2024-10-11 19:02:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 606 states have (on average 1.8927392739273927) internal successors, (1147), 1059 states have internal predecessors, (1147), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:02:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1159 transitions. [2024-10-11 19:02:42,556 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1159 transitions. Word has length 55 [2024-10-11 19:02:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:42,557 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1159 transitions. [2024-10-11 19:02:42,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:02:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1159 transitions. [2024-10-11 19:02:42,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 19:02:42,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:42,558 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] [2024-10-11 19:02:42,566 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:02:42,758 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:02:42,759 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:42,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:42,759 INFO L85 PathProgramCache]: Analyzing trace with hash -185631666, now seen corresponding path program 1 times [2024-10-11 19:02:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:42,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618538680] [2024-10-11 19:02:42,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:42,760 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:02:42,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:42,761 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:02:42,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 (22)] Waiting until timeout for monitored process [2024-10-11 19:02:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:43,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:02:43,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:43,058 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:02:43,062 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:02:43,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:02:43,416 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:02:43,425 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:02:43,425 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:02:43,432 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:02:43,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:43,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:43,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618538680] [2024-10-11 19:02:43,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618538680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:43,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:43,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:02:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981740801] [2024-10-11 19:02:43,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:43,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:43,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:43,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:02:43,433 INFO L87 Difference]: Start difference. First operand 1068 states and 1159 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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:02:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:45,307 INFO L93 Difference]: Finished difference Result 1368 states and 1483 transitions. [2024-10-11 19:02:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:02:45,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-10-11 19:02:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:45,311 INFO L225 Difference]: With dead ends: 1368 [2024-10-11 19:02:45,311 INFO L226 Difference]: Without dead ends: 1368 [2024-10-11 19:02:45,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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:02:45,311 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 940 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:45,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 639 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 19:02:45,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-10-11 19:02:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1003. [2024-10-11 19:02:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 579 states have (on average 1.8048359240069085) internal successors, (1045), 994 states have internal predecessors, (1045), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:02:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1057 transitions. [2024-10-11 19:02:45,322 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1057 transitions. Word has length 55 [2024-10-11 19:02:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:45,323 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1057 transitions. [2024-10-11 19:02:45,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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:02:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1057 transitions. [2024-10-11 19:02:45,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 19:02:45,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:45,323 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] [2024-10-11 19:02:45,332 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 (22)] Forceful destruction successful, exit code 0 [2024-10-11 19:02:45,523 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:02:45,524 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:45,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:45,524 INFO L85 PathProgramCache]: Analyzing trace with hash 467036551, now seen corresponding path program 1 times [2024-10-11 19:02:45,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:45,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669734655] [2024-10-11 19:02:45,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:45,525 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:02:45,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:45,526 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:02:45,527 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:02:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:45,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:02:45,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:45,790 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:02:45,802 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:02:45,823 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:02:45,831 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:02:45,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:45,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:45,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669734655] [2024-10-11 19:02:45,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669734655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:45,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:45,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:02:45,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937626245] [2024-10-11 19:02:45,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:45,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:02:45,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:45,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:02:45,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:02:45,833 INFO L87 Difference]: Start difference. First operand 1003 states and 1057 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:02:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:47,688 INFO L93 Difference]: Finished difference Result 1002 states and 1056 transitions. [2024-10-11 19:02:47,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:02:47,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-10-11 19:02:47,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:47,690 INFO L225 Difference]: With dead ends: 1002 [2024-10-11 19:02:47,690 INFO L226 Difference]: Without dead ends: 1002 [2024-10-11 19:02:47,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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:02:47,691 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 2 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2132 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:47,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2132 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 19:02:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2024-10-11 19:02:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2024-10-11 19:02:47,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 579 states have (on average 1.8031088082901554) internal successors, (1044), 993 states have internal predecessors, (1044), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:02:47,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1056 transitions. [2024-10-11 19:02:47,714 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1056 transitions. Word has length 59 [2024-10-11 19:02:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:47,715 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1056 transitions. [2024-10-11 19:02:47,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:02:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1056 transitions. [2024-10-11 19:02:47,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 19:02:47,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:47,715 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] [2024-10-11 19:02:47,725 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:02:47,916 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:02:47,916 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:47,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash 467036552, now seen corresponding path program 1 times [2024-10-11 19:02:47,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:47,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352506037] [2024-10-11 19:02:47,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:47,917 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:02:47,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:47,920 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:02:47,921 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:02:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:48,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:02:48,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:48,203 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:02:48,216 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:02:48,220 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:02:48,252 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:02:48,264 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:02:48,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:48,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:48,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352506037] [2024-10-11 19:02:48,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352506037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:48,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:48,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:02:48,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202570108] [2024-10-11 19:02:48,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:48,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:02:48,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:48,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:02:48,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:02:48,266 INFO L87 Difference]: Start difference. First operand 1002 states and 1056 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:02:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:50,475 INFO L93 Difference]: Finished difference Result 1001 states and 1055 transitions. [2024-10-11 19:02:50,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:02:50,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-10-11 19:02:50,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:50,479 INFO L225 Difference]: With dead ends: 1001 [2024-10-11 19:02:50,479 INFO L226 Difference]: Without dead ends: 1001 [2024-10-11 19:02:50,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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:02:50,480 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 1 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:50,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2170 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 19:02:50,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-10-11 19:02:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2024-10-11 19:02:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 578 states have (on average 1.8044982698961938) internal successors, (1043), 992 states have internal predecessors, (1043), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:02:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1055 transitions. [2024-10-11 19:02:50,490 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1055 transitions. Word has length 59 [2024-10-11 19:02:50,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:50,490 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1055 transitions. [2024-10-11 19:02:50,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:02:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1055 transitions. [2024-10-11 19:02:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 19:02:50,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:50,491 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:02:50,499 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 (24)] Forceful destruction successful, exit code 0 [2024-10-11 19:02:50,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:02:50,691 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:50,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1706497589, now seen corresponding path program 1 times [2024-10-11 19:02:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:50,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854037053] [2024-10-11 19:02:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:50,692 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:02:50,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:50,693 INFO L229 MonitoredProcess]: Starting monitored process 25 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:02:50,694 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 (25)] Waiting until timeout for monitored process [2024-10-11 19:02:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:50,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:02:50,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:50,982 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:02:50,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:02:50,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:50,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854037053] [2024-10-11 19:02:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854037053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:02:50,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:02:50,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:02:50,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26635629] [2024-10-11 19:02:50,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:02:50,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:02:50,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:50,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:02:50,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:02:50,986 INFO L87 Difference]: Start difference. First operand 1001 states and 1055 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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:02:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:51,688 INFO L93 Difference]: Finished difference Result 1003 states and 1058 transitions. [2024-10-11 19:02:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:02:51,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2024-10-11 19:02:51,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:51,692 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 19:02:51,692 INFO L226 Difference]: Without dead ends: 1003 [2024-10-11 19:02:51,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 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:02:51,693 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 0 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:51,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2463 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:02:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-10-11 19:02:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2024-10-11 19:02:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 579 states have (on average 1.8048359240069085) internal successors, (1045), 994 states have internal predecessors, (1045), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 19:02:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1058 transitions. [2024-10-11 19:02:51,709 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1058 transitions. Word has length 65 [2024-10-11 19:02:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:51,710 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1058 transitions. [2024-10-11 19:02:51,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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:02:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1058 transitions. [2024-10-11 19:02:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 19:02:51,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:51,711 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, 1] [2024-10-11 19:02:51,720 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 (25)] Forceful destruction successful, exit code 0 [2024-10-11 19:02:51,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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:02:51,912 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:51,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:51,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1980175706, now seen corresponding path program 1 times [2024-10-11 19:02:51,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:51,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195024778] [2024-10-11 19:02:51,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:02:51,913 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:02:51,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:51,914 INFO L229 MonitoredProcess]: Starting monitored process 26 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:02:51,915 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 (26)] Waiting until timeout for monitored process [2024-10-11 19:02:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:02:52,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:02:52,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:52,196 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:02:52,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:02:52,245 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:02:52,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:52,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195024778] [2024-10-11 19:02:52,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195024778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:02:52,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:02:52,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:02:52,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437797063] [2024-10-11 19:02:52,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:02:52,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:02:52,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:52,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:02:52,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:02:52,249 INFO L87 Difference]: Start difference. First operand 1003 states and 1058 transitions. Second operand has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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:02:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:53,534 INFO L93 Difference]: Finished difference Result 1012 states and 1072 transitions. [2024-10-11 19:02:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:02:53,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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 66 [2024-10-11 19:02:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:53,538 INFO L225 Difference]: With dead ends: 1012 [2024-10-11 19:02:53,538 INFO L226 Difference]: Without dead ends: 1012 [2024-10-11 19:02:53,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 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:02:53,538 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 4 mSDsluCounter, 4914 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5735 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:53,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5735 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:02:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-10-11 19:02:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1011. [2024-10-11 19:02:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 586 states have (on average 1.8054607508532423) internal successors, (1058), 1001 states have internal predecessors, (1058), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 19:02:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1071 transitions. [2024-10-11 19:02:53,553 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1071 transitions. Word has length 66 [2024-10-11 19:02:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:53,553 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1071 transitions. [2024-10-11 19:02:53,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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:02:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1071 transitions. [2024-10-11 19:02:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 19:02:53,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:53,554 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, 1] [2024-10-11 19:02:53,564 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 (26)] Forceful destruction successful, exit code 0 [2024-10-11 19:02:53,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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:02:53,759 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:53,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:53,759 INFO L85 PathProgramCache]: Analyzing trace with hash 112183435, now seen corresponding path program 2 times [2024-10-11 19:02:53,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:53,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597657765] [2024-10-11 19:02:53,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:02:53,760 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:02:53,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:53,761 INFO L229 MonitoredProcess]: Starting monitored process 27 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:02:53,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 (27)] Waiting until timeout for monitored process [2024-10-11 19:02:54,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:02:54,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:02:54,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:02:54,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:54,249 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:02:54,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:02:54,355 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:02:54,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:54,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597657765] [2024-10-11 19:02:54,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597657765] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:02:54,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:02:54,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:02:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307428658] [2024-10-11 19:02:54,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:02:54,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:02:54,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:02:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:02:54,359 INFO L87 Difference]: Start difference. First operand 1011 states and 1071 transitions. Second operand has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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:02:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:02:56,142 INFO L93 Difference]: Finished difference Result 1023 states and 1090 transitions. [2024-10-11 19:02:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:02:56,144 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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 69 [2024-10-11 19:02:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:02:56,146 INFO L225 Difference]: With dead ends: 1023 [2024-10-11 19:02:56,146 INFO L226 Difference]: Without dead ends: 1021 [2024-10-11 19:02:56,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 19:02:56,147 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 8 mSDsluCounter, 4100 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4921 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:02:56,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4921 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 19:02:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-10-11 19:02:56,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1020. [2024-10-11 19:02:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 595 states have (on average 1.7983193277310925) internal successors, (1070), 1010 states have internal predecessors, (1070), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 19:02:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1083 transitions. [2024-10-11 19:02:56,162 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1083 transitions. Word has length 69 [2024-10-11 19:02:56,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:02:56,162 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1083 transitions. [2024-10-11 19:02:56,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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:02:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1083 transitions. [2024-10-11 19:02:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 19:02:56,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:02:56,163 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, 1] [2024-10-11 19:02:56,174 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 (27)] Ended with exit code 0 [2024-10-11 19:02:56,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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:02:56,368 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:02:56,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:02:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash -630717781, now seen corresponding path program 3 times [2024-10-11 19:02:56,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:02:56,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951823883] [2024-10-11 19:02:56,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:02:56,369 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:02:56,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:02:56,370 INFO L229 MonitoredProcess]: Starting monitored process 28 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:02:56,371 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 (28)] Waiting until timeout for monitored process [2024-10-11 19:02:57,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:02:57,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:02:57,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:02:57,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:02:57,188 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:02:57,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:02:57,661 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:02:57,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:02:57,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951823883] [2024-10-11 19:02:57,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951823883] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:02:57,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:02:57,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:02:57,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623947718] [2024-10-11 19:02:57,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:02:57,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:02:57,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:02:57,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:02:57,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:02:57,663 INFO L87 Difference]: Start difference. First operand 1020 states and 1083 transitions. Second operand has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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:03:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:01,835 INFO L93 Difference]: Finished difference Result 1041 states and 1119 transitions. [2024-10-11 19:03:01,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:03:01,836 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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 75 [2024-10-11 19:03:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:01,837 INFO L225 Difference]: With dead ends: 1041 [2024-10-11 19:03:01,838 INFO L226 Difference]: Without dead ends: 1038 [2024-10-11 19:03:01,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 19:03:01,839 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 13 mSDsluCounter, 10655 mSDsCounter, 0 mSdLazyCounter, 1907 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11476 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:01,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11476 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1907 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 19:03:01,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-10-11 19:03:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1038. [2024-10-11 19:03:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 613 states have (on average 1.7830342577487766) internal successors, (1093), 1028 states have internal predecessors, (1093), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 19:03:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1106 transitions. [2024-10-11 19:03:01,854 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1106 transitions. Word has length 75 [2024-10-11 19:03:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:01,855 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1106 transitions. [2024-10-11 19:03:01,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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:03:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1106 transitions. [2024-10-11 19:03:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 19:03:01,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:01,856 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, 1] [2024-10-11 19:03:01,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 (28)] Forceful destruction successful, exit code 0 [2024-10-11 19:03:02,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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:03:02,057 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:03:02,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:02,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1239822059, now seen corresponding path program 4 times [2024-10-11 19:03:02,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:02,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312248730] [2024-10-11 19:03:02,058 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:03:02,058 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:03:02,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:02,059 INFO L229 MonitoredProcess]: Starting monitored process 29 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:03:02,060 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 (29)] Waiting until timeout for monitored process [2024-10-11 19:03:02,579 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:03:02,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:03:02,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 19:03:02,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:03,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:03:03,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:03:04,223 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:03:04,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:04,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312248730] [2024-10-11 19:03:04,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312248730] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:03:04,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:03:04,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:03:04,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813064609] [2024-10-11 19:03:04,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:03:04,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:03:04,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:04,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:03:04,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:03:04,227 INFO L87 Difference]: Start difference. First operand 1038 states and 1106 transitions. Second operand has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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:03:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:13,265 INFO L93 Difference]: Finished difference Result 1076 states and 1176 transitions. [2024-10-11 19:03:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:03:13,266 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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 87 [2024-10-11 19:03:13,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:13,268 INFO L225 Difference]: With dead ends: 1076 [2024-10-11 19:03:13,268 INFO L226 Difference]: Without dead ends: 1074 [2024-10-11 19:03:13,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 19:03:13,270 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 25 mSDsluCounter, 18816 mSDsCounter, 0 mSdLazyCounter, 4265 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19637 SdHoareTripleChecker+Invalid, 4290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:13,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19637 Invalid, 4290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4265 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-10-11 19:03:13,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2024-10-11 19:03:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1072. [2024-10-11 19:03:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 647 states have (on average 1.760432766615147) internal successors, (1139), 1062 states have internal predecessors, (1139), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 19:03:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1152 transitions. [2024-10-11 19:03:13,279 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1152 transitions. Word has length 87 [2024-10-11 19:03:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:13,279 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1152 transitions. [2024-10-11 19:03:13,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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:03:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1152 transitions. [2024-10-11 19:03:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 19:03:13,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:13,280 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, 1] [2024-10-11 19:03:13,295 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 (29)] Forceful destruction successful, exit code 0 [2024-10-11 19:03:13,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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:03:13,481 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-10-11 19:03:13,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:13,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1514462219, now seen corresponding path program 5 times [2024-10-11 19:03:13,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:13,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467695405] [2024-10-11 19:03:13,482 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:03:13,482 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:03:13,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:13,484 INFO L229 MonitoredProcess]: Starting monitored process 30 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:03:13,485 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 (30)] Waiting until timeout for monitored process [2024-10-11 19:03:14,724 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:03:14,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:03:14,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 19:03:14,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:14,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:03:14,882 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:03:14,882 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:03:14,910 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:03:14,987 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:03:15,821 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:03:15,822 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:03:15,872 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:03:15,903 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:03:15,905 INFO L311 TraceCheckSpWp]: Computing backward predicates...