./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_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03499c01c9320e6c56c78c984f54a0b0b3f62caee089ccaa631f137e86019454 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:05:41,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:05:41,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:05:41,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:05:41,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:05:41,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:05:41,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:05:41,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:05:41,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:05:41,731 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:05:41,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:05:41,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:05:41,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:05:41,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:05:41,738 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:05:41,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:05:41,738 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:05:41,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:05:41,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:05:41,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:05:41,739 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:05:41,743 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:05:41,744 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:05:41,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:05:41,744 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:05:41,744 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:05:41,745 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:05:41,745 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:05:41,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:05:41,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:05:41,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:05:41,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:05:41,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:05:41,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:05:41,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:05:41,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:05:41,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:05:41,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:05:41,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:05:41,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:05:41,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:05:41,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:05:41,751 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03499c01c9320e6c56c78c984f54a0b0b3f62caee089ccaa631f137e86019454 [2024-10-11 18:05:42,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:05:42,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:05:42,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:05:42,072 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:05:42,072 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:05:42,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i [2024-10-11 18:05:43,559 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:05:43,773 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:05:43,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i [2024-10-11 18:05:43,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3eea61c6a/999ef1f074e7494f89d19c6fbb653bf3/FLAG6b891c85d [2024-10-11 18:05:43,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3eea61c6a/999ef1f074e7494f89d19c6fbb653bf3 [2024-10-11 18:05:43,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:05:43,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:05:43,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:05:43,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:05:43,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:05:43,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:05:43" (1/1) ... [2024-10-11 18:05:43,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d61e196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:43, skipping insertion in model container [2024-10-11 18:05:43,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:05:43" (1/1) ... [2024-10-11 18:05:43,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:05:44,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:05:44,257 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 18:05:44,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@45e736ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:44, skipping insertion in model container [2024-10-11 18:05:44,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:05:44,258 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 18:05:44,260 INFO L158 Benchmark]: Toolchain (without parser) took 456.65ms. Allocated memory is still 167.8MB. Free memory was 95.2MB in the beginning and 78.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 18:05:44,260 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:05:44,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.62ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 78.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 18:05:44,262 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.62ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 78.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03499c01c9320e6c56c78c984f54a0b0b3f62caee089ccaa631f137e86019454 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:05:47,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:05:47,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 18:05:47,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:05:47,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:05:47,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:05:47,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:05:47,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:05:47,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:05:47,206 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:05:47,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:05:47,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:05:47,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:05:47,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:05:47,208 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:05:47,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:05:47,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:05:47,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:05:47,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:05:47,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:05:47,210 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:05:47,210 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:05:47,210 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:05:47,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:05:47,211 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:05:47,211 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 18:05:47,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:05:47,212 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 18:05:47,212 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:05:47,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:05:47,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:05:47,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:05:47,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:05:47,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:05:47,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:05:47,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:05:47,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:05:47,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:05:47,214 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 18:05:47,214 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 18:05:47,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:05:47,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:05:47,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:05:47,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:05:47,217 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 18:05:47,217 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03499c01c9320e6c56c78c984f54a0b0b3f62caee089ccaa631f137e86019454 [2024-10-11 18:05:47,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:05:47,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:05:47,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:05:47,532 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:05:47,533 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:05:47,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i [2024-10-11 18:05:49,306 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:05:49,642 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:05:49,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i [2024-10-11 18:05:49,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc8ec0e3a/db955a45154346a4839b47ed311635a8/FLAGc013da6e9 [2024-10-11 18:05:49,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc8ec0e3a/db955a45154346a4839b47ed311635a8 [2024-10-11 18:05:49,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:05:49,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:05:49,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:05:49,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:05:49,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:05:49,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:05:49" (1/1) ... [2024-10-11 18:05:49,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca64a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:49, skipping insertion in model container [2024-10-11 18:05:49,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:05:49" (1/1) ... [2024-10-11 18:05:49,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:05:50,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:05:50,189 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 18:05:50,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:05:50,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:05:50,260 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:05:50,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:05:50,377 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:05:50,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50 WrapperNode [2024-10-11 18:05:50,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:05:50,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:05:50,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:05:50,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:05:50,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50" (1/1) ... [2024-10-11 18:05:50,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50" (1/1) ... [2024-10-11 18:05:50,444 INFO L138 Inliner]: procedures = 175, calls = 119, calls flagged for inlining = 30, calls inlined = 15, statements flattened = 204 [2024-10-11 18:05:50,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:05:50,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:05:50,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:05:50,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:05:50,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50" (1/1) ... [2024-10-11 18:05:50,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50" (1/1) ... [2024-10-11 18:05:50,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50" (1/1) ... [2024-10-11 18:05:50,493 INFO L175 MemorySlicer]: Split 36 memory accesses to 3 slices as follows [2, 5, 29]. 81 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2]. The 17 writes are split as follows [0, 4, 13]. [2024-10-11 18:05:50,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50" (1/1) ... [2024-10-11 18:05:50,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50" (1/1) ... [2024-10-11 18:05:50,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50" (1/1) ... [2024-10-11 18:05:50,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50" (1/1) ... [2024-10-11 18:05:50,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50" (1/1) ... [2024-10-11 18:05:50,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50" (1/1) ... [2024-10-11 18:05:50,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:05:50,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:05:50,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:05:50,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:05:50,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50" (1/1) ... [2024-10-11 18:05:50,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:05:50,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:05:50,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:05:50,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:05:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 18:05:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 18:05:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 18:05:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-10-11 18:05:50,651 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-10-11 18:05:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-10-11 18:05:50,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-10-11 18:05:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 18:05:50,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 18:05:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:05:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:05:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2024-10-11 18:05:50,652 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2024-10-11 18:05:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:05:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:05:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:05:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 18:05:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:05:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:05:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:05:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 18:05:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 18:05:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 18:05:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:05:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:05:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:05:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:05:50,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-10-11 18:05:50,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-10-11 18:05:50,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-11 18:05:50,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-11 18:05:50,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:05:50,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:05:50,827 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:05:50,829 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:05:51,516 INFO L? ?]: Removed 247 outVars from TransFormulas that were not future-live. [2024-10-11 18:05:51,517 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:05:51,592 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:05:51,594 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 18:05:51,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:05:51 BoogieIcfgContainer [2024-10-11 18:05:51,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:05:51,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:05:51,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:05:51,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:05:51,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:05:49" (1/3) ... [2024-10-11 18:05:51,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11efadd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:05:51, skipping insertion in model container [2024-10-11 18:05:51,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:50" (2/3) ... [2024-10-11 18:05:51,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11efadd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:05:51, skipping insertion in model container [2024-10-11 18:05:51,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:05:51" (3/3) ... [2024-10-11 18:05:51,602 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test23_1.i [2024-10-11 18:05:51,618 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:05:51,618 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 79 error locations. [2024-10-11 18:05:51,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:05:51,662 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;@33209070, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:05:51,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2024-10-11 18:05:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 82 states have (on average 2.1463414634146343) internal successors, (176), 161 states have internal predecessors, (176), 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-11 18:05:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:05:51,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:05:51,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:05:51,672 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 76 more)] === [2024-10-11 18:05:51,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:05:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1540351733, now seen corresponding path program 1 times [2024-10-11 18:05:51,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:05:51,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105132632] [2024-10-11 18:05:51,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:05:51,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:51,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:05:51,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:05:51,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 18:05:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:05:51,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:05:51,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:05:51,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:05:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:05:51,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:05:51,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:05:51,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105132632] [2024-10-11 18:05:51,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105132632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:05:51,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:05:51,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:05:51,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057336821] [2024-10-11 18:05:51,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:05:51,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:05:51,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:05:51,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:05:51,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:05:51,923 INFO L87 Difference]: Start difference. First operand has 176 states, 82 states have (on average 2.1463414634146343) internal successors, (176), 161 states have internal predecessors, (176), 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-11 18:05:52,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:05:52,685 INFO L93 Difference]: Finished difference Result 190 states and 206 transitions. [2024-10-11 18:05:52,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:05:52,689 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-11 18:05:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:05:52,711 INFO L225 Difference]: With dead ends: 190 [2024-10-11 18:05:52,711 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 18:05:52,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:05:52,729 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 8 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:05:52,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 658 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 18:05:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 18:05:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 183. [2024-10-11 18:05:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 88 states have (on average 2.0568181818181817) internal successors, (181), 166 states have internal predecessors, (181), 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-11 18:05:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 200 transitions. [2024-10-11 18:05:52,860 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 200 transitions. Word has length 11 [2024-10-11 18:05:52,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:05:52,861 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 200 transitions. [2024-10-11 18:05:52,861 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-11 18:05:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 200 transitions. [2024-10-11 18:05:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:05:52,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:05:52,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:05:52,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 18:05:53,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:53,066 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 76 more)] === [2024-10-11 18:05:53,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:05:53,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1540351732, now seen corresponding path program 1 times [2024-10-11 18:05:53,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:05:53,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500037204] [2024-10-11 18:05:53,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:05:53,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:53,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:05:53,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:05:53,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 18:05:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:05:53,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:05:53,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:05:53,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:05:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:05:53,270 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:05:53,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:05:53,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500037204] [2024-10-11 18:05:53,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500037204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:05:53,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:05:53,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:05:53,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706618554] [2024-10-11 18:05:53,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:05:53,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:05:53,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:05:53,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:05:53,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:05:53,274 INFO L87 Difference]: Start difference. First operand 183 states and 200 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-11 18:05:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:05:54,016 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2024-10-11 18:05:54,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:05:54,017 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-11 18:05:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:05:54,018 INFO L225 Difference]: With dead ends: 186 [2024-10-11 18:05:54,018 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 18:05:54,018 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-11 18:05:54,019 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 8 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:05:54,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 861 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 18:05:54,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 18:05:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2024-10-11 18:05:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 88 states have (on average 2.034090909090909) internal successors, (179), 166 states have internal predecessors, (179), 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-11 18:05:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2024-10-11 18:05:54,028 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 11 [2024-10-11 18:05:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:05:54,029 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2024-10-11 18:05:54,029 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-11 18:05:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2024-10-11 18:05:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:05:54,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:05:54,030 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:05:54,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 18:05:54,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:54,233 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 76 more)] === [2024-10-11 18:05:54,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:05:54,234 INFO L85 PathProgramCache]: Analyzing trace with hash 202458602, now seen corresponding path program 1 times [2024-10-11 18:05:54,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:05:54,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829753189] [2024-10-11 18:05:54,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:05:54,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-11 18:05:54,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:05:54,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:05:54,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 18:05:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:05:54,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:05:54,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:05:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:05:54,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:05:54,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:05:54,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829753189] [2024-10-11 18:05:54,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829753189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:05:54,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:05:54,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:05:54,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769619859] [2024-10-11 18:05:54,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:05:54,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:05:54,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:05:54,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:05:54,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:05:54,347 INFO L87 Difference]: Start difference. First operand 183 states and 198 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-11 18:05:54,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:05:54,567 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2024-10-11 18:05:54,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:05:54,571 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-11 18:05:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:05:54,573 INFO L225 Difference]: With dead ends: 175 [2024-10-11 18:05:54,573 INFO L226 Difference]: Without dead ends: 175 [2024-10-11 18:05:54,573 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-11 18:05:54,574 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 636 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:05:54,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 636 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:05:54,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-11 18:05:54,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2024-10-11 18:05:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 85 states have (on average 2.023529411764706) internal successors, (172), 159 states have internal predecessors, (172), 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-11 18:05:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 189 transitions. [2024-10-11 18:05:54,586 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 189 transitions. Word has length 11 [2024-10-11 18:05:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:05:54,586 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 189 transitions. [2024-10-11 18:05:54,587 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-11 18:05:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 189 transitions. [2024-10-11 18:05:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:05:54,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:05:54,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:05:54,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 18:05:54,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:54,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:05:54,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:05:54,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1540437524, now seen corresponding path program 1 times [2024-10-11 18:05:54,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:05:54,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936489603] [2024-10-11 18:05:54,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:05:54,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:54,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:05:54,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:05:54,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 18:05:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:05:54,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:05:54,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:05:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:05:54,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:05:54,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:05:54,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936489603] [2024-10-11 18:05:54,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936489603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:05:54,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:05:54,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:05:54,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105837902] [2024-10-11 18:05:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:05:54,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:05:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:05:54,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:05:54,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:05:54,902 INFO L87 Difference]: Start difference. First operand 175 states and 189 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-11 18:05:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:05:55,162 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2024-10-11 18:05:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:05:55,163 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-11 18:05:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:05:55,164 INFO L225 Difference]: With dead ends: 176 [2024-10-11 18:05:55,164 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 18:05:55,164 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-11 18:05:55,165 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 92 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 535 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-11 18:05:55,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 535 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:05:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 18:05:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2024-10-11 18:05:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 85 states have (on average 2.011764705882353) internal successors, (171), 159 states have internal predecessors, (171), 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-11 18:05:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2024-10-11 18:05:55,174 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 11 [2024-10-11 18:05:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:05:55,174 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2024-10-11 18:05:55,175 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-11 18:05:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2024-10-11 18:05:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:05:55,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:05:55,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:05:55,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 18:05:55,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:55,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:05:55,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:05:55,380 INFO L85 PathProgramCache]: Analyzing trace with hash 202372811, now seen corresponding path program 1 times [2024-10-11 18:05:55,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:05:55,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097610563] [2024-10-11 18:05:55,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:05:55,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:55,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:05:55,384 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:05:55,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 18:05:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:05:55,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:05:55,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:05:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:05:55,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:05:55,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:05:55,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097610563] [2024-10-11 18:05:55,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097610563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:05:55,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:05:55,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:05:55,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734865178] [2024-10-11 18:05:55,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:05:55,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:05:55,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:05:55,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:05:55,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:05:55,477 INFO L87 Difference]: Start difference. First operand 175 states and 188 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-11 18:05:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:05:55,696 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2024-10-11 18:05:55,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:05:55,697 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-11 18:05:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:05:55,698 INFO L225 Difference]: With dead ends: 177 [2024-10-11 18:05:55,698 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 18:05:55,698 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-11 18:05:55,699 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 86 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 544 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:05:55,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 544 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:05:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 18:05:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-10-11 18:05:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 87 states have (on average 1.9885057471264367) internal successors, (173), 161 states have internal predecessors, (173), 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-11 18:05:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2024-10-11 18:05:55,707 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 11 [2024-10-11 18:05:55,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:05:55,708 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2024-10-11 18:05:55,708 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-11 18:05:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2024-10-11 18:05:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 18:05:55,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:05:55,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:05:55,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 18:05:55,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:55,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:05:55,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:05:55,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1978609931, now seen corresponding path program 1 times [2024-10-11 18:05:55,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:05:55,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837196745] [2024-10-11 18:05:55,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:05:55,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:55,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:05:55,913 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:05:55,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 18:05:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:05:55,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:05:55,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:05:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:05:56,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:05:56,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:05:56,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837196745] [2024-10-11 18:05:56,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837196745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:05:56,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:05:56,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:05:56,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921618730] [2024-10-11 18:05:56,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:05:56,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:05:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:05:56,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:05:56,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:05:56,029 INFO L87 Difference]: Start difference. First operand 177 states and 190 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-11 18:05:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:05:56,444 INFO L93 Difference]: Finished difference Result 189 states and 204 transitions. [2024-10-11 18:05:56,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:05:56,445 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-11 18:05:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:05:56,446 INFO L225 Difference]: With dead ends: 189 [2024-10-11 18:05:56,446 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 18:05:56,446 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-11 18:05:56,447 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 44 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:05:56,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 302 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:05:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 18:05:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2024-10-11 18:05:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 82 states have (on average 2.0365853658536586) internal successors, (167), 156 states have internal predecessors, (167), 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-11 18:05:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 183 transitions. [2024-10-11 18:05:56,455 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 183 transitions. Word has length 12 [2024-10-11 18:05:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:05:56,455 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 183 transitions. [2024-10-11 18:05:56,456 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-11 18:05:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 183 transitions. [2024-10-11 18:05:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:05:56,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:05:56,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:05:56,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 18:05:56,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:56,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:05:56,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:05:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1187617016, now seen corresponding path program 1 times [2024-10-11 18:05:56,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:05:56,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926479054] [2024-10-11 18:05:56,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:05:56,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:56,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:05:56,662 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:05:56,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 18:05:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:05:56,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 18:05:56,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:05:56,845 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-11 18:05:56,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:05:56,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:05:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:05:56,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:05:56,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:05:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926479054] [2024-10-11 18:05:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926479054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:05:56,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:05:56,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:05:56,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948847702] [2024-10-11 18:05:56,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:05:56,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:05:56,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:05:56,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:05:56,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=19, Unknown=1, NotChecked=8, Total=42 [2024-10-11 18:05:56,959 INFO L87 Difference]: Start difference. First operand 171 states and 183 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-11 18:05:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:05:57,624 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2024-10-11 18:05:57,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:05:57,626 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-11 18:05:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:05:57,628 INFO L225 Difference]: With dead ends: 181 [2024-10-11 18:05:57,628 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 18:05:57,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=27, Unknown=1, NotChecked=10, Total=56 [2024-10-11 18:05:57,629 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 47 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:05:57,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 298 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 373 Invalid, 0 Unknown, 201 Unchecked, 0.6s Time] [2024-10-11 18:05:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 18:05:57,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 170. [2024-10-11 18:05:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 82 states have (on average 2.024390243902439) internal successors, (166), 155 states have internal predecessors, (166), 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-11 18:05:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2024-10-11 18:05:57,637 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 14 [2024-10-11 18:05:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:05:57,637 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions. [2024-10-11 18:05:57,637 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-11 18:05:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2024-10-11 18:05:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:05:57,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:05:57,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:05:57,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 18:05:57,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:57,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:05:57,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:05:57,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1187617017, now seen corresponding path program 1 times [2024-10-11 18:05:57,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:05:57,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35070634] [2024-10-11 18:05:57,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:05:57,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:57,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:05:57,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:05:57,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 18:05:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:05:57,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:05:57,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:05:58,027 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-11 18:05:58,102 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-11 18:05:58,103 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 21 treesize of output 20 [2024-10-11 18:05:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:05:58,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:05:58,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:05:58,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35070634] [2024-10-11 18:05:58,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35070634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:05:58,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:05:58,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:05:58,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909324049] [2024-10-11 18:05:58,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:05:58,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:05:58,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:05:58,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:05:58,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-10-11 18:05:58,191 INFO L87 Difference]: Start difference. First operand 170 states and 182 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:05:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:05:58,783 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2024-10-11 18:05:58,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:05:58,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-10-11 18:05:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:05:58,785 INFO L225 Difference]: With dead ends: 216 [2024-10-11 18:05:58,785 INFO L226 Difference]: Without dead ends: 216 [2024-10-11 18:05:58,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-10-11 18:05:58,786 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 172 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:05:58,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 304 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 325 Invalid, 0 Unknown, 229 Unchecked, 0.5s Time] [2024-10-11 18:05:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-11 18:05:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 178. [2024-10-11 18:05:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 89 states have (on average 2.0) internal successors, (178), 162 states have internal predecessors, (178), 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-11 18:05:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 196 transitions. [2024-10-11 18:05:58,794 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 196 transitions. Word has length 14 [2024-10-11 18:05:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:05:58,794 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 196 transitions. [2024-10-11 18:05:58,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:05:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 196 transitions. [2024-10-11 18:05:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:05:58,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:05:58,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] [2024-10-11 18:05:58,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 18:05:59,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:59,001 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:05:59,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:05:59,002 INFO L85 PathProgramCache]: Analyzing trace with hash -65420643, now seen corresponding path program 1 times [2024-10-11 18:05:59,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:05:59,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854640217] [2024-10-11 18:05:59,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:05:59,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:59,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:05:59,004 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:05:59,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 18:05:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:05:59,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:05:59,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:05:59,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:05:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:05:59,131 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:05:59,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:05:59,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854640217] [2024-10-11 18:05:59,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854640217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:05:59,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:05:59,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:05:59,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261241434] [2024-10-11 18:05:59,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:05:59,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:05:59,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:05:59,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:05:59,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:05:59,134 INFO L87 Difference]: Start difference. First operand 178 states and 196 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-11 18:05:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:05:59,664 INFO L93 Difference]: Finished difference Result 225 states and 252 transitions. [2024-10-11 18:05:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:05:59,665 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-11 18:05:59,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:05:59,666 INFO L225 Difference]: With dead ends: 225 [2024-10-11 18:05:59,666 INFO L226 Difference]: Without dead ends: 225 [2024-10-11 18:05:59,666 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-11 18:05:59,667 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 56 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:05:59,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 405 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:05:59,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-11 18:05:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 198. [2024-10-11 18:05:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 111 states have (on average 2.036036036036036) internal successors, (226), 182 states have internal predecessors, (226), 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-11 18:05:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 244 transitions. [2024-10-11 18:05:59,674 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 244 transitions. Word has length 20 [2024-10-11 18:05:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:05:59,674 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 244 transitions. [2024-10-11 18:05:59,675 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-11 18:05:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2024-10-11 18:05:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:05:59,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:05:59,676 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-11 18:05:59,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 18:05:59,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:59,877 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:05:59,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:05:59,877 INFO L85 PathProgramCache]: Analyzing trace with hash -65420642, now seen corresponding path program 1 times [2024-10-11 18:05:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:05:59,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609933887] [2024-10-11 18:05:59,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:05:59,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:05:59,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:05:59,880 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:05:59,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 18:05:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:05:59,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:05:59,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:05:59,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:06:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:00,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:00,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:00,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609933887] [2024-10-11 18:06:00,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609933887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:00,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:00,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:06:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692751115] [2024-10-11 18:06:00,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:00,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:06:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:00,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:06:00,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:06:00,045 INFO L87 Difference]: Start difference. First operand 198 states and 244 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-11 18:06:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:00,633 INFO L93 Difference]: Finished difference Result 223 states and 250 transitions. [2024-10-11 18:06:00,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:06:00,634 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-11 18:06:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:00,635 INFO L225 Difference]: With dead ends: 223 [2024-10-11 18:06:00,635 INFO L226 Difference]: Without dead ends: 223 [2024-10-11 18:06:00,635 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-11 18:06:00,636 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 53 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:00,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 421 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:06:00,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-11 18:06:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 199. [2024-10-11 18:06:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 113 states have (on average 2.0088495575221237) internal successors, (227), 182 states have internal predecessors, (227), 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-11 18:06:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 248 transitions. [2024-10-11 18:06:00,642 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 248 transitions. Word has length 20 [2024-10-11 18:06:00,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:00,642 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 248 transitions. [2024-10-11 18:06:00,642 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-11 18:06:00,642 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 248 transitions. [2024-10-11 18:06:00,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:06:00,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:00,643 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-11 18:06:00,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:00,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:00,843 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:00,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:00,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1555344517, now seen corresponding path program 1 times [2024-10-11 18:06:00,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:00,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958899023] [2024-10-11 18:06:00,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:00,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:00,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:00,848 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:00,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 18:06:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:00,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:06:00,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:00,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:00,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:00,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958899023] [2024-10-11 18:06:00,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958899023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:00,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:00,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:06:00,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266914894] [2024-10-11 18:06:00,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:00,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:06:00,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:00,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:06:00,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:06:00,963 INFO L87 Difference]: Start difference. First operand 199 states and 248 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-11 18:06:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:01,238 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2024-10-11 18:06:01,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:06:01,239 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-11 18:06:01,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:01,240 INFO L225 Difference]: With dead ends: 199 [2024-10-11 18:06:01,243 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 18:06:01,243 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-11 18:06:01,244 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 70 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 504 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:01,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 504 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:06:01,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 18:06:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-10-11 18:06:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 113 states have (on average 2.0) internal successors, (226), 182 states have internal predecessors, (226), 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-11 18:06:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2024-10-11 18:06:01,262 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 22 [2024-10-11 18:06:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:01,262 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2024-10-11 18:06:01,263 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-11 18:06:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2024-10-11 18:06:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:06:01,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:01,263 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-11 18:06:01,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:01,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:01,465 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:01,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:01,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1203119, now seen corresponding path program 1 times [2024-10-11 18:06:01,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:01,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821162628] [2024-10-11 18:06:01,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:01,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:01,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:01,469 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:01,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 18:06:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:01,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 18:06:01,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:01,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:06:01,676 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:06:01,677 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-11 18:06:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:01,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:01,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:01,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821162628] [2024-10-11 18:06:01,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821162628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:01,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:01,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:06:01,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512350806] [2024-10-11 18:06:01,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:01,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:06:01,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:01,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:06:01,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:06:01,733 INFO L87 Difference]: Start difference. First operand 199 states and 247 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-11 18:06:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:02,438 INFO L93 Difference]: Finished difference Result 210 states and 254 transitions. [2024-10-11 18:06:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:06:02,439 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-11 18:06:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:02,440 INFO L225 Difference]: With dead ends: 210 [2024-10-11 18:06:02,440 INFO L226 Difference]: Without dead ends: 210 [2024-10-11 18:06:02,441 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-11 18:06:02,441 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 113 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:02,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 402 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 18:06:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-11 18:06:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 194. [2024-10-11 18:06:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 113 states have (on average 1.9115044247787611) internal successors, (216), 177 states have internal predecessors, (216), 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-11 18:06:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 237 transitions. [2024-10-11 18:06:02,447 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 237 transitions. Word has length 26 [2024-10-11 18:06:02,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:02,447 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 237 transitions. [2024-10-11 18:06:02,447 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-11 18:06:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 237 transitions. [2024-10-11 18:06:02,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:06:02,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:02,448 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-11 18:06:02,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:02,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:02,649 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:02,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:02,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1203118, now seen corresponding path program 1 times [2024-10-11 18:06:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:02,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92966447] [2024-10-11 18:06:02,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:02,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:02,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:02,653 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:02,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 18:06:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:02,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 18:06:02,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:02,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:06:02,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:06:02,898 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-11 18:06:02,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:02,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:06:02,936 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:06:02,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 18:06:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:03,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:03,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92966447] [2024-10-11 18:06:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92966447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:03,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:06:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301960108] [2024-10-11 18:06:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:06:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:03,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:06:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-10-11 18:06:03,011 INFO L87 Difference]: Start difference. First operand 194 states and 237 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-11 18:06:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:03,924 INFO L93 Difference]: Finished difference Result 240 states and 268 transitions. [2024-10-11 18:06:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:06:03,925 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-11 18:06:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:03,926 INFO L225 Difference]: With dead ends: 240 [2024-10-11 18:06:03,926 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 18:06:03,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2024-10-11 18:06:03,927 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 113 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:03,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 330 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 504 Invalid, 0 Unknown, 270 Unchecked, 0.9s Time] [2024-10-11 18:06:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 18:06:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 194. [2024-10-11 18:06:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 113 states have (on average 1.8672566371681416) internal successors, (211), 177 states have internal predecessors, (211), 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-11 18:06:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 232 transitions. [2024-10-11 18:06:03,933 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 232 transitions. Word has length 26 [2024-10-11 18:06:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:03,934 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 232 transitions. [2024-10-11 18:06:03,934 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-11 18:06:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 232 transitions. [2024-10-11 18:06:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:06:03,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:03,935 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:03,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:04,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:04,135 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:04,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:04,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1483598988, now seen corresponding path program 1 times [2024-10-11 18:06:04,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:04,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20207273] [2024-10-11 18:06:04,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:04,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:04,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:04,140 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:04,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 18:06:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:04,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:06:04,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:04,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:04,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:04,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20207273] [2024-10-11 18:06:04,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20207273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:04,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:04,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:06:04,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607147580] [2024-10-11 18:06:04,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:04,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:06:04,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:04,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:06:04,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:06:04,689 INFO L87 Difference]: Start difference. First operand 194 states and 232 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-11 18:06:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:05,417 INFO L93 Difference]: Finished difference Result 192 states and 229 transitions. [2024-10-11 18:06:05,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:06:05,418 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-11 18:06:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:05,419 INFO L225 Difference]: With dead ends: 192 [2024-10-11 18:06:05,419 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 18:06:05,420 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-11 18:06:05,420 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 323 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:05,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 413 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 18:06:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 18:06:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-10-11 18:06:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 113 states have (on average 1.8407079646017699) internal successors, (208), 175 states have internal predecessors, (208), 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-11 18:06:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 229 transitions. [2024-10-11 18:06:05,426 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 229 transitions. Word has length 29 [2024-10-11 18:06:05,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:05,427 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 229 transitions. [2024-10-11 18:06:05,427 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-11 18:06:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 229 transitions. [2024-10-11 18:06:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:06:05,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:05,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:05,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:05,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:05,632 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:05,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:05,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1483599176, now seen corresponding path program 1 times [2024-10-11 18:06:05,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:05,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502236686] [2024-10-11 18:06:05,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:05,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:05,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:05,635 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:05,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 18:06:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:05,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:06:05,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:05,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:05,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:05,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502236686] [2024-10-11 18:06:05,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502236686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:05,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:05,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:06:05,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64627269] [2024-10-11 18:06:05,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:05,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:06:05,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:05,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:06:05,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:06:05,786 INFO L87 Difference]: Start difference. First operand 192 states and 229 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-11 18:06:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:05,999 INFO L93 Difference]: Finished difference Result 196 states and 233 transitions. [2024-10-11 18:06:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:06:06,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 29 [2024-10-11 18:06:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:06,002 INFO L225 Difference]: With dead ends: 196 [2024-10-11 18:06:06,002 INFO L226 Difference]: Without dead ends: 196 [2024-10-11 18:06:06,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:06:06,002 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 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-11 18:06:06,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:06:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-11 18:06:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-10-11 18:06:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 117 states have (on average 1.811965811965812) internal successors, (212), 179 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-11 18:06:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2024-10-11 18:06:06,009 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 29 [2024-10-11 18:06:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:06,009 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2024-10-11 18:06:06,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-11 18:06:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2024-10-11 18:06:06,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:06:06,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:06,010 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-11 18:06:06,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-11 18:06:06,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:06,211 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:06,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:06,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1277713344, now seen corresponding path program 1 times [2024-10-11 18:06:06,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:06,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453349829] [2024-10-11 18:06:06,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:06,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:06,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:06,217 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:06,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 18:06:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:06,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:06:06,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:06,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:06,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:06,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:06,558 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:06:06,558 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:06:06,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-11 18:06:06,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 21 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 40 [2024-10-11 18:06:06,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 21 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 60 [2024-10-11 18:06:08,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:06:08,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 98 treesize of output 76 [2024-10-11 18:06:10,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:06:10,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 92 treesize of output 34 [2024-10-11 18:06:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:10,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:10,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:10,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453349829] [2024-10-11 18:06:10,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453349829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:10,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:10,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:06:10,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651970020] [2024-10-11 18:06:10,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:10,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:06:10,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:10,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:06:10,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=25, Unknown=2, NotChecked=0, Total=42 [2024-10-11 18:06:10,295 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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-11 18:06:14,398 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-11 18:06:18,402 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-11 18:06:21,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:06:25,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:06:30,324 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-11 18:06:34,328 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-11 18:06:36,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:06:37,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:06:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:37,941 INFO L93 Difference]: Finished difference Result 203 states and 240 transitions. [2024-10-11 18:06:37,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:06:37,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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-11 18:06:37,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:37,943 INFO L225 Difference]: With dead ends: 203 [2024-10-11 18:06:37,943 INFO L226 Difference]: Without dead ends: 203 [2024-10-11 18:06:37,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=19, Invalid=35, Unknown=2, NotChecked=0, Total=56 [2024-10-11 18:06:37,943 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 51 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:37,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 635 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 8 Unknown, 0 Unchecked, 27.6s Time] [2024-10-11 18:06:37,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-11 18:06:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 195. [2024-10-11 18:06:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 117 states have (on average 1.794871794871795) internal successors, (210), 178 states have internal predecessors, (210), 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-11 18:06:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2024-10-11 18:06:37,948 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 33 [2024-10-11 18:06:37,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:37,948 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2024-10-11 18:06:37,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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-11 18:06:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2024-10-11 18:06:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:06:37,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:37,949 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-11 18:06:37,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:38,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:38,150 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:38,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:38,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1591065722, now seen corresponding path program 1 times [2024-10-11 18:06:38,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:38,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038625088] [2024-10-11 18:06:38,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:38,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:38,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:38,154 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:38,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 18:06:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:38,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:06:38,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:38,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:38,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:38,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038625088] [2024-10-11 18:06:38,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038625088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:38,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:38,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:06:38,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717479798] [2024-10-11 18:06:38,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:38,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:06:38,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:38,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:06:38,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:06:38,266 INFO L87 Difference]: Start difference. First operand 195 states and 231 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-11 18:06:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:38,407 INFO L93 Difference]: Finished difference Result 197 states and 233 transitions. [2024-10-11 18:06:38,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:06:38,408 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-11 18:06:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:38,409 INFO L225 Difference]: With dead ends: 197 [2024-10-11 18:06:38,409 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 18:06:38,409 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-11 18:06:38,409 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:38,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:06:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 18:06:38,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-10-11 18:06:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 119 states have (on average 1.781512605042017) internal successors, (212), 180 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-11 18:06:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 233 transitions. [2024-10-11 18:06:38,416 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 233 transitions. Word has length 33 [2024-10-11 18:06:38,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:38,416 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 233 transitions. [2024-10-11 18:06:38,416 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-11 18:06:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 233 transitions. [2024-10-11 18:06:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:06:38,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:38,417 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-11 18:06:38,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:38,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:38,618 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:38,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:38,619 INFO L85 PathProgramCache]: Analyzing trace with hash 954408191, now seen corresponding path program 1 times [2024-10-11 18:06:38,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:38,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780094602] [2024-10-11 18:06:38,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:38,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:38,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:38,622 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:38,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-11 18:06:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:38,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 18:06:38,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:38,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:06:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:38,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:38,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:38,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780094602] [2024-10-11 18:06:38,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780094602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:38,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:38,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:06:38,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565717758] [2024-10-11 18:06:38,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:38,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:06:38,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:38,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:06:38,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:06:38,868 INFO L87 Difference]: Start difference. First operand 197 states and 233 transitions. Second operand has 6 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-11 18:06:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:39,382 INFO L93 Difference]: Finished difference Result 208 states and 233 transitions. [2024-10-11 18:06:39,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:06:39,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 34 [2024-10-11 18:06:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:39,383 INFO L225 Difference]: With dead ends: 208 [2024-10-11 18:06:39,383 INFO L226 Difference]: Without dead ends: 208 [2024-10-11 18:06:39,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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-11 18:06:39,384 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 28 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:39,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 484 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:06:39,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-11 18:06:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 197. [2024-10-11 18:06:39,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 180 states have internal predecessors, (210), 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-11 18:06:39,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 231 transitions. [2024-10-11 18:06:39,388 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 231 transitions. Word has length 34 [2024-10-11 18:06:39,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:39,388 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 231 transitions. [2024-10-11 18:06:39,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-11 18:06:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 231 transitions. [2024-10-11 18:06:39,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:06:39,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:39,389 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-11 18:06:39,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:39,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:39,594 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:39,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:39,595 INFO L85 PathProgramCache]: Analyzing trace with hash 954408190, now seen corresponding path program 1 times [2024-10-11 18:06:39,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:39,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436970996] [2024-10-11 18:06:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:39,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:39,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:39,598 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:39,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-11 18:06:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:39,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:06:39,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:39,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:06:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:39,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:39,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:39,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436970996] [2024-10-11 18:06:39,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436970996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:39,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:39,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:06:39,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508084335] [2024-10-11 18:06:39,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:39,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:06:39,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:39,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:06:39,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:06:39,802 INFO L87 Difference]: Start difference. First operand 197 states and 231 transitions. Second operand has 6 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-11 18:06:40,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:40,198 INFO L93 Difference]: Finished difference Result 205 states and 230 transitions. [2024-10-11 18:06:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:06:40,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 34 [2024-10-11 18:06:40,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:40,199 INFO L225 Difference]: With dead ends: 205 [2024-10-11 18:06:40,199 INFO L226 Difference]: Without dead ends: 205 [2024-10-11 18:06:40,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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-11 18:06:40,200 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 28 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:40,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 485 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:06:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-11 18:06:40,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 196. [2024-10-11 18:06:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 119 states have (on average 1.7394957983193278) internal successors, (207), 179 states have internal predecessors, (207), 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-11 18:06:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 228 transitions. [2024-10-11 18:06:40,204 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 228 transitions. Word has length 34 [2024-10-11 18:06:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:40,204 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 228 transitions. [2024-10-11 18:06:40,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-11 18:06:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 228 transitions. [2024-10-11 18:06:40,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:06:40,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:40,205 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-11 18:06:40,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:40,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:40,410 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:40,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash -5727058, now seen corresponding path program 1 times [2024-10-11 18:06:40,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:40,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142519879] [2024-10-11 18:06:40,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:40,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:40,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:40,414 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:40,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-11 18:06:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:40,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 18:06:40,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:40,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:40,679 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-11 18:06:40,696 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-10-11 18:06:40,696 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-11 18:06:40,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:40,922 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-11 18:06:40,994 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:06:40,994 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-11 18:06:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:41,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:41,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:41,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142519879] [2024-10-11 18:06:41,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142519879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:41,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:41,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:06:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017463461] [2024-10-11 18:06:41,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:41,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:06:41,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:41,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:06:41,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:06:41,146 INFO L87 Difference]: Start difference. First operand 196 states and 228 transitions. Second operand has 11 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-11 18:06:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:43,018 INFO L93 Difference]: Finished difference Result 232 states and 261 transitions. [2024-10-11 18:06:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:06:43,019 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 35 [2024-10-11 18:06:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:43,020 INFO L225 Difference]: With dead ends: 232 [2024-10-11 18:06:43,020 INFO L226 Difference]: Without dead ends: 232 [2024-10-11 18:06:43,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:06:43,021 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 371 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:43,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 275 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 18:06:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-11 18:06:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2024-10-11 18:06:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 119 states have (on average 1.7226890756302522) internal successors, (205), 177 states have internal predecessors, (205), 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-11 18:06:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2024-10-11 18:06:43,025 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 35 [2024-10-11 18:06:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:43,025 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2024-10-11 18:06:43,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-11 18:06:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2024-10-11 18:06:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:06:43,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:43,026 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-11 18:06:43,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:43,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:43,226 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:43,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:43,227 INFO L85 PathProgramCache]: Analyzing trace with hash -5727059, now seen corresponding path program 1 times [2024-10-11 18:06:43,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:43,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042654996] [2024-10-11 18:06:43,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:43,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:43,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:43,229 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:43,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-11 18:06:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:43,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 18:06:43,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:43,600 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-10-11 18:06:43,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-10-11 18:06:43,925 INFO L349 Elim1Store]: treesize reduction 28, result has 45.1 percent of original size [2024-10-11 18:06:43,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 33 [2024-10-11 18:06:44,452 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-10-11 18:06:44,455 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 4 case distinctions, treesize of input 28 treesize of output 36 [2024-10-11 18:06:45,141 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-11 18:06:45,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:45,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:45,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2024-10-11 18:06:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:45,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:45,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:45,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042654996] [2024-10-11 18:06:45,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042654996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:45,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:45,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 18:06:45,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243673192] [2024-10-11 18:06:45,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:45,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 18:06:45,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:45,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 18:06:45,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:06:45,237 INFO L87 Difference]: Start difference. First operand 194 states and 226 transitions. Second operand has 15 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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-11 18:06:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:48,151 INFO L93 Difference]: Finished difference Result 279 states and 310 transitions. [2024-10-11 18:06:48,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:06:48,151 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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 35 [2024-10-11 18:06:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:48,152 INFO L225 Difference]: With dead ends: 279 [2024-10-11 18:06:48,153 INFO L226 Difference]: Without dead ends: 279 [2024-10-11 18:06:48,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:06:48,154 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:48,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 703 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 18:06:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-10-11 18:06:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 212. [2024-10-11 18:06:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 135 states have (on average 1.7037037037037037) internal successors, (230), 191 states have internal predecessors, (230), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-11 18:06:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 254 transitions. [2024-10-11 18:06:48,158 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 254 transitions. Word has length 35 [2024-10-11 18:06:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:48,159 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 254 transitions. [2024-10-11 18:06:48,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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-11 18:06:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 254 transitions. [2024-10-11 18:06:48,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:06:48,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:48,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:48,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-11 18:06:48,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:48,360 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:48,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1936721505, now seen corresponding path program 1 times [2024-10-11 18:06:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:48,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038797377] [2024-10-11 18:06:48,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:48,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:48,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:48,362 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:48,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-11 18:06:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:48,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 18:06:48,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:48,787 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-10-11 18:06:48,787 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-11 18:06:49,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:49,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:49,042 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-11 18:06:49,113 INFO L349 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2024-10-11 18:06:49,114 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-11 18:06:49,215 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-11 18:06:49,300 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-11 18:06:49,494 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-11 18:06:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:49,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:49,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:49,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038797377] [2024-10-11 18:06:49,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038797377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:49,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:49,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 18:06:49,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3146932] [2024-10-11 18:06:49,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:49,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 18:06:49,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:49,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 18:06:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:06:49,587 INFO L87 Difference]: Start difference. First operand 212 states and 254 transitions. Second operand has 15 states, 11 states have (on average 2.727272727272727) internal successors, (30), 13 states have internal predecessors, (30), 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-11 18:06:52,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:52,406 INFO L93 Difference]: Finished difference Result 287 states and 332 transitions. [2024-10-11 18:06:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:06:52,409 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.727272727272727) internal successors, (30), 13 states have internal predecessors, (30), 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 36 [2024-10-11 18:06:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:52,410 INFO L225 Difference]: With dead ends: 287 [2024-10-11 18:06:52,410 INFO L226 Difference]: Without dead ends: 287 [2024-10-11 18:06:52,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2024-10-11 18:06:52,411 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 435 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:52,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 788 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1401 Invalid, 2 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 18:06:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-11 18:06:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 230. [2024-10-11 18:06:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 154 states have (on average 1.7077922077922079) internal successors, (263), 208 states have internal predecessors, (263), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-11 18:06:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 289 transitions. [2024-10-11 18:06:52,420 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 289 transitions. Word has length 36 [2024-10-11 18:06:52,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:52,420 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 289 transitions. [2024-10-11 18:06:52,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.727272727272727) internal successors, (30), 13 states have internal predecessors, (30), 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-11 18:06:52,420 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 289 transitions. [2024-10-11 18:06:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:06:52,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:52,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:52,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:52,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:52,622 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:52,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:52,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1936721504, now seen corresponding path program 1 times [2024-10-11 18:06:52,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:52,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492903493] [2024-10-11 18:06:52,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:52,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:52,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:52,625 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:52,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-11 18:06:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:53,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 18:06:53,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:53,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:53,214 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-11 18:06:53,233 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-10-11 18:06:53,233 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-11 18:06:53,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:53,392 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-11 18:06:53,458 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:06:53,459 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-11 18:06:53,546 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-11 18:06:53,550 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-11 18:06:53,601 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-11 18:06:53,606 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-11 18:06:53,726 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-11 18:06:53,729 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-11 18:06:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:53,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:53,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:53,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492903493] [2024-10-11 18:06:53,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492903493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:53,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:53,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 18:06:53,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047468983] [2024-10-11 18:06:53,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:53,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:06:53,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:53,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:06:53,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:06:53,804 INFO L87 Difference]: Start difference. First operand 230 states and 289 transitions. Second operand has 16 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 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-11 18:06:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:56,725 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2024-10-11 18:06:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:06:56,726 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 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 36 [2024-10-11 18:06:56,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:56,727 INFO L225 Difference]: With dead ends: 255 [2024-10-11 18:06:56,727 INFO L226 Difference]: Without dead ends: 255 [2024-10-11 18:06:56,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2024-10-11 18:06:56,728 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 427 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:56,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 576 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 18:06:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-11 18:06:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 229. [2024-10-11 18:06:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 154 states have (on average 1.6818181818181819) internal successors, (259), 207 states have internal predecessors, (259), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-11 18:06:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 285 transitions. [2024-10-11 18:06:56,732 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 285 transitions. Word has length 36 [2024-10-11 18:06:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:56,732 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 285 transitions. [2024-10-11 18:06:56,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 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-11 18:06:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 285 transitions. [2024-10-11 18:06:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:06:56,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:56,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:56,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-10-11 18:06:56,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:56,938 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:56,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:56,938 INFO L85 PathProgramCache]: Analyzing trace with hash -177518712, now seen corresponding path program 1 times [2024-10-11 18:06:56,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:56,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213175671] [2024-10-11 18:06:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:56,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:56,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:56,942 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:56,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-11 18:06:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:57,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:06:57,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:57,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:57,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213175671] [2024-10-11 18:06:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213175671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:57,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:57,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:06:57,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288719754] [2024-10-11 18:06:57,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:57,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:06:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:57,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:06:57,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:06:57,076 INFO L87 Difference]: Start difference. First operand 229 states and 285 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-11 18:06:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:57,215 INFO L93 Difference]: Finished difference Result 231 states and 286 transitions. [2024-10-11 18:06:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:06:57,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 36 [2024-10-11 18:06:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:57,216 INFO L225 Difference]: With dead ends: 231 [2024-10-11 18:06:57,216 INFO L226 Difference]: Without dead ends: 231 [2024-10-11 18:06:57,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:06:57,217 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 404 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:57,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 404 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:06:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-11 18:06:57,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2024-10-11 18:06:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 156 states have (on average 1.6666666666666667) internal successors, (260), 209 states have internal predecessors, (260), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-11 18:06:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2024-10-11 18:06:57,221 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 36 [2024-10-11 18:06:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:57,221 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2024-10-11 18:06:57,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-11 18:06:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2024-10-11 18:06:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:06:57,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:57,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:57,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:57,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:57,423 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:06:57,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1184129916, now seen corresponding path program 1 times [2024-10-11 18:06:57,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:57,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245139358] [2024-10-11 18:06:57,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:57,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:57,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:57,427 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:06:57,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-11 18:06:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:57,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 18:06:57,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:57,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:06:57,762 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-10-11 18:06:57,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 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-11 18:06:57,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:06:57,818 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-11 18:06:57,818 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 19 treesize of output 11 [2024-10-11 18:06:57,939 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-10-11 18:06:57,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 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-11 18:06:58,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 33 [2024-10-11 18:06:58,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 33 [2024-10-11 18:06:58,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:58,594 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-11 18:06:58,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2024-10-11 18:06:58,647 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-11 18:06:58,958 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 43 treesize of output 23 [2024-10-11 18:06:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:59,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:59,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:59,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245139358] [2024-10-11 18:06:59,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245139358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:59,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:59,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 18:06:59,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658061819] [2024-10-11 18:06:59,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:59,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 18:06:59,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:59,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 18:06:59,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:06:59,232 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand has 18 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:05,359 INFO L93 Difference]: Finished difference Result 327 states and 376 transitions. [2024-10-11 18:07:05,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 18:07:05,360 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2024-10-11 18:07:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:05,361 INFO L225 Difference]: With dead ends: 327 [2024-10-11 18:07:05,361 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 18:07:05,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2024-10-11 18:07:05,362 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 527 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:05,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1025 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 18:07:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 18:07:05,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 258. [2024-10-11 18:07:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 178 states have (on average 1.6404494382022472) internal successors, (292), 233 states have internal predecessors, (292), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-10-11 18:07:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 324 transitions. [2024-10-11 18:07:05,386 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 324 transitions. Word has length 38 [2024-10-11 18:07:05,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:05,386 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 324 transitions. [2024-10-11 18:07:05,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 324 transitions. [2024-10-11 18:07:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:07:05,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:05,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:05,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-10-11 18:07:05,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:07:05,590 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-10-11 18:07:05,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:05,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1184129917, now seen corresponding path program 1 times [2024-10-11 18:07:05,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:07:05,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284061802] [2024-10-11 18:07:05,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:05,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:07:05,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:07:05,593 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:07:05,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-11 18:07:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:05,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-11 18:07:05,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:05,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:07:05,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:07:06,036 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-11 18:07:06,041 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-11 18:07:06,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:06,047 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-11 18:07:06,086 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-10-11 18:07:06,086 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-11 18:07:06,154 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-11 18:07:06,154 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 19 treesize of output 11 [2024-10-11 18:07:06,158 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 9 treesize of output 3 [2024-10-11 18:07:06,362 INFO L349 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2024-10-11 18:07:06,362 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-11 18:07:06,375 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 16 treesize of output 18 [2024-10-11 18:07:06,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:07:06,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 19 [2024-10-11 18:07:06,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:07:06,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 19 [2024-10-11 18:07:15,220 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 25 treesize of output 13 [2024-10-11 18:07:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:15,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:07:15,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:07:15,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284061802] [2024-10-11 18:07:15,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284061802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:15,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:15,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 18:07:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50995353] [2024-10-11 18:07:15,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:15,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:07:15,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:07:15,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:07:15,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=288, Unknown=2, NotChecked=0, Total=342 [2024-10-11 18:07:15,456 INFO L87 Difference]: Start difference. First operand 258 states and 324 transitions. Second operand has 19 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:21,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]