./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:30:49,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:30:49,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:30:49,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:30:49,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:30:49,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:30:49,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:30:49,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:30:49,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:30:49,158 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:30:49,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:30:49,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:30:49,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:30:49,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:30:49,160 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:30:49,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:30:49,160 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:30:49,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:30:49,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:30:49,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:30:49,161 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:30:49,161 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:30:49,161 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:30:49,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:30:49,161 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:30:49,161 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:30:49,161 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:30:49,161 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:30:49,161 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:30:49,161 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:30:49,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:30:49,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:30:49,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:30:49,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:30:49,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:30:49,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:30:49,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:30:49,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:30:49,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:30:49,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:30:49,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:30:49,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:30:49,163 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2025-03-09 00:30:49,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:30:49,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:30:49,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:30:49,473 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:30:49,473 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:30:49,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i [2025-03-09 00:30:50,623 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fae315fd/4f931d14fa194fd48045facb2da14835/FLAGbe740dfd8 [2025-03-09 00:30:50,944 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:30:50,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i [2025-03-09 00:30:50,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fae315fd/4f931d14fa194fd48045facb2da14835/FLAGbe740dfd8 [2025-03-09 00:30:50,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fae315fd/4f931d14fa194fd48045facb2da14835 [2025-03-09 00:30:50,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:30:50,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:30:50,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:30:50,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:30:50,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:30:50,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:30:50" (1/1) ... [2025-03-09 00:30:50,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23383db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:50, skipping insertion in model container [2025-03-09 00:30:50,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:30:50" (1/1) ... [2025-03-09 00:30:51,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:30:51,251 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:51,283 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:51,286 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:51,289 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:51,292 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:51,300 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:51,301 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:51,302 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:51,304 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:51,304 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:51,305 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:51,307 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:51,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:30:51,324 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) [2025-03-09 00:30:51,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5188c411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:51, skipping insertion in model container [2025-03-09 00:30:51,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:30:51,325 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-09 00:30:51,326 INFO L158 Benchmark]: Toolchain (without parser) took 343.67ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 114.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 00:30:51,326 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:30:51,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.54ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 114.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 00:30:51,327 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.24ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.54ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 114.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 753]: 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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:30:53,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:30:53,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-09 00:30:53,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:30:53,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:30:53,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:30:53,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:30:53,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:30:53,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:30:53,230 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:30:53,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:30:53,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:30:53,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:30:53,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:30:53,230 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:30:53,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:30:53,231 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:30:53,232 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:30:53,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:30:53,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:30:53,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:30:53,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:30:53,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:30:53,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:30:53,232 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 00:30:53,232 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 00:30:53,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:30:53,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:30:53,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:30:53,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:30:53,232 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2025-03-09 00:30:53,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:30:53,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:30:53,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:30:53,478 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:30:53,478 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:30:53,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i [2025-03-09 00:30:54,624 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48592eaa/29b27a7d22a849d4ac593a32b5418690/FLAG8e5d3d1d0 [2025-03-09 00:30:54,859 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:30:54,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i [2025-03-09 00:30:54,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48592eaa/29b27a7d22a849d4ac593a32b5418690/FLAG8e5d3d1d0 [2025-03-09 00:30:55,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48592eaa/29b27a7d22a849d4ac593a32b5418690 [2025-03-09 00:30:55,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:30:55,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:30:55,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:30:55,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:30:55,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:30:55,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ccb789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55, skipping insertion in model container [2025-03-09 00:30:55,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:30:55,534 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,564 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,567 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,572 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,579 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,594 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,595 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,598 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,599 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,601 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,601 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,605 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:30:55,624 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-09 00:30:55,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:30:55,670 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,691 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,696 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,698 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,704 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,712 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,716 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,717 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,718 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,718 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,718 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,721 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:55,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:30:55,726 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:30:55,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:30:55,831 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:30:55,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55 WrapperNode [2025-03-09 00:30:55,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:30:55,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:30:55,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:30:55,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:30:55,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,894 INFO L138 Inliner]: procedures = 179, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 729 [2025-03-09 00:30:55,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:30:55,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:30:55,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:30:55,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:30:55,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,959 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2025-03-09 00:30:55,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,978 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:30:55,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:30:55,992 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:30:55,992 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:30:55,993 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55" (1/1) ... [2025-03-09 00:30:55,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:30:56,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:30:56,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:30:56,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:30:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-09 00:30:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-09 00:30:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-09 00:30:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-09 00:30:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 00:30:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 00:30:56,042 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 00:30:56,042 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 00:30:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:30:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:30:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:30:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:30:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:30:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:30:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:30:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-09 00:30:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-09 00:30:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 00:30:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-09 00:30:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:30:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:30:56,220 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:30:56,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:30:58,266 INFO L? ?]: Removed 893 outVars from TransFormulas that were not future-live. [2025-03-09 00:30:58,266 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:30:58,296 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:30:58,300 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:30:58,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:30:58 BoogieIcfgContainer [2025-03-09 00:30:58,300 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:30:58,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:30:58,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:30:58,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:30:58,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:30:55" (1/3) ... [2025-03-09 00:30:58,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2371930f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:30:58, skipping insertion in model container [2025-03-09 00:30:58,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:55" (2/3) ... [2025-03-09 00:30:58,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2371930f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:30:58, skipping insertion in model container [2025-03-09 00:30:58,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:30:58" (3/3) ... [2025-03-09 00:30:58,307 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test1-2.i [2025-03-09 00:30:58,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:30:58,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test1-2.i that has 3 procedures, 835 locations, 1 initial locations, 24 loop locations, and 425 error locations. [2025-03-09 00:30:58,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:30:58,369 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;@792d19fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:30:58,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2025-03-09 00:30:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 830 states, 403 states have (on average 2.240694789081886) internal successors, (903), 825 states have internal predecessors, (903), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:30:58,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:58,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:30:58,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:30:58,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:58,383 INFO L85 PathProgramCache]: Analyzing trace with hash 896360503, now seen corresponding path program 1 times [2025-03-09 00:30:58,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:30:58,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [250194742] [2025-03-09 00:30:58,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:58,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:58,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:30:58,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:30:58,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:30:58,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:30:58,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:30:58,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:58,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:58,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:30:58,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:30:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:58,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:30:58,570 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:30:58,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250194742] [2025-03-09 00:30:58,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250194742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:58,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:58,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:30:58,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120289652] [2025-03-09 00:30:58,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:58,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:30:58,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:30:58,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:30:58,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:30:58,615 INFO L87 Difference]: Start difference. First operand has 830 states, 403 states have (on average 2.240694789081886) internal successors, (903), 825 states have internal predecessors, (903), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:59,216 INFO L93 Difference]: Finished difference Result 1138 states and 1219 transitions. [2025-03-09 00:30:59,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:30:59,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 00:30:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:59,226 INFO L225 Difference]: With dead ends: 1138 [2025-03-09 00:30:59,226 INFO L226 Difference]: Without dead ends: 1136 [2025-03-09 00:30:59,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:30:59,229 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 339 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 2464 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:59,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 2464 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:30:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-03-09 00:30:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 906. [2025-03-09 00:30:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 485 states have (on average 2.082474226804124) internal successors, (1010), 901 states have internal predecessors, (1010), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1016 transitions. [2025-03-09 00:30:59,304 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1016 transitions. Word has length 5 [2025-03-09 00:30:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:59,304 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1016 transitions. [2025-03-09 00:30:59,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1016 transitions. [2025-03-09 00:30:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:30:59,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:59,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:30:59,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:30:59,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:59,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr423REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:30:59,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:59,510 INFO L85 PathProgramCache]: Analyzing trace with hash 897014889, now seen corresponding path program 1 times [2025-03-09 00:30:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:30:59,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168019459] [2025-03-09 00:30:59,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:59,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:59,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:30:59,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:30:59,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:30:59,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:30:59,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:30:59,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:59,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:59,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:30:59,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:30:59,614 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 [2025-03-09 00:30:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:59,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:30:59,624 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:30:59,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168019459] [2025-03-09 00:30:59,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168019459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:59,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:59,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:30:59,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887636488] [2025-03-09 00:30:59,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:59,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:30:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:30:59,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:30:59,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:59,627 INFO L87 Difference]: Start difference. First operand 906 states and 1016 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:00,495 INFO L93 Difference]: Finished difference Result 857 states and 961 transitions. [2025-03-09 00:31:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:31:00,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 00:31:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:00,498 INFO L225 Difference]: With dead ends: 857 [2025-03-09 00:31:00,498 INFO L226 Difference]: Without dead ends: 857 [2025-03-09 00:31:00,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:31:00,499 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 512 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:00,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 608 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 00:31:00,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-03-09 00:31:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2025-03-09 00:31:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 485 states have (on average 1.9690721649484537) internal successors, (955), 852 states have internal predecessors, (955), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 961 transitions. [2025-03-09 00:31:00,514 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 961 transitions. Word has length 5 [2025-03-09 00:31:00,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:00,514 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 961 transitions. [2025-03-09 00:31:00,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 961 transitions. [2025-03-09 00:31:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:31:00,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:00,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:31:00,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 00:31:00,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:00,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr424REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:00,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:00,716 INFO L85 PathProgramCache]: Analyzing trace with hash 897014890, now seen corresponding path program 1 times [2025-03-09 00:31:00,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:00,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1985599724] [2025-03-09 00:31:00,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:00,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:00,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:00,720 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:00,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:31:00,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:31:00,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:31:00,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:00,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:00,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:31:00,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:00,830 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 [2025-03-09 00:31:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:00,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:31:00,843 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:00,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985599724] [2025-03-09 00:31:00,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985599724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:00,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:00,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:31:00,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541680192] [2025-03-09 00:31:00,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:00,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:31:00,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:00,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:31:00,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:31:00,845 INFO L87 Difference]: Start difference. First operand 857 states and 961 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:01,948 INFO L93 Difference]: Finished difference Result 930 states and 1032 transitions. [2025-03-09 00:31:01,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:31:01,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 00:31:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:01,951 INFO L225 Difference]: With dead ends: 930 [2025-03-09 00:31:01,951 INFO L226 Difference]: Without dead ends: 930 [2025-03-09 00:31:01,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:31:01,954 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 264 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:01,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1039 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:31:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-09 00:31:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 883. [2025-03-09 00:31:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 522 states have (on average 1.9386973180076628) internal successors, (1012), 878 states have internal predecessors, (1012), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1018 transitions. [2025-03-09 00:31:01,974 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1018 transitions. Word has length 5 [2025-03-09 00:31:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:01,974 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1018 transitions. [2025-03-09 00:31:01,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:01,975 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1018 transitions. [2025-03-09 00:31:01,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 00:31:01,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:01,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:01,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:31:02,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:02,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:02,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1886252331, now seen corresponding path program 1 times [2025-03-09 00:31:02,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:02,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611322324] [2025-03-09 00:31:02,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:02,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:02,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:02,180 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:02,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:31:02,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 00:31:02,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 00:31:02,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:02,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:02,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:31:02,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:02,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:31:02,266 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:02,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611322324] [2025-03-09 00:31:02,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611322324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:02,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:02,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:31:02,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478649840] [2025-03-09 00:31:02,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:02,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:31:02,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:02,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:31:02,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:31:02,268 INFO L87 Difference]: Start difference. First operand 883 states and 1018 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:02,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:02,295 INFO L93 Difference]: Finished difference Result 883 states and 1017 transitions. [2025-03-09 00:31:02,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:31:02,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 00:31:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:02,298 INFO L225 Difference]: With dead ends: 883 [2025-03-09 00:31:02,299 INFO L226 Difference]: Without dead ends: 883 [2025-03-09 00:31:02,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:31:02,299 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 7 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:02,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2375 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:31:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-09 00:31:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-03-09 00:31:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 522 states have (on average 1.9367816091954022) internal successors, (1011), 878 states have internal predecessors, (1011), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1017 transitions. [2025-03-09 00:31:02,316 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1017 transitions. Word has length 7 [2025-03-09 00:31:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:02,316 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1017 transitions. [2025-03-09 00:31:02,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1017 transitions. [2025-03-09 00:31:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 00:31:02,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:02,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:02,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:31:02,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:02,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:02,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2032986312, now seen corresponding path program 1 times [2025-03-09 00:31:02,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:02,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [420778626] [2025-03-09 00:31:02,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:02,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:02,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:02,521 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:02,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:31:02,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:31:02,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:31:02,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:02,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:02,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 00:31:02,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:02,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:31:02,601 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:02,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420778626] [2025-03-09 00:31:02,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420778626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:02,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:02,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:31:02,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665816691] [2025-03-09 00:31:02,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:02,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:31:02,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:02,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:31:02,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:31:02,602 INFO L87 Difference]: Start difference. First operand 883 states and 1017 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:03,196 INFO L93 Difference]: Finished difference Result 884 states and 1017 transitions. [2025-03-09 00:31:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:31:03,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-09 00:31:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:03,199 INFO L225 Difference]: With dead ends: 884 [2025-03-09 00:31:03,199 INFO L226 Difference]: Without dead ends: 877 [2025-03-09 00:31:03,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:31:03,200 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:03,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1221 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 00:31:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-09 00:31:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2025-03-09 00:31:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 516 states have (on average 1.945736434108527) internal successors, (1004), 872 states have internal predecessors, (1004), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1010 transitions. [2025-03-09 00:31:03,222 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1010 transitions. Word has length 10 [2025-03-09 00:31:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:03,222 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1010 transitions. [2025-03-09 00:31:03,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1010 transitions. [2025-03-09 00:31:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 00:31:03,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:03,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:03,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 00:31:03,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:03,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr417REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:03,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:03,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1854144809, now seen corresponding path program 1 times [2025-03-09 00:31:03,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:03,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1127958731] [2025-03-09 00:31:03,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:03,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:03,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:03,426 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:03,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:31:03,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:31:03,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:31:03,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:03,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:03,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:31:03,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:03,530 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 [2025-03-09 00:31:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:03,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:31:03,560 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:03,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127958731] [2025-03-09 00:31:03,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127958731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:03,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:03,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:31:03,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677431987] [2025-03-09 00:31:03,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:03,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:31:03,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:03,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:31:03,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:31:03,561 INFO L87 Difference]: Start difference. First operand 877 states and 1010 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:04,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:04,627 INFO L93 Difference]: Finished difference Result 862 states and 972 transitions. [2025-03-09 00:31:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:31:04,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-09 00:31:04,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:04,630 INFO L225 Difference]: With dead ends: 862 [2025-03-09 00:31:04,630 INFO L226 Difference]: Without dead ends: 862 [2025-03-09 00:31:04,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:31:04,633 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 559 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:04,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 888 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 00:31:04,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-03-09 00:31:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 854. [2025-03-09 00:31:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 516 states have (on average 1.8565891472868217) internal successors, (958), 849 states have internal predecessors, (958), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 964 transitions. [2025-03-09 00:31:04,649 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 964 transitions. Word has length 14 [2025-03-09 00:31:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:04,649 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 964 transitions. [2025-03-09 00:31:04,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 964 transitions. [2025-03-09 00:31:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 00:31:04,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:04,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:04,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 00:31:04,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:04,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:04,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:04,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1854144808, now seen corresponding path program 1 times [2025-03-09 00:31:04,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:04,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1824790442] [2025-03-09 00:31:04,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:04,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:04,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:04,854 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:04,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:31:04,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:31:04,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:31:04,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:04,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:04,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:31:04,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:04,952 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 [2025-03-09 00:31:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:05,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:31:05,015 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824790442] [2025-03-09 00:31:05,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824790442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:05,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:05,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:31:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110351279] [2025-03-09 00:31:05,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:05,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:31:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:05,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:31:05,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:31:05,016 INFO L87 Difference]: Start difference. First operand 854 states and 964 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:06,454 INFO L93 Difference]: Finished difference Result 1031 states and 1132 transitions. [2025-03-09 00:31:06,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:31:06,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-09 00:31:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:06,457 INFO L225 Difference]: With dead ends: 1031 [2025-03-09 00:31:06,457 INFO L226 Difference]: Without dead ends: 1031 [2025-03-09 00:31:06,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:31:06,458 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 384 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:06,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1431 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-09 00:31:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2025-03-09 00:31:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 968. [2025-03-09 00:31:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 630 states have (on average 1.7396825396825397) internal successors, (1096), 963 states have internal predecessors, (1096), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1102 transitions. [2025-03-09 00:31:06,471 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1102 transitions. Word has length 14 [2025-03-09 00:31:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:06,472 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1102 transitions. [2025-03-09 00:31:06,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1102 transitions. [2025-03-09 00:31:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 00:31:06,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:06,473 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:06,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 00:31:06,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:06,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:06,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:06,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1950879577, now seen corresponding path program 1 times [2025-03-09 00:31:06,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:06,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [276969253] [2025-03-09 00:31:06,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:06,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:06,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:06,677 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:06,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:31:06,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 00:31:06,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 00:31:06,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:06,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:06,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 00:31:06,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:06,806 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 [2025-03-09 00:31:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:06,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:07,322 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:07,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276969253] [2025-03-09 00:31:07,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276969253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:31:07,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:31:07,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 00:31:07,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319017726] [2025-03-09 00:31:07,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:31:07,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:31:07,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:07,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:31:07,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:31:07,323 INFO L87 Difference]: Start difference. First operand 968 states and 1102 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:11,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:11,293 INFO L93 Difference]: Finished difference Result 1387 states and 1622 transitions. [2025-03-09 00:31:11,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:31:11,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-09 00:31:11,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:11,298 INFO L225 Difference]: With dead ends: 1387 [2025-03-09 00:31:11,299 INFO L226 Difference]: Without dead ends: 1387 [2025-03-09 00:31:11,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:31:11,299 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 1033 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:11,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 2233 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-09 00:31:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2025-03-09 00:31:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1132. [2025-03-09 00:31:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 794 states have (on average 1.672544080604534) internal successors, (1328), 1127 states have internal predecessors, (1328), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1334 transitions. [2025-03-09 00:31:11,317 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1334 transitions. Word has length 33 [2025-03-09 00:31:11,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:11,317 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1334 transitions. [2025-03-09 00:31:11,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1334 transitions. [2025-03-09 00:31:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 00:31:11,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:11,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:11,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 00:31:11,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:11,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr336REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:11,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1347963903, now seen corresponding path program 1 times [2025-03-09 00:31:11,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:11,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872709310] [2025-03-09 00:31:11,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:11,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:11,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:11,527 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:11,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:31:11,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 00:31:11,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 00:31:11,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:11,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:11,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:31:11,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:11,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:31:11,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:11,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872709310] [2025-03-09 00:31:11,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872709310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:11,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:11,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:31:11,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450709030] [2025-03-09 00:31:11,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:11,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:31:11,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:11,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:31:11,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:31:11,680 INFO L87 Difference]: Start difference. First operand 1132 states and 1334 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:11,730 INFO L93 Difference]: Finished difference Result 821 states and 898 transitions. [2025-03-09 00:31:11,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:31:11,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-09 00:31:11,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:11,732 INFO L225 Difference]: With dead ends: 821 [2025-03-09 00:31:11,732 INFO L226 Difference]: Without dead ends: 821 [2025-03-09 00:31:11,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:31:11,733 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 56 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:11,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 2063 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:31:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-03-09 00:31:11,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 819. [2025-03-09 00:31:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 504 states have (on average 1.7658730158730158) internal successors, (890), 814 states have internal predecessors, (890), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 896 transitions. [2025-03-09 00:31:11,745 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 896 transitions. Word has length 48 [2025-03-09 00:31:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:11,746 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 896 transitions. [2025-03-09 00:31:11,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 896 transitions. [2025-03-09 00:31:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 00:31:11,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:11,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:11,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 00:31:11,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:11,947 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr336REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:11,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2010693961, now seen corresponding path program 1 times [2025-03-09 00:31:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:11,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832160729] [2025-03-09 00:31:11,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:11,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:11,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:11,951 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:11,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:31:12,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 00:31:12,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 00:31:12,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:12,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:12,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 00:31:12,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:12,118 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 [2025-03-09 00:31:12,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:31:12,470 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 [2025-03-09 00:31:12,484 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 00:31:12,484 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 [2025-03-09 00:31:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:12,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:31:12,492 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:12,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832160729] [2025-03-09 00:31:12,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832160729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:12,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:12,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:31:12,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994397646] [2025-03-09 00:31:12,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:12,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:31:12,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:12,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:31:12,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:31:12,493 INFO L87 Difference]: Start difference. First operand 819 states and 896 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:13,692 INFO L93 Difference]: Finished difference Result 781 states and 858 transitions. [2025-03-09 00:31:13,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:31:13,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-09 00:31:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:13,694 INFO L225 Difference]: With dead ends: 781 [2025-03-09 00:31:13,694 INFO L226 Difference]: Without dead ends: 781 [2025-03-09 00:31:13,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:31:13,695 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 451 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:13,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 772 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-09 00:31:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-03-09 00:31:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 744. [2025-03-09 00:31:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 467 states have (on average 1.6659528907922911) internal successors, (778), 739 states have internal predecessors, (778), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 784 transitions. [2025-03-09 00:31:13,704 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 784 transitions. Word has length 56 [2025-03-09 00:31:13,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:13,704 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 784 transitions. [2025-03-09 00:31:13,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 784 transitions. [2025-03-09 00:31:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-09 00:31:13,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:13,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:13,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 00:31:13,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:13,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr329REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:13,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:13,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1600191401, now seen corresponding path program 1 times [2025-03-09 00:31:13,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:13,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1782610346] [2025-03-09 00:31:13,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:13,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:13,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:13,913 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:13,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 00:31:14,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 00:31:14,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 00:31:14,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:14,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:14,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:31:14,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:14,076 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 [2025-03-09 00:31:14,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:31:14,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-09 00:31:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:14,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:31:14,115 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:14,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782610346] [2025-03-09 00:31:14,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782610346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:14,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:14,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:31:14,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761800797] [2025-03-09 00:31:14,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:14,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:31:14,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:14,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:31:14,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:31:14,117 INFO L87 Difference]: Start difference. First operand 744 states and 784 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:15,131 INFO L93 Difference]: Finished difference Result 743 states and 783 transitions. [2025-03-09 00:31:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:31:15,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-09 00:31:15,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:15,134 INFO L225 Difference]: With dead ends: 743 [2025-03-09 00:31:15,135 INFO L226 Difference]: Without dead ends: 743 [2025-03-09 00:31:15,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:31:15,136 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 2 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:15,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1715 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 00:31:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-03-09 00:31:15,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2025-03-09 00:31:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 467 states have (on average 1.6638115631691648) internal successors, (777), 738 states have internal predecessors, (777), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 783 transitions. [2025-03-09 00:31:15,145 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 783 transitions. Word has length 61 [2025-03-09 00:31:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:15,145 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 783 transitions. [2025-03-09 00:31:15,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 783 transitions. [2025-03-09 00:31:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-09 00:31:15,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:15,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:15,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 00:31:15,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:15,347 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:15,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:15,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1600191400, now seen corresponding path program 1 times [2025-03-09 00:31:15,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:15,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470868722] [2025-03-09 00:31:15,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:15,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:15,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:15,350 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:15,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 00:31:15,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 00:31:15,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 00:31:15,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:15,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:15,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 00:31:15,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:15,519 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 [2025-03-09 00:31:15,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 00:31:15,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:31:15,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-09 00:31:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:15,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:31:15,596 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:15,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470868722] [2025-03-09 00:31:15,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470868722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:15,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:15,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:31:15,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642480559] [2025-03-09 00:31:15,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:15,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:31:15,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:15,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:31:15,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:31:15,597 INFO L87 Difference]: Start difference. First operand 743 states and 783 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:16,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:16,832 INFO L93 Difference]: Finished difference Result 742 states and 782 transitions. [2025-03-09 00:31:16,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:31:16,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-09 00:31:16,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:16,834 INFO L225 Difference]: With dead ends: 742 [2025-03-09 00:31:16,834 INFO L226 Difference]: Without dead ends: 742 [2025-03-09 00:31:16,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:31:16,835 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 1 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:16,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1740 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-09 00:31:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-09 00:31:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2025-03-09 00:31:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 466 states have (on average 1.6652360515021458) internal successors, (776), 737 states have internal predecessors, (776), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 782 transitions. [2025-03-09 00:31:16,842 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 782 transitions. Word has length 61 [2025-03-09 00:31:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:16,843 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 782 transitions. [2025-03-09 00:31:16,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:31:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 782 transitions. [2025-03-09 00:31:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 00:31:16,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:16,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:16,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 00:31:17,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:17,044 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr326REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:17,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2092680683, now seen corresponding path program 1 times [2025-03-09 00:31:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:17,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1852405208] [2025-03-09 00:31:17,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:17,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:17,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:17,047 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:17,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 00:31:17,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 00:31:17,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 00:31:17,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:17,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:17,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:31:17,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:17,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:31:17,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:17,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852405208] [2025-03-09 00:31:17,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852405208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:17,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:17,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:31:17,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139364480] [2025-03-09 00:31:17,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:17,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:31:17,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:17,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:31:17,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:31:17,227 INFO L87 Difference]: Start difference. First operand 742 states and 782 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2025-03-09 00:31:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:17,246 INFO L93 Difference]: Finished difference Result 745 states and 786 transitions. [2025-03-09 00:31:17,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:31:17,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 69 [2025-03-09 00:31:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:17,249 INFO L225 Difference]: With dead ends: 745 [2025-03-09 00:31:17,249 INFO L226 Difference]: Without dead ends: 745 [2025-03-09 00:31:17,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:31:17,250 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 0 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:17,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2047 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:31:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-09 00:31:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2025-03-09 00:31:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 468 states have (on average 1.6645299145299146) internal successors, (779), 740 states have internal predecessors, (779), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:31:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 786 transitions. [2025-03-09 00:31:17,259 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 786 transitions. Word has length 69 [2025-03-09 00:31:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:17,259 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 786 transitions. [2025-03-09 00:31:17,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2025-03-09 00:31:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 786 transitions. [2025-03-09 00:31:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-09 00:31:17,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:17,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:17,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 00:31:17,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:17,461 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr326REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:17,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:17,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2036992973, now seen corresponding path program 1 times [2025-03-09 00:31:17,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:17,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1577655516] [2025-03-09 00:31:17,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:17,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:17,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:17,465 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:17,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 00:31:17,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 00:31:17,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 00:31:17,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:17,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:17,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:31:17,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:17,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:17,697 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:17,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577655516] [2025-03-09 00:31:17,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577655516] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:31:17,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:31:17,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-09 00:31:17,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815136662] [2025-03-09 00:31:17,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:31:17,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:31:17,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:17,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:31:17,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:31:17,699 INFO L87 Difference]: Start difference. First operand 745 states and 786 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:17,786 INFO L93 Difference]: Finished difference Result 757 states and 803 transitions. [2025-03-09 00:31:17,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:31:17,787 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2025-03-09 00:31:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:17,789 INFO L225 Difference]: With dead ends: 757 [2025-03-09 00:31:17,789 INFO L226 Difference]: Without dead ends: 757 [2025-03-09 00:31:17,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:31:17,789 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 8 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2727 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:17,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2727 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:31:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-03-09 00:31:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 755. [2025-03-09 00:31:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 477 states have (on average 1.6645702306079664) internal successors, (794), 749 states have internal predecessors, (794), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:31:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 801 transitions. [2025-03-09 00:31:17,800 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 801 transitions. Word has length 70 [2025-03-09 00:31:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:17,800 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 801 transitions. [2025-03-09 00:31:17,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 801 transitions. [2025-03-09 00:31:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 00:31:17,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:17,801 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:17,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 00:31:18,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:18,002 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr326REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:18,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:18,002 INFO L85 PathProgramCache]: Analyzing trace with hash -955848683, now seen corresponding path program 2 times [2025-03-09 00:31:18,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:18,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955333830] [2025-03-09 00:31:18,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:31:18,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:18,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:18,004 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:18,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 00:31:18,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-09 00:31:35,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 00:31:35,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:31:35,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:35,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 00:31:35,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:36,070 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 [2025-03-09 00:31:36,084 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 00:31:36,084 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 [2025-03-09 00:31:36,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:31:36,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 00:31:36,194 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 22 treesize of output 10 [2025-03-09 00:31:36,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-09 00:31:36,376 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:36,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-09 00:31:36,384 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 30 treesize of output 13 [2025-03-09 00:31:36,425 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 31 treesize of output 13 [2025-03-09 00:31:36,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-09 00:31:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 00:31:36,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:36,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_774 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_773 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2025-03-09 00:31:36,614 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:36,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955333830] [2025-03-09 00:31:36,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955333830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:36,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [696417306] [2025-03-09 00:31:36,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:31:36,614 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-09 00:31:36,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-09 00:31:36,617 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-09 00:31:36,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-03-09 00:31:36,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-09 00:31:37,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 00:31:37,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:31:37,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:37,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:31:37,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:37,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:37,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [696417306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:31:37,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:31:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-03-09 00:31:37,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087421942] [2025-03-09 00:31:37,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:31:37,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 00:31:37,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:37,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 00:31:37,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2025-03-09 00:31:37,633 INFO L87 Difference]: Start difference. First operand 755 states and 801 transitions. Second operand has 22 states, 21 states have (on average 6.476190476190476) internal successors, (136), 22 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 00:31:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:43,296 INFO L93 Difference]: Finished difference Result 775 states and 824 transitions. [2025-03-09 00:31:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-09 00:31:43,297 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.476190476190476) internal successors, (136), 22 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 73 [2025-03-09 00:31:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:43,298 INFO L225 Difference]: With dead ends: 775 [2025-03-09 00:31:43,298 INFO L226 Difference]: Without dead ends: 763 [2025-03-09 00:31:43,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=1847, Unknown=1, NotChecked=90, Total=2256 [2025-03-09 00:31:43,299 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 464 mSDsluCounter, 4062 mSDsCounter, 0 mSdLazyCounter, 4201 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 4516 SdHoareTripleChecker+Invalid, 4221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:43,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 4516 Invalid, 4221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4201 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-09 00:31:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-03-09 00:31:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2025-03-09 00:31:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 486 states have (on average 1.646090534979424) internal successors, (800), 757 states have internal predecessors, (800), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:31:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 807 transitions. [2025-03-09 00:31:43,306 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 807 transitions. Word has length 73 [2025-03-09 00:31:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:43,306 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 807 transitions. [2025-03-09 00:31:43,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.476190476190476) internal successors, (136), 22 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 00:31:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 807 transitions. [2025-03-09 00:31:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 00:31:43,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:43,307 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:43,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2025-03-09 00:31:43,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 00:31:43,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:43,708 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr325REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:43,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash 206949652, now seen corresponding path program 1 times [2025-03-09 00:31:43,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:43,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1614970878] [2025-03-09 00:31:43,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:43,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:43,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:43,711 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:43,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 00:31:43,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 00:31:43,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 00:31:43,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:43,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:43,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 00:31:43,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:43,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:44,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:31:44,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614970878] [2025-03-09 00:31:44,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614970878] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:31:44,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:31:44,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2025-03-09 00:31:44,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941363051] [2025-03-09 00:31:44,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:31:44,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 00:31:44,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:31:44,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 00:31:44,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2025-03-09 00:31:44,367 INFO L87 Difference]: Start difference. First operand 763 states and 807 transitions. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:45,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:45,422 INFO L93 Difference]: Finished difference Result 787 states and 846 transitions. [2025-03-09 00:31:45,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-09 00:31:45,423 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 79 [2025-03-09 00:31:45,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:45,424 INFO L225 Difference]: With dead ends: 787 [2025-03-09 00:31:45,424 INFO L226 Difference]: Without dead ends: 781 [2025-03-09 00:31:45,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2025-03-09 00:31:45,425 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 26 mSDsluCounter, 7482 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8165 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:45,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8165 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:31:45,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-03-09 00:31:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2025-03-09 00:31:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 504 states have (on average 1.632936507936508) internal successors, (823), 775 states have internal predecessors, (823), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:31:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 830 transitions. [2025-03-09 00:31:45,434 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 830 transitions. Word has length 79 [2025-03-09 00:31:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:45,434 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 830 transitions. [2025-03-09 00:31:45,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 830 transitions. [2025-03-09 00:31:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-09 00:31:45,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:45,435 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:45,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 00:31:45,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:45,636 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr325REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:31:45,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:45,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2025564396, now seen corresponding path program 2 times [2025-03-09 00:31:45,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:31:45,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845743440] [2025-03-09 00:31:45,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:31:45,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:45,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:45,638 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:45,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 00:31:45,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-03-09 00:32:00,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:32:00,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:32:00,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:00,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 00:32:00,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:32:00,471 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 00:32:00,471 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 [2025-03-09 00:32:00,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:32:00,774 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:32:00,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2025-03-09 00:32:00,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-09 00:32:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-09 00:32:00,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:32:00,933 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2025-03-09 00:32:00,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2025-03-09 00:32:00,939 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2025-03-09 00:32:00,940 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:32:00,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845743440] [2025-03-09 00:32:00,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845743440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:32:00,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [493068541] [2025-03-09 00:32:00,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:32:00,940 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-09 00:32:00,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-09 00:32:00,942 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-09 00:32:00,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2025-03-09 00:32:01,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-03-09 00:32:01,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:32:01,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:32:01,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:01,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-09 00:32:01,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:32:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:32:02,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:32:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:32:03,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [493068541] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:32:03,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:32:03,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 26, 26] total 60 [2025-03-09 00:32:03,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184206796] [2025-03-09 00:32:03,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:32:03,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-09 00:32:03,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:32:03,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-09 00:32:03,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=2962, Unknown=1, NotChecked=118, Total=3782 [2025-03-09 00:32:03,819 INFO L87 Difference]: Start difference. First operand 781 states and 830 transitions. Second operand has 60 states, 59 states have (on average 2.9152542372881354) internal successors, (172), 59 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 00:32:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:32:19,556 INFO L93 Difference]: Finished difference Result 824 states and 906 transitions. [2025-03-09 00:32:19,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-09 00:32:19,557 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.9152542372881354) internal successors, (172), 59 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 91 [2025-03-09 00:32:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:32:19,559 INFO L225 Difference]: With dead ends: 824 [2025-03-09 00:32:19,559 INFO L226 Difference]: Without dead ends: 818 [2025-03-09 00:32:19,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3642 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=3855, Invalid=15888, Unknown=1, NotChecked=278, Total=20022 [2025-03-09 00:32:19,562 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 498 mSDsluCounter, 13048 mSDsCounter, 0 mSdLazyCounter, 10261 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 13502 SdHoareTripleChecker+Invalid, 10322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 10261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:32:19,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 13502 Invalid, 10322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 10261 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2025-03-09 00:32:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-03-09 00:32:19,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 816. [2025-03-09 00:32:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 540 states have (on average 1.6111111111111112) internal successors, (870), 810 states have internal predecessors, (870), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:32:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 877 transitions. [2025-03-09 00:32:19,572 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 877 transitions. Word has length 91 [2025-03-09 00:32:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:32:19,572 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 877 transitions. [2025-03-09 00:32:19,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.9152542372881354) internal successors, (172), 59 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 00:32:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 877 transitions. [2025-03-09 00:32:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-09 00:32:19,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:32:19,573 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:32:19,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2025-03-09 00:32:19,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 00:32:19,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:32:19,974 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr321REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2025-03-09 00:32:19,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:32:19,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1145409960, now seen corresponding path program 1 times [2025-03-09 00:32:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:32:19,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512389340] [2025-03-09 00:32:19,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:19,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:32:19,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:32:19,976 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:32:19,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 00:32:20,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-09 00:32:20,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 00:32:20,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:20,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:20,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-09 00:32:20,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:32:20,386 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 00:32:20,386 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 [2025-03-09 00:32:20,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:32:20,744 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:32:20,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2025-03-09 00:32:20,795 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:32:20,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2025-03-09 00:32:20,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-09 00:32:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-09 00:32:20,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:32:20,863 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-09 00:32:21,131 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2025-03-09 00:32:21,131 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 37 treesize of output 36 [2025-03-09 00:32:21,137 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1973))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1927)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2025-03-09 00:32:21,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:32:21,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512389340] [2025-03-09 00:32:21,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512389340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:32:21,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [710526452] [2025-03-09 00:32:21,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:21,139 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-09 00:32:21,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-09 00:32:21,142 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-09 00:32:21,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2025-03-09 00:32:21,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-09 00:32:22,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 00:32:22,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:22,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:22,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-09 00:32:22,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:32:22,307 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-09 00:32:22,307 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 [2025-03-09 00:32:22,502 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2025-03-09 00:32:22,502 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 26 treesize of output 43 [2025-03-09 00:32:22,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:32:22,689 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 34 treesize of output 16 [2025-03-09 00:32:23,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:32:23,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2025-03-09 00:32:23,685 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:32:23,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2025-03-09 00:32:23,721 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 19 [2025-03-09 00:32:23,762 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-09 00:32:23,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:32:24,063 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2426))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1927)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-03-09 00:32:24,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [710526452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:32:24,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:32:24,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 20 [2025-03-09 00:32:24,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748671612] [2025-03-09 00:32:24,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:32:24,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 00:32:24,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:32:24,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 00:32:24,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=415, Unknown=10, NotChecked=132, Total=650 [2025-03-09 00:32:24,066 INFO L87 Difference]: Start difference. First operand 816 states and 877 transitions. Second operand has 21 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)