./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4318218de1a670b98e217596890d501e5109c78977de7e98dfa51804dcb18c15 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:03:35,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:03:35,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 18:03:35,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:03:35,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:03:35,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:03:35,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:03:35,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:03:35,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:03:35,729 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:03:35,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:03:35,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:03:35,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:03:35,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:03:35,733 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:03:35,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:03:35,734 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:03:35,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:03:35,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:03:35,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:03:35,735 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:03:35,739 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:03:35,740 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:03:35,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:03:35,740 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:03:35,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:03:35,741 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:03:35,741 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:03:35,741 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:03:35,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:03:35,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:03:35,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:03:35,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:03:35,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:03:35,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:03:35,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:03:35,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:03:35,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:03:35,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:03:35,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:03:35,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:03:35,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:03:35,748 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4318218de1a670b98e217596890d501e5109c78977de7e98dfa51804dcb18c15 [2024-10-14 18:03:36,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:03:36,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:03:36,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:03:36,060 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:03:36,060 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:03:36,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i [2024-10-14 18:03:37,732 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:03:38,033 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:03:38,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i [2024-10-14 18:03:38,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05b8a5e0c/5f16830030f445339fd67e9e86b88f7c/FLAGa1a5be921 [2024-10-14 18:03:38,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05b8a5e0c/5f16830030f445339fd67e9e86b88f7c [2024-10-14 18:03:38,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:03:38,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:03:38,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:03:38,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:03:38,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:03:38,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:03:38" (1/1) ... [2024-10-14 18:03:38,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2220726a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:38, skipping insertion in model container [2024-10-14 18:03:38,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:03:38" (1/1) ... [2024-10-14 18:03:38,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:03:38,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:03:38,743 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-14 18:03:38,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@dceae36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:38, skipping insertion in model container [2024-10-14 18:03:38,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:03:38,745 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 18:03:38,747 INFO L158 Benchmark]: Toolchain (without parser) took 672.63ms. Allocated memory is still 184.5MB. Free memory was 130.1MB in the beginning and 113.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 18:03:38,747 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 18:03:38,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 665.78ms. Allocated memory is still 184.5MB. Free memory was 130.1MB in the beginning and 113.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 18:03:38,749 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.14ms. Allocated memory is still 184.5MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 665.78ms. Allocated memory is still 184.5MB. Free memory was 130.1MB in the beginning and 113.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4318218de1a670b98e217596890d501e5109c78977de7e98dfa51804dcb18c15 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:03:41,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:03:41,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 18:03:41,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:03:41,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:03:41,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:03:41,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:03:41,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:03:41,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:03:41,198 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:03:41,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:03:41,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:03:41,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:03:41,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:03:41,200 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:03:41,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:03:41,202 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:03:41,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:03:41,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:03:41,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:03:41,206 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:03:41,207 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:03:41,210 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:03:41,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:03:41,211 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:03:41,211 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 18:03:41,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:03:41,212 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 18:03:41,212 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:03:41,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:03:41,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:03:41,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:03:41,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:03:41,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:03:41,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:03:41,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:03:41,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:03:41,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:03:41,217 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 18:03:41,217 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 18:03:41,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:03:41,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:03:41,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:03:41,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:03:41,219 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 18:03:41,219 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4318218de1a670b98e217596890d501e5109c78977de7e98dfa51804dcb18c15 [2024-10-14 18:03:41,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:03:41,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:03:41,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:03:41,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:03:41,666 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:03:41,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i [2024-10-14 18:03:43,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:03:43,779 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:03:43,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i [2024-10-14 18:03:43,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e903617e3/bef6f4d139bb4265be4b9c4bdf143c16/FLAGa8dc03c5f [2024-10-14 18:03:43,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e903617e3/bef6f4d139bb4265be4b9c4bdf143c16 [2024-10-14 18:03:43,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:03:43,833 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:03:43,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:03:43,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:03:43,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:03:43,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:03:43" (1/1) ... [2024-10-14 18:03:43,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26fae8d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:43, skipping insertion in model container [2024-10-14 18:03:43,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:03:43" (1/1) ... [2024-10-14 18:03:43,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:03:44,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:03:44,501 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 18:03:44,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:03:44,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:03:44,580 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:03:44,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:03:44,721 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:03:44,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44 WrapperNode [2024-10-14 18:03:44,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:03:44,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:03:44,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:03:44,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:03:44,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44" (1/1) ... [2024-10-14 18:03:44,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44" (1/1) ... [2024-10-14 18:03:44,787 INFO L138 Inliner]: procedures = 174, calls = 117, calls flagged for inlining = 29, calls inlined = 14, statements flattened = 189 [2024-10-14 18:03:44,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:03:44,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:03:44,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:03:44,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:03:44,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44" (1/1) ... [2024-10-14 18:03:44,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44" (1/1) ... [2024-10-14 18:03:44,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44" (1/1) ... [2024-10-14 18:03:44,874 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [29, 2, 4]. 83 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2, 0]. The 17 writes are split as follows [13, 0, 4]. [2024-10-14 18:03:44,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44" (1/1) ... [2024-10-14 18:03:44,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44" (1/1) ... [2024-10-14 18:03:44,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44" (1/1) ... [2024-10-14 18:03:44,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44" (1/1) ... [2024-10-14 18:03:44,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44" (1/1) ... [2024-10-14 18:03:44,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44" (1/1) ... [2024-10-14 18:03:44,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:03:44,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:03:44,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:03:44,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:03:44,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44" (1/1) ... [2024-10-14 18:03:44,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:03:44,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:03:44,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 18:03:44,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 18:03:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 18:03:45,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 18:03:45,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 18:03:45,051 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-10-14 18:03:45,051 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-10-14 18:03:45,051 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-10-14 18:03:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-10-14 18:03:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-14 18:03:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-14 18:03:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:03:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 18:03:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2024-10-14 18:03:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2024-10-14 18:03:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 18:03:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:03:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 18:03:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 18:03:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:03:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 18:03:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 18:03:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 18:03:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 18:03:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 18:03:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:03:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 18:03:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 18:03:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 18:03:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-10-14 18:03:45,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-10-14 18:03:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-14 18:03:45,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-14 18:03:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:03:45,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:03:45,275 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:03:45,278 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:03:46,181 INFO L? ?]: Removed 230 outVars from TransFormulas that were not future-live. [2024-10-14 18:03:46,181 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:03:46,278 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:03:46,278 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 18:03:46,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:03:46 BoogieIcfgContainer [2024-10-14 18:03:46,279 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:03:46,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:03:46,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:03:46,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:03:46,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:03:43" (1/3) ... [2024-10-14 18:03:46,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29823e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:03:46, skipping insertion in model container [2024-10-14 18:03:46,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:03:44" (2/3) ... [2024-10-14 18:03:46,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29823e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:03:46, skipping insertion in model container [2024-10-14 18:03:46,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:03:46" (3/3) ... [2024-10-14 18:03:46,292 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test23_4.i [2024-10-14 18:03:46,312 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:03:46,313 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2024-10-14 18:03:46,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:03:46,391 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;@421a17f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:03:46,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2024-10-14 18:03:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 79 states have (on average 2.1392405063291138) internal successors, (169), 155 states have internal predecessors, (169), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 18:03:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:03:46,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:46,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:03:46,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:46,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:46,414 INFO L85 PathProgramCache]: Analyzing trace with hash -138235767, now seen corresponding path program 1 times [2024-10-14 18:03:46,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:46,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885219992] [2024-10-14 18:03:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:46,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:46,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:46,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:46,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 18:03:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:46,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 18:03:46,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:46,678 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-14 18:03:46,749 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-14 18:03:46,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:46,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:46,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885219992] [2024-10-14 18:03:46,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885219992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:46,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:46,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:03:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462806645] [2024-10-14 18:03:46,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:46,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:03:46,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:46,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:03:46,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:03:46,789 INFO L87 Difference]: Start difference. First operand has 170 states, 79 states have (on average 2.1392405063291138) internal successors, (169), 155 states have internal predecessors, (169), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:03:47,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:47,698 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2024-10-14 18:03:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:03:47,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 18:03:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:47,712 INFO L225 Difference]: With dead ends: 184 [2024-10-14 18:03:47,712 INFO L226 Difference]: Without dead ends: 183 [2024-10-14 18:03:47,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:03:47,718 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 8 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:47,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 626 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 18:03:47,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-14 18:03:47,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2024-10-14 18:03:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 85 states have (on average 2.0470588235294116) internal successors, (174), 160 states have internal predecessors, (174), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-14 18:03:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 193 transitions. [2024-10-14 18:03:47,820 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 193 transitions. Word has length 11 [2024-10-14 18:03:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:47,821 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 193 transitions. [2024-10-14 18:03:47,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:03:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions. [2024-10-14 18:03:47,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:03:47,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:47,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:03:47,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 18:03:48,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:48,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:48,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:48,052 INFO L85 PathProgramCache]: Analyzing trace with hash -138235766, now seen corresponding path program 1 times [2024-10-14 18:03:48,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:48,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368245404] [2024-10-14 18:03:48,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:48,053 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-14 18:03:48,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:48,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:48,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 18:03:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:48,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 18:03:48,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:48,195 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-14 18:03:48,333 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-14 18:03:48,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:48,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:48,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368245404] [2024-10-14 18:03:48,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368245404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:48,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:48,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 18:03:48,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780740491] [2024-10-14 18:03:48,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:48,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:03:48,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:48,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:03:48,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:03:48,338 INFO L87 Difference]: Start difference. First operand 177 states and 193 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:03:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:49,286 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2024-10-14 18:03:49,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:03:49,292 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 18:03:49,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:49,294 INFO L225 Difference]: With dead ends: 180 [2024-10-14 18:03:49,294 INFO L226 Difference]: Without dead ends: 180 [2024-10-14 18:03:49,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:03:49,296 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 8 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:49,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 822 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 18:03:49,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-14 18:03:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2024-10-14 18:03:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-14 18:03:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 191 transitions. [2024-10-14 18:03:49,319 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 191 transitions. Word has length 11 [2024-10-14 18:03:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:49,320 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 191 transitions. [2024-10-14 18:03:49,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:03:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 191 transitions. [2024-10-14 18:03:49,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:03:49,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:49,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:03:49,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 18:03:49,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:49,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:49,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1604574568, now seen corresponding path program 1 times [2024-10-14 18:03:49,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:49,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264842922] [2024-10-14 18:03:49,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:49,530 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-14 18:03:49,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:49,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:49,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 18:03:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:49,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 18:03:49,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:49,720 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-14 18:03:49,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:49,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264842922] [2024-10-14 18:03:49,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264842922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:49,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:49,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:03:49,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492602437] [2024-10-14 18:03:49,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:49,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:03:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:49,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:03:49,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:03:49,726 INFO L87 Difference]: Start difference. First operand 177 states and 191 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:03:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:50,044 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2024-10-14 18:03:50,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:03:50,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 18:03:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:50,046 INFO L225 Difference]: With dead ends: 169 [2024-10-14 18:03:50,047 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 18:03:50,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:03:50,048 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:50,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 608 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:03:50,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 18:03:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-10-14 18:03:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 82 states have (on average 2.0121951219512195) internal successors, (165), 153 states have internal predecessors, (165), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 18:03:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2024-10-14 18:03:50,058 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 182 transitions. Word has length 11 [2024-10-14 18:03:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:50,059 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 182 transitions. [2024-10-14 18:03:50,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:03:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 182 transitions. [2024-10-14 18:03:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:03:50,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:50,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:03:50,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 18:03:50,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:50,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:50,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:50,262 INFO L85 PathProgramCache]: Analyzing trace with hash -138321943, now seen corresponding path program 1 times [2024-10-14 18:03:50,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:50,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610971234] [2024-10-14 18:03:50,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:50,262 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-14 18:03:50,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:50,268 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:50,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 18:03:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:50,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:03:50,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:50,364 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-14 18:03:50,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:50,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:50,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610971234] [2024-10-14 18:03:50,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610971234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:50,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:50,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:03:50,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227587264] [2024-10-14 18:03:50,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:50,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:03:50,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:50,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:03:50,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:03:50,367 INFO L87 Difference]: Start difference. First operand 169 states and 182 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:03:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:50,627 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2024-10-14 18:03:50,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:03:50,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 18:03:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:50,632 INFO L225 Difference]: With dead ends: 170 [2024-10-14 18:03:50,632 INFO L226 Difference]: Without dead ends: 170 [2024-10-14 18:03:50,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:03:50,633 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 85 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:50,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 514 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:03:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-14 18:03:50,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2024-10-14 18:03:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 82 states have (on average 2.0) internal successors, (164), 153 states have internal predecessors, (164), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 18:03:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2024-10-14 18:03:50,643 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 11 [2024-10-14 18:03:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:50,643 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2024-10-14 18:03:50,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:03:50,643 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2024-10-14 18:03:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:03:50,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:50,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:03:50,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 18:03:50,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:50,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:50,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:50,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1604488392, now seen corresponding path program 1 times [2024-10-14 18:03:50,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:50,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228071144] [2024-10-14 18:03:50,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:50,846 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-14 18:03:50,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:50,852 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:50,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 18:03:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:50,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:03:50,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:50,945 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-14 18:03:50,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:50,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:50,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228071144] [2024-10-14 18:03:50,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228071144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:50,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:50,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:03:50,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883851068] [2024-10-14 18:03:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:50,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:03:50,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:50,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:03:50,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:03:50,949 INFO L87 Difference]: Start difference. First operand 169 states and 181 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:03:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:51,214 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2024-10-14 18:03:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:03:51,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 18:03:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:51,215 INFO L225 Difference]: With dead ends: 171 [2024-10-14 18:03:51,215 INFO L226 Difference]: Without dead ends: 171 [2024-10-14 18:03:51,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:03:51,216 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 79 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:51,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 523 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:03:51,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-14 18:03:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-14 18:03:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 84 states have (on average 1.9761904761904763) internal successors, (166), 155 states have internal predecessors, (166), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 18:03:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 183 transitions. [2024-10-14 18:03:51,225 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 183 transitions. Word has length 11 [2024-10-14 18:03:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:51,225 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 183 transitions. [2024-10-14 18:03:51,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:03:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 183 transitions. [2024-10-14 18:03:51,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 18:03:51,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:51,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:03:51,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-14 18:03:51,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:51,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:51,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1800447295, now seen corresponding path program 1 times [2024-10-14 18:03:51,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:51,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440368296] [2024-10-14 18:03:51,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:51,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:51,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:51,432 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:51,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 18:03:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:51,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:03:51,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:51,549 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-14 18:03:51,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:51,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:51,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440368296] [2024-10-14 18:03:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440368296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:51,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:51,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:03:51,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908778137] [2024-10-14 18:03:51,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:51,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:03:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:51,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:03:51,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:03:51,551 INFO L87 Difference]: Start difference. First operand 171 states and 183 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-14 18:03:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:52,016 INFO L93 Difference]: Finished difference Result 183 states and 197 transitions. [2024-10-14 18:03:52,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:03:52,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-10-14 18:03:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:52,020 INFO L225 Difference]: With dead ends: 183 [2024-10-14 18:03:52,020 INFO L226 Difference]: Without dead ends: 175 [2024-10-14 18:03:52,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-14 18:03:52,021 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 44 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:52,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 285 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:03:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-14 18:03:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 165. [2024-10-14 18:03:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 79 states have (on average 2.0253164556962027) internal successors, (160), 150 states have internal predecessors, (160), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 18:03:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 176 transitions. [2024-10-14 18:03:52,029 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 176 transitions. Word has length 12 [2024-10-14 18:03:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:52,029 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 176 transitions. [2024-10-14 18:03:52,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-14 18:03:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2024-10-14 18:03:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 18:03:52,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:52,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:03:52,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 18:03:52,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:52,234 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:52,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash 692160586, now seen corresponding path program 1 times [2024-10-14 18:03:52,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:52,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690350705] [2024-10-14 18:03:52,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:52,235 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-14 18:03:52,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:52,236 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:52,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 18:03:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:52,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 18:03:52,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:52,401 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-14 18:03:52,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:03:52,452 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-14 18:03:52,523 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-14 18:03:52,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:52,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:52,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690350705] [2024-10-14 18:03:52,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690350705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:52,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:52,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:03:52,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268052202] [2024-10-14 18:03:52,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:52,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:03:52,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:52,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:03:52,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=19, Unknown=1, NotChecked=8, Total=42 [2024-10-14 18:03:52,526 INFO L87 Difference]: Start difference. First operand 165 states and 176 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:03:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:53,038 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2024-10-14 18:03:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:03:53,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-14 18:03:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:53,040 INFO L225 Difference]: With dead ends: 175 [2024-10-14 18:03:53,041 INFO L226 Difference]: Without dead ends: 175 [2024-10-14 18:03:53,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=27, Unknown=1, NotChecked=10, Total=56 [2024-10-14 18:03:53,042 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 47 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:53,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 231 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 252 Invalid, 0 Unknown, 194 Unchecked, 0.5s Time] [2024-10-14 18:03:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-14 18:03:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 164. [2024-10-14 18:03:53,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 79 states have (on average 2.0126582278481013) internal successors, (159), 149 states have internal predecessors, (159), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 18:03:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2024-10-14 18:03:53,049 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 14 [2024-10-14 18:03:53,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:53,050 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2024-10-14 18:03:53,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:03:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2024-10-14 18:03:53,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 18:03:53,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:53,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:03:53,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 18:03:53,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:53,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:53,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash 692160585, now seen corresponding path program 1 times [2024-10-14 18:03:53,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:53,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789461299] [2024-10-14 18:03:53,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:53,254 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-14 18:03:53,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:53,257 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:53,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 18:03:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:53,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 18:03:53,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:53,417 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-14 18:03:53,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-14 18:03:53,525 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-14 18:03:53,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:53,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:53,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789461299] [2024-10-14 18:03:53,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789461299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:53,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:53,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:03:53,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640799542] [2024-10-14 18:03:53,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:53,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:03:53,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:53,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:03:53,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:03:53,528 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:03:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:54,278 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2024-10-14 18:03:54,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:03:54,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-14 18:03:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:54,279 INFO L225 Difference]: With dead ends: 210 [2024-10-14 18:03:54,280 INFO L226 Difference]: Without dead ends: 210 [2024-10-14 18:03:54,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:03:54,280 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 165 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:54,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 365 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 18:03:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-14 18:03:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 172. [2024-10-14 18:03:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 156 states have internal predecessors, (171), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-14 18:03:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2024-10-14 18:03:54,288 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 14 [2024-10-14 18:03:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:54,288 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2024-10-14 18:03:54,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:03:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2024-10-14 18:03:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 18:03:54,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:54,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:03:54,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 18:03:54,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:54,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:54,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:54,492 INFO L85 PathProgramCache]: Analyzing trace with hash -162180891, now seen corresponding path program 1 times [2024-10-14 18:03:54,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:54,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027011432] [2024-10-14 18:03:54,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:54,493 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-14 18:03:54,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:54,494 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:54,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 18:03:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:54,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 18:03:54,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:54,606 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-14 18:03:54,631 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-14 18:03:54,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:54,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027011432] [2024-10-14 18:03:54,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027011432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:54,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:54,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:03:54,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290247935] [2024-10-14 18:03:54,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:54,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:03:54,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:54,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:03:54,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:03:54,634 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:03:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:55,097 INFO L93 Difference]: Finished difference Result 213 states and 238 transitions. [2024-10-14 18:03:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:03:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-10-14 18:03:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:55,099 INFO L225 Difference]: With dead ends: 213 [2024-10-14 18:03:55,099 INFO L226 Difference]: Without dead ends: 213 [2024-10-14 18:03:55,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:03:55,100 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 49 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:55,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 385 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:03:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-14 18:03:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 189. [2024-10-14 18:03:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 105 states have (on average 2.019047619047619) internal successors, (212), 173 states have internal predecessors, (212), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-14 18:03:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 230 transitions. [2024-10-14 18:03:55,107 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 230 transitions. Word has length 20 [2024-10-14 18:03:55,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:55,107 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 230 transitions. [2024-10-14 18:03:55,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:03:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 230 transitions. [2024-10-14 18:03:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 18:03:55,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:55,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:03:55,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 18:03:55,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:55,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:55,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:55,310 INFO L85 PathProgramCache]: Analyzing trace with hash -162180890, now seen corresponding path program 1 times [2024-10-14 18:03:55,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:55,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100970616] [2024-10-14 18:03:55,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:55,310 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-14 18:03:55,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:55,313 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:55,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 18:03:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:55,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 18:03:55,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:55,424 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-14 18:03:55,514 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-14 18:03:55,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:55,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:55,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100970616] [2024-10-14 18:03:55,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100970616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:55,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:55,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:03:55,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352108615] [2024-10-14 18:03:55,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:55,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:03:55,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:55,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:03:55,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:03:55,516 INFO L87 Difference]: Start difference. First operand 189 states and 230 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:03:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:56,107 INFO L93 Difference]: Finished difference Result 211 states and 236 transitions. [2024-10-14 18:03:56,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:03:56,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-10-14 18:03:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:56,108 INFO L225 Difference]: With dead ends: 211 [2024-10-14 18:03:56,108 INFO L226 Difference]: Without dead ends: 211 [2024-10-14 18:03:56,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:03:56,109 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 46 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:56,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 401 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 18:03:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-14 18:03:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 190. [2024-10-14 18:03:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 107 states have (on average 1.9906542056074767) internal successors, (213), 173 states have internal predecessors, (213), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 18:03:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 234 transitions. [2024-10-14 18:03:56,126 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 234 transitions. Word has length 20 [2024-10-14 18:03:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:56,126 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 234 transitions. [2024-10-14 18:03:56,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:03:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 234 transitions. [2024-10-14 18:03:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 18:03:56,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:56,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:03:56,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-14 18:03:56,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:56,328 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:56,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:56,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1236952511, now seen corresponding path program 1 times [2024-10-14 18:03:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:56,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690074201] [2024-10-14 18:03:56,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:56,329 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-14 18:03:56,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:56,331 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:56,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 18:03:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:56,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:03:56,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:56,433 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-14 18:03:56,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:56,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:56,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690074201] [2024-10-14 18:03:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690074201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:56,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:56,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:03:56,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386730814] [2024-10-14 18:03:56,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:56,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:03:56,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:56,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:03:56,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:03:56,435 INFO L87 Difference]: Start difference. First operand 190 states and 234 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:03:56,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:56,669 INFO L93 Difference]: Finished difference Result 190 states and 233 transitions. [2024-10-14 18:03:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:03:56,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-10-14 18:03:56,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:56,671 INFO L225 Difference]: With dead ends: 190 [2024-10-14 18:03:56,671 INFO L226 Difference]: Without dead ends: 190 [2024-10-14 18:03:56,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:03:56,672 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 63 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:56,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 483 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:03:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-14 18:03:56,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-10-14 18:03:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 107 states have (on average 1.9813084112149533) internal successors, (212), 173 states have internal predecessors, (212), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 18:03:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 233 transitions. [2024-10-14 18:03:56,678 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 233 transitions. Word has length 22 [2024-10-14 18:03:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:56,678 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 233 transitions. [2024-10-14 18:03:56,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:03:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 233 transitions. [2024-10-14 18:03:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 18:03:56,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:56,679 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] [2024-10-14 18:03:56,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-14 18:03:56,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:56,880 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:56,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:56,880 INFO L85 PathProgramCache]: Analyzing trace with hash -328302440, now seen corresponding path program 1 times [2024-10-14 18:03:56,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:56,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278718790] [2024-10-14 18:03:56,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:56,881 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-14 18:03:56,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:56,883 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:56,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 18:03:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:57,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 18:03:57,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:57,043 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-14 18:03:57,080 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-14 18:03:57,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-14 18:03:57,138 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-14 18:03:57,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:57,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:57,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278718790] [2024-10-14 18:03:57,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278718790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:57,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:57,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:03:57,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108095403] [2024-10-14 18:03:57,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:57,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:03:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:57,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:03:57,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:03:57,140 INFO L87 Difference]: Start difference. First operand 190 states and 233 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:03:57,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:57,832 INFO L93 Difference]: Finished difference Result 202 states and 242 transitions. [2024-10-14 18:03:57,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:03:57,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-14 18:03:57,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:57,835 INFO L225 Difference]: With dead ends: 202 [2024-10-14 18:03:57,835 INFO L226 Difference]: Without dead ends: 202 [2024-10-14 18:03:57,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:03:57,836 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 108 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:57,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 346 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 18:03:57,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-14 18:03:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2024-10-14 18:03:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 107 states have (on average 1.9065420560747663) internal successors, (204), 169 states have internal predecessors, (204), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 18:03:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 225 transitions. [2024-10-14 18:03:57,842 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 225 transitions. Word has length 26 [2024-10-14 18:03:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:57,842 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 225 transitions. [2024-10-14 18:03:57,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:03:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 225 transitions. [2024-10-14 18:03:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 18:03:57,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:57,843 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] [2024-10-14 18:03:57,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 18:03:58,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:58,044 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:58,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:58,045 INFO L85 PathProgramCache]: Analyzing trace with hash -328302439, now seen corresponding path program 1 times [2024-10-14 18:03:58,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:58,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53880730] [2024-10-14 18:03:58,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:58,045 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-14 18:03:58,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:58,047 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:58,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 18:03:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:58,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 18:03:58,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:58,222 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-14 18:03:58,228 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-14 18:03:58,261 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#res#1.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#res#1.base| (select |c_#length| |ldv_zalloc_#res#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#res#1.base|)))) is different from true [2024-10-14 18:03:58,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:03:58,287 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-14 18:03:58,309 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 18:03:58,310 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-14 18:03:58,386 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-14 18:03:58,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:58,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:58,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53880730] [2024-10-14 18:03:58,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53880730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:58,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:58,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:03:58,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412009752] [2024-10-14 18:03:58,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:58,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:03:58,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:58,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:03:58,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-10-14 18:03:58,388 INFO L87 Difference]: Start difference. First operand 186 states and 225 transitions. Second operand has 7 states, 4 states have (on average 5.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:03:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:59,201 INFO L93 Difference]: Finished difference Result 212 states and 236 transitions. [2024-10-14 18:03:59,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:03:59,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 4 states have (on average 5.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-14 18:03:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:59,208 INFO L225 Difference]: With dead ends: 212 [2024-10-14 18:03:59,208 INFO L226 Difference]: Without dead ends: 212 [2024-10-14 18:03:59,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=29, Unknown=1, NotChecked=10, Total=56 [2024-10-14 18:03:59,209 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 91 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:59,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 302 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 460 Invalid, 0 Unknown, 238 Unchecked, 0.8s Time] [2024-10-14 18:03:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-14 18:03:59,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 186. [2024-10-14 18:03:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 107 states have (on average 1.8691588785046729) internal successors, (200), 169 states have internal predecessors, (200), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 18:03:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 221 transitions. [2024-10-14 18:03:59,219 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 221 transitions. Word has length 26 [2024-10-14 18:03:59,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:59,219 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 221 transitions. [2024-10-14 18:03:59,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 4 states have (on average 5.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:03:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 221 transitions. [2024-10-14 18:03:59,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 18:03:59,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:59,225 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] [2024-10-14 18:03:59,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-14 18:03:59,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:59,426 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:59,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:59,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1966071572, now seen corresponding path program 1 times [2024-10-14 18:03:59,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:59,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861364261] [2024-10-14 18:03:59,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:59,427 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-14 18:03:59,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:03:59,429 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:03:59,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 18:03:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:03:59,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 18:03:59,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:03:59,573 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-14 18:03:59,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:03:59,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:03:59,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861364261] [2024-10-14 18:03:59,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861364261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:03:59,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:03:59,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:03:59,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537745667] [2024-10-14 18:03:59,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:03:59,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:03:59,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:03:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:03:59,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:03:59,575 INFO L87 Difference]: Start difference. First operand 186 states and 221 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:03:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:03:59,784 INFO L93 Difference]: Finished difference Result 190 states and 225 transitions. [2024-10-14 18:03:59,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:03:59,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-10-14 18:03:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:03:59,786 INFO L225 Difference]: With dead ends: 190 [2024-10-14 18:03:59,786 INFO L226 Difference]: Without dead ends: 190 [2024-10-14 18:03:59,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-14 18:03:59,787 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:03:59,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 413 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:03:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-14 18:03:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-10-14 18:03:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 111 states have (on average 1.837837837837838) internal successors, (204), 173 states have internal predecessors, (204), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 18:03:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 225 transitions. [2024-10-14 18:03:59,793 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 225 transitions. Word has length 28 [2024-10-14 18:03:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:03:59,794 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 225 transitions. [2024-10-14 18:03:59,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:03:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 225 transitions. [2024-10-14 18:03:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:03:59,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:03:59,795 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-14 18:03:59,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-14 18:03:59,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:03:59,996 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:03:59,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:03:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash -818676659, now seen corresponding path program 1 times [2024-10-14 18:03:59,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:03:59,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160150023] [2024-10-14 18:03:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:03:59,997 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-14 18:03:59,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:00,002 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:00,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 18:04:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:00,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 18:04:00,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:00,439 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-14 18:04:00,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:00,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:00,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160150023] [2024-10-14 18:04:00,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160150023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:00,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:00,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:04:00,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016078559] [2024-10-14 18:04:00,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:00,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:04:00,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:00,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:04:00,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:04:00,441 INFO L87 Difference]: Start difference. First operand 190 states and 225 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:04:01,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:01,293 INFO L93 Difference]: Finished difference Result 188 states and 222 transitions. [2024-10-14 18:04:01,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:04:01,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-10-14 18:04:01,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:01,295 INFO L225 Difference]: With dead ends: 188 [2024-10-14 18:04:01,295 INFO L226 Difference]: Without dead ends: 188 [2024-10-14 18:04:01,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:04:01,296 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 205 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:01,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 397 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 18:04:01,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-14 18:04:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-10-14 18:04:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 111 states have (on average 1.8108108108108107) internal successors, (201), 171 states have internal predecessors, (201), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 18:04:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 222 transitions. [2024-10-14 18:04:01,302 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 222 transitions. Word has length 29 [2024-10-14 18:04:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:01,303 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 222 transitions. [2024-10-14 18:04:01,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:04:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 222 transitions. [2024-10-14 18:04:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 18:04:01,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:01,304 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-14 18:04:01,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-14 18:04:01,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:01,505 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:04:01,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:01,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2043301572, now seen corresponding path program 1 times [2024-10-14 18:04:01,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:01,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040359036] [2024-10-14 18:04:01,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:01,506 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-14 18:04:01,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:01,507 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:01,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 18:04:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:01,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 18:04:01,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:01,712 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-14 18:04:01,769 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-14 18:04:01,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:01,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:01,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040359036] [2024-10-14 18:04:01,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040359036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:01,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:01,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:04:01,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693494918] [2024-10-14 18:04:01,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:01,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:04:01,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:01,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:04:01,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:04:01,772 INFO L87 Difference]: Start difference. First operand 188 states and 222 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:04:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:02,354 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2024-10-14 18:04:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:04:02,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-14 18:04:02,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:02,360 INFO L225 Difference]: With dead ends: 198 [2024-10-14 18:04:02,360 INFO L226 Difference]: Without dead ends: 198 [2024-10-14 18:04:02,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:04:02,361 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 28 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:02,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 462 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 18:04:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-14 18:04:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2024-10-14 18:04:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 111 states have (on average 1.7837837837837838) internal successors, (198), 170 states have internal predecessors, (198), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 18:04:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 219 transitions. [2024-10-14 18:04:02,371 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 219 transitions. Word has length 32 [2024-10-14 18:04:02,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:02,371 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 219 transitions. [2024-10-14 18:04:02,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:04:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 219 transitions. [2024-10-14 18:04:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 18:04:02,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:02,372 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-14 18:04:02,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-14 18:04:02,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:02,576 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:04:02,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2043301573, now seen corresponding path program 1 times [2024-10-14 18:04:02,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:02,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976471635] [2024-10-14 18:04:02,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:02,577 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-14 18:04:02,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:02,579 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:02,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-14 18:04:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:02,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 18:04:02,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:02,800 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-14 18:04:02,933 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-14 18:04:02,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:02,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:02,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976471635] [2024-10-14 18:04:02,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976471635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:02,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:02,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:04:02,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094757067] [2024-10-14 18:04:02,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:02,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:04:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:02,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:04:02,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:04:02,935 INFO L87 Difference]: Start difference. First operand 187 states and 219 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:04:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:03,565 INFO L93 Difference]: Finished difference Result 196 states and 219 transitions. [2024-10-14 18:04:03,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:04:03,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-14 18:04:03,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:03,566 INFO L225 Difference]: With dead ends: 196 [2024-10-14 18:04:03,567 INFO L226 Difference]: Without dead ends: 196 [2024-10-14 18:04:03,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:04:03,567 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 24 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:03,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 470 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 18:04:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-14 18:04:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2024-10-14 18:04:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 111 states have (on average 1.7657657657657657) internal successors, (196), 170 states have internal predecessors, (196), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 18:04:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 217 transitions. [2024-10-14 18:04:03,573 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 217 transitions. Word has length 32 [2024-10-14 18:04:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:03,573 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 217 transitions. [2024-10-14 18:04:03,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:04:03,573 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 217 transitions. [2024-10-14 18:04:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 18:04:03,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:03,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:04:03,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-14 18:04:03,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:03,778 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:04:03,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:03,779 INFO L85 PathProgramCache]: Analyzing trace with hash -511413025, now seen corresponding path program 1 times [2024-10-14 18:04:03,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:03,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453059214] [2024-10-14 18:04:03,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:03,780 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-14 18:04:03,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:03,781 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:03,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-14 18:04:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:03,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 18:04:03,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:03,933 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-14 18:04:03,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:03,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:03,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453059214] [2024-10-14 18:04:03,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453059214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:03,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:03,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:04:03,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777264316] [2024-10-14 18:04:03,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:03,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:04:03,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:03,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:04:03,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:04:03,938 INFO L87 Difference]: Start difference. First operand 187 states and 217 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:04:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:04,233 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2024-10-14 18:04:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:04:04,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-10-14 18:04:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:04,236 INFO L225 Difference]: With dead ends: 189 [2024-10-14 18:04:04,236 INFO L226 Difference]: Without dead ends: 189 [2024-10-14 18:04:04,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-14 18:04:04,237 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:04,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 403 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:04:04,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-14 18:04:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-10-14 18:04:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 113 states have (on average 1.752212389380531) internal successors, (198), 172 states have internal predecessors, (198), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 18:04:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 219 transitions. [2024-10-14 18:04:04,242 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 219 transitions. Word has length 33 [2024-10-14 18:04:04,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:04,243 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 219 transitions. [2024-10-14 18:04:04,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:04:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 219 transitions. [2024-10-14 18:04:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:04:04,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:04,248 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] [2024-10-14 18:04:04,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-14 18:04:04,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:04,448 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:04:04,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:04,449 INFO L85 PathProgramCache]: Analyzing trace with hash 812765044, now seen corresponding path program 1 times [2024-10-14 18:04:04,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:04,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324602642] [2024-10-14 18:04:04,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:04,450 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-14 18:04:04,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:04,451 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:04,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-14 18:04:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:04,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 18:04:04,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:05,010 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-10-14 18:04:05,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 46 [2024-10-14 18:04:05,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:04:05,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:04:05,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2024-10-14 18:04:05,489 INFO L349 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2024-10-14 18:04:05,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2024-10-14 18:04:05,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:04:05,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 11 [2024-10-14 18:04:05,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:04:06,085 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-14 18:04:06,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:06,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:06,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324602642] [2024-10-14 18:04:06,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324602642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:06,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:06,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 18:04:06,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926642893] [2024-10-14 18:04:06,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:06,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 18:04:06,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:06,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 18:04:06,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-14 18:04:06,088 INFO L87 Difference]: Start difference. First operand 189 states and 219 transitions. Second operand has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:04:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:09,845 INFO L93 Difference]: Finished difference Result 264 states and 298 transitions. [2024-10-14 18:04:09,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 18:04:09,846 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2024-10-14 18:04:09,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:09,847 INFO L225 Difference]: With dead ends: 264 [2024-10-14 18:04:09,848 INFO L226 Difference]: Without dead ends: 264 [2024-10-14 18:04:09,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2024-10-14 18:04:09,848 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 402 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:09,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 832 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1520 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 18:04:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-14 18:04:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 204. [2024-10-14 18:04:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 129 states have (on average 1.751937984496124) internal successors, (226), 186 states have internal predecessors, (226), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-14 18:04:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 249 transitions. [2024-10-14 18:04:09,855 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 249 transitions. Word has length 34 [2024-10-14 18:04:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:09,855 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 249 transitions. [2024-10-14 18:04:09,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:04:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 249 transitions. [2024-10-14 18:04:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:04:09,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:09,856 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] [2024-10-14 18:04:09,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-14 18:04:10,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:10,057 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:04:10,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:10,058 INFO L85 PathProgramCache]: Analyzing trace with hash 812765045, now seen corresponding path program 1 times [2024-10-14 18:04:10,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:10,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264157479] [2024-10-14 18:04:10,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:10,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-14 18:04:10,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:10,060 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:10,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-14 18:04:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:10,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-14 18:04:10,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:10,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:04:10,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-14 18:04:10,612 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-10-14 18:04:10,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-14 18:04:10,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:04:10,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-14 18:04:10,939 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:04:10,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 18:04:11,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:04:11,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:04:11,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 11 [2024-10-14 18:04:11,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 11 [2024-10-14 18:04:11,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:04:11,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:04:11,339 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-14 18:04:11,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:11,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:11,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264157479] [2024-10-14 18:04:11,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264157479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:11,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:11,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 18:04:11,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30091181] [2024-10-14 18:04:11,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:11,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 18:04:11,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:11,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 18:04:11,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-10-14 18:04:11,341 INFO L87 Difference]: Start difference. First operand 204 states and 249 transitions. Second operand has 16 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:04:15,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:04:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:16,631 INFO L93 Difference]: Finished difference Result 228 states and 264 transitions. [2024-10-14 18:04:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 18:04:16,632 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2024-10-14 18:04:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:16,634 INFO L225 Difference]: With dead ends: 228 [2024-10-14 18:04:16,634 INFO L226 Difference]: Without dead ends: 228 [2024-10-14 18:04:16,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2024-10-14 18:04:16,635 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 495 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:16,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 495 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-14 18:04:16,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-14 18:04:16,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 203. [2024-10-14 18:04:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 129 states have (on average 1.7209302325581395) internal successors, (222), 185 states have internal predecessors, (222), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-14 18:04:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 245 transitions. [2024-10-14 18:04:16,641 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 245 transitions. Word has length 34 [2024-10-14 18:04:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:16,641 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 245 transitions. [2024-10-14 18:04:16,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:04:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 245 transitions. [2024-10-14 18:04:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 18:04:16,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:16,642 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] [2024-10-14 18:04:16,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-14 18:04:16,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:16,844 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:04:16,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:16,844 INFO L85 PathProgramCache]: Analyzing trace with hash -574083031, now seen corresponding path program 1 times [2024-10-14 18:04:16,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:16,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654655843] [2024-10-14 18:04:16,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:16,845 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-14 18:04:16,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:16,846 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:16,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-14 18:04:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:17,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-14 18:04:17,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:17,563 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-14 18:04:17,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:04:17,681 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2024-10-14 18:04:17,682 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 25 treesize of output 28 [2024-10-14 18:04:17,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-10-14 18:04:17,761 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-10-14 18:04:17,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2024-10-14 18:04:17,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:04:17,874 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-10-14 18:04:17,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2024-10-14 18:04:17,979 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:04:17,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 25 [2024-10-14 18:04:17,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2024-10-14 18:04:18,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:04:18,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:04:18,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2024-10-14 18:04:18,290 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-14 18:04:18,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:18,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:18,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654655843] [2024-10-14 18:04:18,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654655843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:18,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:18,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-14 18:04:18,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357525809] [2024-10-14 18:04:18,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:18,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 18:04:18,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:18,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 18:04:18,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-10-14 18:04:18,293 INFO L87 Difference]: Start difference. First operand 203 states and 245 transitions. Second operand has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:04:21,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:04:21,044 INFO L93 Difference]: Finished difference Result 227 states and 260 transitions. [2024-10-14 18:04:21,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 18:04:21,044 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-10-14 18:04:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:04:21,046 INFO L225 Difference]: With dead ends: 227 [2024-10-14 18:04:21,046 INFO L226 Difference]: Without dead ends: 227 [2024-10-14 18:04:21,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2024-10-14 18:04:21,047 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 263 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:04:21,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 610 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 18:04:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-14 18:04:21,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 201. [2024-10-14 18:04:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 129 states have (on average 1.6744186046511629) internal successors, (216), 183 states have internal predecessors, (216), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-14 18:04:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 239 transitions. [2024-10-14 18:04:21,057 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 239 transitions. Word has length 35 [2024-10-14 18:04:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:04:21,057 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 239 transitions. [2024-10-14 18:04:21,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:04:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 239 transitions. [2024-10-14 18:04:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 18:04:21,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:04:21,058 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] [2024-10-14 18:04:21,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-14 18:04:21,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:04:21,263 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-14 18:04:21,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:04:21,263 INFO L85 PathProgramCache]: Analyzing trace with hash -574083030, now seen corresponding path program 1 times [2024-10-14 18:04:21,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:04:21,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910895051] [2024-10-14 18:04:21,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:04:21,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-14 18:04:21,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:04:21,265 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:04:21,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-14 18:04:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:04:21,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-14 18:04:21,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:04:21,757 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-14 18:04:21,762 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-14 18:04:21,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:04:21,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 18:04:21,997 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-10-14 18:04:21,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-10-14 18:04:22,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:04:22,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:04:22,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2024-10-14 18:04:22,131 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-14 18:04:22,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 18:04:22,394 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 18:04:22,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-14 18:04:22,427 INFO L349 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2024-10-14 18:04:22,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2024-10-14 18:04:22,867 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 18:04:22,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2024-10-14 18:04:22,903 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 18:04:22,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-10-14 18:04:23,832 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:04:23,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 56 [2024-10-14 18:04:23,864 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 18:04:23,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 46 [2024-10-14 18:04:23,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2024-10-14 18:04:26,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-14 18:04:27,275 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:04:27,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 42 [2024-10-14 18:04:27,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:04:27,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 32 [2024-10-14 18:04:27,568 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-14 18:04:27,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:04:27,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:04:27,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910895051] [2024-10-14 18:04:27,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910895051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:04:27,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:04:27,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-14 18:04:27,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784353118] [2024-10-14 18:04:27,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:04:27,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 18:04:27,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:04:27,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 18:04:27,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2024-10-14 18:04:27,571 INFO L87 Difference]: Start difference. First operand 201 states and 239 transitions. Second operand has 21 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:04:32,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:04:35,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:04:40,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:04:45,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:04:49,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:04:56,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:05:03,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:05:07,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]