./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 798a7b37 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_FNV_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:07:59,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:07:59,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-04 07:07:59,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:07:59,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:07:59,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:07:59,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:07:59,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:07:59,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:07:59,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:07:59,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:07:59,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:07:59,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:07:59,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:07:59,569 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:07:59,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:07:59,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:07:59,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:07:59,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:07:59,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:07:59,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:07:59,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:07:59,570 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:07:59,570 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:07:59,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:07:59,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:07:59,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:07:59,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:07:59,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:07:59,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:07:59,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:07:59,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:07:59,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:07:59,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:07:59,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:07:59,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:07:59,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:07:59,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:07:59,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:07:59,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:07:59,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:07:59,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:07:59,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:07:59,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:07:59,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:07:59,573 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-memcleanup) ) 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2025-03-04 07:07:59,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:07:59,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:07:59,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:07:59,792 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:07:59,793 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:07:59,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-2.i [2025-03-04 07:08:00,941 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3c38f88/d32d632fed1f462a82e19802ce520877/FLAG206f6c113 [2025-03-04 07:08:01,247 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:08:01,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-2.i [2025-03-04 07:08:01,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3c38f88/d32d632fed1f462a82e19802ce520877/FLAG206f6c113 [2025-03-04 07:08:01,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3c38f88/d32d632fed1f462a82e19802ce520877 [2025-03-04 07:08:01,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:08:01,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:08:01,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:08:01,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:08:01,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:08:01,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:08:01" (1/1) ... [2025-03-04 07:08:01,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e935b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:01, skipping insertion in model container [2025-03-04 07:08:01,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:08:01" (1/1) ... [2025-03-04 07:08:01,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:08:01,640 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-04 07:08:01,673 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-04 07:08:01,677 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-04 07:08:01,681 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-04 07:08:01,689 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-04 07:08:01,726 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-04 07:08:01,728 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-04 07:08:01,730 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-04 07:08:01,732 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-04 07:08:01,734 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-04 07:08:01,736 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-04 07:08:01,737 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-04 07:08:01,739 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-04 07:08:01,741 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-04 07:08:01,747 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-04 07:08:01,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:08:01,768 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-04 07:08:01,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@511e5693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:01, skipping insertion in model container [2025-03-04 07:08:01,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:08:01,769 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-04 07:08:01,771 INFO L158 Benchmark]: Toolchain (without parser) took 485.77ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 83.9MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 07:08:01,771 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:08:01,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.06ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 83.9MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 07:08:01,773 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.25ms. Allocated memory is still 201.3MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.06ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 83.9MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 831]: 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_FNV_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:08:03,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:08:03,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-03-04 07:08:03,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:08:03,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:08:03,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:08:03,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:08:03,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:08:03,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:08:03,478 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:08:03,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:08:03,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:08:03,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:08:03,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:08:03,480 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:08:03,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:08:03,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:08:03,480 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:08:03,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:08:03,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:08:03,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:08:03,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:08:03,481 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:08:03,481 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:08:03,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:08:03,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:08:03,481 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:08:03,481 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:08:03,481 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:08:03,481 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:08:03,481 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:08:03,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:08:03,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:08:03,482 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:08:03,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:08:03,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:08:03,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:08:03,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:08:03,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:08:03,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:08:03,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:08:03,483 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:08:03,483 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:08:03,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:08:03,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:08:03,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:08:03,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:08:03,483 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-memcleanup) ) 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2025-03-04 07:08:03,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:08:03,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:08:03,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:08:03,724 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:08:03,724 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:08:03,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-2.i [2025-03-04 07:08:04,853 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/436cb355b/429846622ec04ecda863fcfd5f719982/FLAG5eaf6555a [2025-03-04 07:08:05,118 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:08:05,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-2.i [2025-03-04 07:08:05,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/436cb355b/429846622ec04ecda863fcfd5f719982/FLAG5eaf6555a [2025-03-04 07:08:05,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/436cb355b/429846622ec04ecda863fcfd5f719982 [2025-03-04 07:08:05,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:08:05,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:08:05,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:08:05,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:08:05,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:08:05,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:05,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e50ae8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05, skipping insertion in model container [2025-03-04 07:08:05,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:05,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:08:05,504 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-04 07:08:05,539 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-04 07:08:05,542 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-04 07:08:05,544 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-04 07:08:05,552 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-04 07:08:05,574 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-04 07:08:05,574 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-04 07:08:05,576 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-04 07:08:05,576 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-04 07:08:05,577 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-04 07:08:05,578 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-04 07:08:05,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-04 07:08:05,582 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-04 07:08:05,582 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-04 07:08:05,585 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-04 07:08:05,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:08:05,606 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-04 07:08:05,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:08:05,648 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-04 07:08:05,665 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-04 07:08:05,667 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-04 07:08:05,668 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-04 07:08:05,671 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-04 07:08:05,700 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-04 07:08:05,703 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-04 07:08:05,705 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-04 07:08:05,707 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-04 07:08:05,708 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-04 07:08:05,709 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-04 07:08:05,711 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-04 07:08:05,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-04 07:08:05,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-04 07:08:05,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-04 07:08:05,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:08:05,723 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:08:05,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:08:05,821 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:08:05,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05 WrapperNode [2025-03-04 07:08:05,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:08:05,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:08:05,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:08:05,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:08:05,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:05,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:05,896 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 995 [2025-03-04 07:08:05,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:08:05,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:08:05,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:08:05,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:08:05,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:05,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:05,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:05,994 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-03-04 07:08:05,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:05,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:06,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:06,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:06,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:06,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:06,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:08:06,048 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:08:06,048 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:08:06,048 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:08:06,049 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05" (1/1) ... [2025-03-04 07:08:06,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:08:06,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:06,073 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-04 07:08:06,076 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-04 07:08:06,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 07:08:06,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 07:08:06,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 07:08:06,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 07:08:06,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 07:08:06,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 07:08:06,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 07:08:06,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 07:08:06,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 07:08:06,096 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 07:08:06,096 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 07:08:06,096 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 07:08:06,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:08:06,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:08:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:08:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:08:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 07:08:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 07:08:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 07:08:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:08:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:08:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:08:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 07:08:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:08:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:08:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:08:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:08:06,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:08:06,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:08:06,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:08:06,288 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:08:06,290 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:08:13,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 07:08:13,104 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2025-03-04 07:08:13,105 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:08:13,113 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:08:13,113 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:08:13,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:08:13 BoogieIcfgContainer [2025-03-04 07:08:13,113 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:08:13,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:08:13,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:08:13,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:08:13,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:08:05" (1/3) ... [2025-03-04 07:08:13,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ba0c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:08:13, skipping insertion in model container [2025-03-04 07:08:13,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:08:05" (2/3) ... [2025-03-04 07:08:13,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ba0c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:08:13, skipping insertion in model container [2025-03-04 07:08:13,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:08:13" (3/3) ... [2025-03-04 07:08:13,122 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test2-2.i [2025-03-04 07:08:13,132 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:08:13,134 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_nondet_test2-2.i that has 4 procedures, 201 locations, 1 initial locations, 36 loop locations, and 2 error locations. [2025-03-04 07:08:13,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:08:13,175 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;@3590e002, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:08:13,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 07:08:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 186 states have (on average 1.6612903225806452) internal successors, (309), 188 states have internal predecessors, (309), 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-04 07:08:13,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:08:13,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:13,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:08:13,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:13,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:13,192 INFO L85 PathProgramCache]: Analyzing trace with hash 10988490, now seen corresponding path program 1 times [2025-03-04 07:08:13,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:13,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432960493] [2025-03-04 07:08:13,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:13,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:13,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:13,203 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-04 07:08:13,206 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-04 07:08:13,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:08:13,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:08:13,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:13,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:13,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:08:13,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:13,428 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_18| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_18|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_18| (_ bv0 1)) |c_#valid|))) is different from true [2025-03-04 07:08:13,431 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-04 07:08:13,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:13,433 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:13,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432960493] [2025-03-04 07:08:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432960493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:13,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:13,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:08:13,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331481750] [2025-03-04 07:08:13,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:13,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:08:13,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:13,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:08:13,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2025-03-04 07:08:13,456 INFO L87 Difference]: Start difference. First operand has 193 states, 186 states have (on average 1.6612903225806452) internal successors, (309), 188 states have internal predecessors, (309), 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, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-04 07:08:17,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:18,139 INFO L93 Difference]: Finished difference Result 287 states and 376 transitions. [2025-03-04 07:08:18,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:08:18,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2025-03-04 07:08:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:18,153 INFO L225 Difference]: With dead ends: 287 [2025-03-04 07:08:18,153 INFO L226 Difference]: Without dead ends: 284 [2025-03-04 07:08:18,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2025-03-04 07:08:18,156 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 122 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:18,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 471 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 1 Unknown, 377 Unchecked, 4.6s Time] [2025-03-04 07:08:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-04 07:08:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 190. [2025-03-04 07:08:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 184 states have (on average 1.309782608695652) internal successors, (241), 185 states have internal predecessors, (241), 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-04 07:08:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2025-03-04 07:08:18,192 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 4 [2025-03-04 07:08:18,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:18,192 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2025-03-04 07:08:18,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-04 07:08:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2025-03-04 07:08:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:08:18,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:18,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:18,199 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-04 07:08:18,393 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-04 07:08:18,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:18,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash 213630771, now seen corresponding path program 1 times [2025-03-04 07:08:18,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:18,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292846361] [2025-03-04 07:08:18,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:18,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:18,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:18,397 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-04 07:08:18,398 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-04 07:08:18,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:08:18,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:08:18,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:18,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:18,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:08:18,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:18,632 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-04 07:08:18,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:18,633 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:18,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292846361] [2025-03-04 07:08:18,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292846361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:18,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:18,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:08:18,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754666592] [2025-03-04 07:08:18,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:18,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:08:18,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:18,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:08:18,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:08:18,636 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:08:19,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:19,183 INFO L93 Difference]: Finished difference Result 307 states and 399 transitions. [2025-03-04 07:08:19,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:08:19,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 07:08:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:19,189 INFO L225 Difference]: With dead ends: 307 [2025-03-04 07:08:19,189 INFO L226 Difference]: Without dead ends: 307 [2025-03-04 07:08:19,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:08:19,189 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 143 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:19,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 455 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:08:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-04 07:08:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 275. [2025-03-04 07:08:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 269 states have (on average 1.312267657992565) internal successors, (353), 270 states have internal predecessors, (353), 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-04 07:08:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 359 transitions. [2025-03-04 07:08:19,203 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 359 transitions. Word has length 13 [2025-03-04 07:08:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:19,204 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 359 transitions. [2025-03-04 07:08:19,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:08:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 359 transitions. [2025-03-04 07:08:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:08:19,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:19,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:19,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:08:19,404 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-04 07:08:19,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:19,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:19,405 INFO L85 PathProgramCache]: Analyzing trace with hash 213660562, now seen corresponding path program 1 times [2025-03-04 07:08:19,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:19,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155758822] [2025-03-04 07:08:19,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:19,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:19,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:19,408 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-04 07:08:19,409 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-04 07:08:19,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:08:19,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:08:19,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:19,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:19,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:08:19,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:19,612 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_19| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_19| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_19|)))) is different from true [2025-03-04 07:08:19,613 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-04 07:08:19,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:19,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:19,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155758822] [2025-03-04 07:08:19,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155758822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:19,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:19,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:08:19,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216076967] [2025-03-04 07:08:19,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:19,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:08:19,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:19,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:08:19,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2025-03-04 07:08:19,614 INFO L87 Difference]: Start difference. First operand 275 states and 359 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:08:23,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:25,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:25,096 INFO L93 Difference]: Finished difference Result 350 states and 455 transitions. [2025-03-04 07:08:25,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:08:25,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 07:08:25,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:25,104 INFO L225 Difference]: With dead ends: 350 [2025-03-04 07:08:25,104 INFO L226 Difference]: Without dead ends: 349 [2025-03-04 07:08:25,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2025-03-04 07:08:25,104 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 88 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:25,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 468 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 1 Unknown, 346 Unchecked, 5.5s Time] [2025-03-04 07:08:25,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-04 07:08:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 322. [2025-03-04 07:08:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 316 states have (on average 1.3101265822784811) internal successors, (414), 317 states have internal predecessors, (414), 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-04 07:08:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 420 transitions. [2025-03-04 07:08:25,112 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 420 transitions. Word has length 13 [2025-03-04 07:08:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:25,112 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 420 transitions. [2025-03-04 07:08:25,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:08:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 420 transitions. [2025-03-04 07:08:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:08:25,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:25,114 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] [2025-03-04 07:08:25,120 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-04 07:08:25,314 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-04 07:08:25,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:25,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash 366477438, now seen corresponding path program 1 times [2025-03-04 07:08:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:25,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092495302] [2025-03-04 07:08:25,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:25,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:25,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:25,318 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-04 07:08:25,318 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-04 07:08:25,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:08:25,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:08:25,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:25,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:25,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:08:25,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:08:25,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:25,513 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:25,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092495302] [2025-03-04 07:08:25,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092495302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:25,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:25,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:08:25,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670503747] [2025-03-04 07:08:25,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:25,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:08:25,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:25,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:08:25,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:08:25,513 INFO L87 Difference]: Start difference. First operand 322 states and 420 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-04 07:08:29,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:31,806 INFO L93 Difference]: Finished difference Result 356 states and 461 transitions. [2025-03-04 07:08:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:08:31,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2025-03-04 07:08:31,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:31,810 INFO L225 Difference]: With dead ends: 356 [2025-03-04 07:08:31,810 INFO L226 Difference]: Without dead ends: 352 [2025-03-04 07:08:31,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-04 07:08:31,810 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 145 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:31,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 718 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2025-03-04 07:08:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-04 07:08:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 320. [2025-03-04 07:08:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 314 states have (on average 1.3089171974522293) internal successors, (411), 315 states have internal predecessors, (411), 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-04 07:08:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 417 transitions. [2025-03-04 07:08:31,822 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 417 transitions. Word has length 22 [2025-03-04 07:08:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:31,822 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 417 transitions. [2025-03-04 07:08:31,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-04 07:08:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 417 transitions. [2025-03-04 07:08:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:08:31,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:31,823 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] [2025-03-04 07:08:31,832 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-04 07:08:32,023 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-04 07:08:32,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:32,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:32,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1905802400, now seen corresponding path program 1 times [2025-03-04 07:08:32,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:32,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [766998499] [2025-03-04 07:08:32,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:32,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:32,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:32,026 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-04 07:08:32,027 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-04 07:08:32,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:08:32,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:08:32,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:32,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:32,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:08:32,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:32,185 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-04 07:08:32,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:32,187 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:32,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766998499] [2025-03-04 07:08:32,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766998499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:32,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:32,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:08:32,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359856147] [2025-03-04 07:08:32,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:32,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:08:32,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:32,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:08:32,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:08:32,189 INFO L87 Difference]: Start difference. First operand 320 states and 417 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-04 07:08:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:32,293 INFO L93 Difference]: Finished difference Result 380 states and 477 transitions. [2025-03-04 07:08:32,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:08:32,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2025-03-04 07:08:32,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:32,295 INFO L225 Difference]: With dead ends: 380 [2025-03-04 07:08:32,295 INFO L226 Difference]: Without dead ends: 380 [2025-03-04 07:08:32,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-04 07:08:32,296 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 8 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:32,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 439 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:08:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-04 07:08:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-03-04 07:08:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 374 states have (on average 1.2593582887700534) internal successors, (471), 375 states have internal predecessors, (471), 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-04 07:08:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 477 transitions. [2025-03-04 07:08:32,304 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 477 transitions. Word has length 47 [2025-03-04 07:08:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:32,305 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 477 transitions. [2025-03-04 07:08:32,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-04 07:08:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 477 transitions. [2025-03-04 07:08:32,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:08:32,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:32,306 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] [2025-03-04 07:08:32,314 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-04 07:08:32,506 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-04 07:08:32,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:32,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:32,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2134428351, now seen corresponding path program 1 times [2025-03-04 07:08:32,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:32,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199676145] [2025-03-04 07:08:32,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:32,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:32,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:32,510 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-04 07:08:32,511 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-04 07:08:32,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:08:32,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:08:32,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:32,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:32,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:08:32,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:32,667 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-04 07:08:32,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:32,668 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:32,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199676145] [2025-03-04 07:08:32,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199676145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:32,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:32,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:08:32,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215667369] [2025-03-04 07:08:32,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:32,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:08:32,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:32,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:08:32,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:08:32,669 INFO L87 Difference]: Start difference. First operand 380 states and 477 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-04 07:08:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:32,777 INFO L93 Difference]: Finished difference Result 329 states and 393 transitions. [2025-03-04 07:08:32,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:08:32,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2025-03-04 07:08:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:32,781 INFO L225 Difference]: With dead ends: 329 [2025-03-04 07:08:32,781 INFO L226 Difference]: Without dead ends: 329 [2025-03-04 07:08:32,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-04 07:08:32,782 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 32 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:32,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 631 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:08:32,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-04 07:08:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2025-03-04 07:08:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 323 states have (on average 1.1981424148606812) internal successors, (387), 324 states have internal predecessors, (387), 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-04 07:08:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 393 transitions. [2025-03-04 07:08:32,791 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 393 transitions. Word has length 47 [2025-03-04 07:08:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:32,792 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 393 transitions. [2025-03-04 07:08:32,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-04 07:08:32,792 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 393 transitions. [2025-03-04 07:08:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:08:32,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:32,793 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] [2025-03-04 07:08:32,802 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-04 07:08:32,993 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-04 07:08:32,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:32,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:32,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1448147302, now seen corresponding path program 1 times [2025-03-04 07:08:32,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:32,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206913280] [2025-03-04 07:08:32,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:32,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:32,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:32,996 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-04 07:08:32,998 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-04 07:08:33,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:08:33,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:08:33,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:33,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:33,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:08:33,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:33,130 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:08:33,130 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:08:33,131 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:08:33,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-03-04 07:08:33,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:08:33,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-03-04 07:08:33,232 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-04 07:08:33,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:33,232 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:33,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206913280] [2025-03-04 07:08:33,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206913280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:33,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:33,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:08:33,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955963346] [2025-03-04 07:08:33,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:33,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:08:33,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:33,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:08:33,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:08:33,234 INFO L87 Difference]: Start difference. First operand 329 states and 393 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-04 07:08:33,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:33,623 INFO L93 Difference]: Finished difference Result 331 states and 405 transitions. [2025-03-04 07:08:33,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:08:33,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 47 [2025-03-04 07:08:33,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:33,624 INFO L225 Difference]: With dead ends: 331 [2025-03-04 07:08:33,624 INFO L226 Difference]: Without dead ends: 328 [2025-03-04 07:08:33,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:08:33,625 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 105 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:33,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 890 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:08:33,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-04 07:08:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 282. [2025-03-04 07:08:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 276 states have (on average 1.2210144927536233) internal successors, (337), 277 states have internal predecessors, (337), 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-04 07:08:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 343 transitions. [2025-03-04 07:08:33,632 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 343 transitions. Word has length 47 [2025-03-04 07:08:33,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:33,633 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 343 transitions. [2025-03-04 07:08:33,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-04 07:08:33,633 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 343 transitions. [2025-03-04 07:08:33,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 07:08:33,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:33,634 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:08:33,642 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-04 07:08:33,834 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-04 07:08:33,835 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:33,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:33,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1273589193, now seen corresponding path program 1 times [2025-03-04 07:08:33,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:33,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [145014404] [2025-03-04 07:08:33,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:33,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:33,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:33,838 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-04 07:08:33,839 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-04 07:08:34,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 07:08:34,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 07:08:34,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:34,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:34,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:08:34,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:08:34,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:34,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:34,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145014404] [2025-03-04 07:08:34,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145014404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:34,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:34,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:08:34,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189395316] [2025-03-04 07:08:34,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:34,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:08:34,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:34,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:08:34,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:08:34,148 INFO L87 Difference]: Start difference. First operand 282 states and 343 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:34,217 INFO L93 Difference]: Finished difference Result 322 states and 383 transitions. [2025-03-04 07:08:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:08:34,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2025-03-04 07:08:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:34,219 INFO L225 Difference]: With dead ends: 322 [2025-03-04 07:08:34,219 INFO L226 Difference]: Without dead ends: 322 [2025-03-04 07:08:34,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-04 07:08:34,219 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 8 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:34,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 417 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:08:34,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-04 07:08:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2025-03-04 07:08:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 316 states have (on average 1.1930379746835442) internal successors, (377), 317 states have internal predecessors, (377), 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-04 07:08:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 383 transitions. [2025-03-04 07:08:34,224 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 383 transitions. Word has length 82 [2025-03-04 07:08:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:34,224 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 383 transitions. [2025-03-04 07:08:34,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 383 transitions. [2025-03-04 07:08:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 07:08:34,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:34,225 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:08:34,236 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-04 07:08:34,426 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-04 07:08:34,426 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:34,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1711598696, now seen corresponding path program 1 times [2025-03-04 07:08:34,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:34,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221836763] [2025-03-04 07:08:34,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:34,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:34,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:34,429 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-04 07:08:34,430 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-04 07:08:34,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 07:08:34,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 07:08:34,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:34,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:34,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:08:34,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:08:34,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:34,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:34,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221836763] [2025-03-04 07:08:34,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221836763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:34,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:34,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:08:34,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153454986] [2025-03-04 07:08:34,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:34,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:08:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:34,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:08:34,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:08:34,965 INFO L87 Difference]: Start difference. First operand 322 states and 383 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:39,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:43,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:45,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:46,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:47,033 INFO L93 Difference]: Finished difference Result 341 states and 417 transitions. [2025-03-04 07:08:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:08:47,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2025-03-04 07:08:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:47,037 INFO L225 Difference]: With dead ends: 341 [2025-03-04 07:08:47,037 INFO L226 Difference]: Without dead ends: 341 [2025-03-04 07:08:47,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-04 07:08:47,037 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 407 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:47,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 395 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 12.0s Time] [2025-03-04 07:08:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-04 07:08:47,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 273. [2025-03-04 07:08:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 267 states have (on average 1.205992509363296) internal successors, (322), 268 states have internal predecessors, (322), 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-04 07:08:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 328 transitions. [2025-03-04 07:08:47,044 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 328 transitions. Word has length 82 [2025-03-04 07:08:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:47,044 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 328 transitions. [2025-03-04 07:08:47,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 328 transitions. [2025-03-04 07:08:47,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 07:08:47,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:47,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:08:47,057 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-04 07:08:47,251 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-04 07:08:47,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:47,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1962031304, now seen corresponding path program 1 times [2025-03-04 07:08:47,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:47,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [567488844] [2025-03-04 07:08:47,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:47,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:47,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:47,280 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-04 07:08:47,281 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-04 07:08:47,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 07:08:47,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 07:08:47,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:47,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:47,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:08:47,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:08:47,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:47,593 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:47,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567488844] [2025-03-04 07:08:47,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567488844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:47,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:47,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:08:47,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702778910] [2025-03-04 07:08:47,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:47,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:08:47,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:47,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:08:47,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:08:47,594 INFO L87 Difference]: Start difference. First operand 273 states and 328 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:47,693 INFO L93 Difference]: Finished difference Result 239 states and 272 transitions. [2025-03-04 07:08:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:08:47,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2025-03-04 07:08:47,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:47,694 INFO L225 Difference]: With dead ends: 239 [2025-03-04 07:08:47,694 INFO L226 Difference]: Without dead ends: 239 [2025-03-04 07:08:47,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 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-04 07:08:47,695 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 32 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:47,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 592 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:08:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-04 07:08:47,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-03-04 07:08:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 233 states have (on average 1.1416309012875536) internal successors, (266), 234 states have internal predecessors, (266), 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-04 07:08:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 272 transitions. [2025-03-04 07:08:47,699 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 272 transitions. Word has length 91 [2025-03-04 07:08:47,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:47,699 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 272 transitions. [2025-03-04 07:08:47,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:47,699 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 272 transitions. [2025-03-04 07:08:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 07:08:47,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:47,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:08:47,710 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-04 07:08:47,900 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-04 07:08:47,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:47,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:47,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1119212159, now seen corresponding path program 1 times [2025-03-04 07:08:47,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:47,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315771203] [2025-03-04 07:08:47,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:47,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:47,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:47,903 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-04 07:08:47,904 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-04 07:08:48,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 07:08:48,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 07:08:48,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:48,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:48,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:08:48,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:08:48,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:48,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:48,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315771203] [2025-03-04 07:08:48,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315771203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:48,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:48,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:08:48,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374128791] [2025-03-04 07:08:48,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:48,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:08:48,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:48,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:08:48,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:08:48,241 INFO L87 Difference]: Start difference. First operand 239 states and 272 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:52,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:56,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:59,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:59,808 INFO L93 Difference]: Finished difference Result 241 states and 274 transitions. [2025-03-04 07:08:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:08:59,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2025-03-04 07:08:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:59,812 INFO L225 Difference]: With dead ends: 241 [2025-03-04 07:08:59,812 INFO L226 Difference]: Without dead ends: 241 [2025-03-04 07:08:59,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 88 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-04 07:08:59,812 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 199 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:59,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 389 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 2 Unknown, 0 Unchecked, 11.6s Time] [2025-03-04 07:08:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-04 07:08:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2025-03-04 07:08:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 234 states have (on average 1.141025641025641) internal successors, (267), 235 states have internal predecessors, (267), 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-04 07:08:59,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 273 transitions. [2025-03-04 07:08:59,816 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 273 transitions. Word has length 91 [2025-03-04 07:08:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:59,816 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 273 transitions. [2025-03-04 07:08:59,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 273 transitions. [2025-03-04 07:08:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 07:08:59,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:59,817 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:08:59,829 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-04 07:09:00,017 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-04 07:09:00,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:00,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:00,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1119241950, now seen corresponding path program 1 times [2025-03-04 07:09:00,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:09:00,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19861104] [2025-03-04 07:09:00,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:00,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:09:00,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:09:00,020 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-04 07:09:00,022 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-04 07:09:00,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 07:09:00,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 07:09:00,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:00,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:00,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:09:00,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:09:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:09:00,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:09:00,363 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:09:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19861104] [2025-03-04 07:09:00,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19861104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:09:00,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:09:00,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:09:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535444046] [2025-03-04 07:09:00,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:09:00,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:09:00,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:09:00,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:09:00,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:09:00,364 INFO L87 Difference]: Start difference. First operand 240 states and 273 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:09:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:00,390 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2025-03-04 07:09:00,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:09:00,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2025-03-04 07:09:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:00,392 INFO L225 Difference]: With dead ends: 243 [2025-03-04 07:09:00,392 INFO L226 Difference]: Without dead ends: 243 [2025-03-04 07:09:00,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 88 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-04 07:09:00,393 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:00,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 656 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:09:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-04 07:09:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-03-04 07:09:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 236 states have (on average 1.1440677966101696) internal successors, (270), 238 states have internal predecessors, (270), 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-04 07:09:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 277 transitions. [2025-03-04 07:09:00,398 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 277 transitions. Word has length 91 [2025-03-04 07:09:00,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:00,398 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 277 transitions. [2025-03-04 07:09:00,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:09:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 277 transitions. [2025-03-04 07:09:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 07:09:00,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:00,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:09:00,411 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-04 07:09:00,600 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-04 07:09:00,600 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:00,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash -258463774, now seen corresponding path program 1 times [2025-03-04 07:09:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:09:00,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590556905] [2025-03-04 07:09:00,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:00,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:09:00,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:09:00,603 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-04 07:09:00,604 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-04 07:09:00,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 07:09:00,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 07:09:00,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:00,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:00,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:09:00,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:09:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:09:00,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:09:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:09:01,037 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:09:01,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590556905] [2025-03-04 07:09:01,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590556905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:09:01,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:09:01,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 07:09:01,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084474532] [2025-03-04 07:09:01,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:09:01,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:09:01,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:09:01,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:09:01,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:09:01,038 INFO L87 Difference]: Start difference. First operand 243 states and 277 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:09:01,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:01,152 INFO L93 Difference]: Finished difference Result 254 states and 294 transitions. [2025-03-04 07:09:01,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:09:01,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 93 [2025-03-04 07:09:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:01,154 INFO L225 Difference]: With dead ends: 254 [2025-03-04 07:09:01,154 INFO L226 Difference]: Without dead ends: 254 [2025-03-04 07:09:01,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:09:01,154 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 5 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:01,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 872 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:09:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-04 07:09:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2025-03-04 07:09:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 244 states have (on average 1.1639344262295082) internal successors, (284), 246 states have internal predecessors, (284), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 07:09:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 292 transitions. [2025-03-04 07:09:01,160 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 292 transitions. Word has length 93 [2025-03-04 07:09:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:01,161 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 292 transitions. [2025-03-04 07:09:01,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:09:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 292 transitions. [2025-03-04 07:09:01,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 07:09:01,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:01,162 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:09:01,174 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-04 07:09:01,362 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-04 07:09:01,363 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:01,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:01,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1022366430, now seen corresponding path program 2 times [2025-03-04 07:09:01,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:09:01,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [588894627] [2025-03-04 07:09:01,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:09:01,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:09:01,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:09:01,366 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-04 07:09:01,368 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-04 07:09:01,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-03-04 07:09:01,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 07:09:01,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:09:01,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:01,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:09:01,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:09:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:09:01,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:09:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:09:01,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:09:01,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588894627] [2025-03-04 07:09:01,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588894627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:09:01,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:09:01,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-04 07:09:01,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633844953] [2025-03-04 07:09:01,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:09:01,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:09:01,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:09:01,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:09:01,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:09:01,945 INFO L87 Difference]: Start difference. First operand 252 states and 292 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:09:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:02,160 INFO L93 Difference]: Finished difference Result 260 states and 302 transitions. [2025-03-04 07:09:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:09:02,160 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 97 [2025-03-04 07:09:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:02,161 INFO L225 Difference]: With dead ends: 260 [2025-03-04 07:09:02,161 INFO L226 Difference]: Without dead ends: 258 [2025-03-04 07:09:02,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:09:02,162 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 6 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:02,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1310 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:09:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-04 07:09:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2025-03-04 07:09:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 248 states have (on average 1.1693548387096775) internal successors, (290), 250 states have internal predecessors, (290), 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-04 07:09:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 297 transitions. [2025-03-04 07:09:02,167 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 297 transitions. Word has length 97 [2025-03-04 07:09:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:02,167 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 297 transitions. [2025-03-04 07:09:02,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:09:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 297 transitions. [2025-03-04 07:09:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 07:09:02,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:02,168 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:09:02,180 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-04 07:09:02,372 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-04 07:09:02,372 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:02,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:02,372 INFO L85 PathProgramCache]: Analyzing trace with hash -696204066, now seen corresponding path program 3 times [2025-03-04 07:09:02,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:09:02,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186161316] [2025-03-04 07:09:02,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:09:02,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:09:02,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:09:02,374 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-04 07:09:02,375 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-04 07:09:02,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 101 statements into 6 equivalence classes. [2025-03-04 07:09:02,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 84 of 101 statements. [2025-03-04 07:09:02,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:09:02,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:02,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:09:02,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:09:03,021 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:09:03,022 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:09:03,022 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:09:03,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-03-04 07:09:03,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:09:03,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-03-04 07:09:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 07:09:03,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:09:03,107 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:09:03,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186161316] [2025-03-04 07:09:03,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186161316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:09:03,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:09:03,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:09:03,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549179649] [2025-03-04 07:09:03,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:09:03,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:09:03,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:09:03,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:09:03,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:09:03,108 INFO L87 Difference]: Start difference. First operand 256 states and 297 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:09:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:03,389 INFO L93 Difference]: Finished difference Result 322 states and 370 transitions. [2025-03-04 07:09:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:09:03,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-04 07:09:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:03,391 INFO L225 Difference]: With dead ends: 322 [2025-03-04 07:09:03,391 INFO L226 Difference]: Without dead ends: 322 [2025-03-04 07:09:03,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:09:03,392 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 285 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:03,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 673 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:09:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-04 07:09:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 258. [2025-03-04 07:09:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 250 states have (on average 1.168) internal successors, (292), 252 states have internal predecessors, (292), 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-04 07:09:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 299 transitions. [2025-03-04 07:09:03,399 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 299 transitions. Word has length 101 [2025-03-04 07:09:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:03,399 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 299 transitions. [2025-03-04 07:09:03,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:09:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 299 transitions. [2025-03-04 07:09:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 07:09:03,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:03,401 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:09:03,412 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-04 07:09:03,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:09:03,602 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:03,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:03,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1439254276, now seen corresponding path program 1 times [2025-03-04 07:09:03,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:09:03,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860969720] [2025-03-04 07:09:03,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:03,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:09:03,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:09:03,606 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:09:03,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 07:09:03,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 07:09:04,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 07:09:04,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:04,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:04,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:09:04,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:09:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:09:04,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:09:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:09:04,375 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:09:04,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860969720] [2025-03-04 07:09:04,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860969720] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:09:04,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:09:04,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-04 07:09:04,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586535261] [2025-03-04 07:09:04,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:09:04,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:09:04,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:09:04,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:09:04,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:09:04,376 INFO L87 Difference]: Start difference. First operand 258 states and 299 transitions. Second operand has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:09:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:04,829 INFO L93 Difference]: Finished difference Result 270 states and 315 transitions. [2025-03-04 07:09:04,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:09:04,829 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 134 [2025-03-04 07:09:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:04,830 INFO L225 Difference]: With dead ends: 270 [2025-03-04 07:09:04,830 INFO L226 Difference]: Without dead ends: 266 [2025-03-04 07:09:04,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:09:04,831 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 7 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:04,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1312 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:09:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-04 07:09:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2025-03-04 07:09:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 256 states have (on average 1.1796875) internal successors, (302), 258 states have internal predecessors, (302), 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-04 07:09:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 309 transitions. [2025-03-04 07:09:04,836 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 309 transitions. Word has length 134 [2025-03-04 07:09:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:04,836 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 309 transitions. [2025-03-04 07:09:04,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:09:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 309 transitions. [2025-03-04 07:09:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 07:09:04,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:04,837 INFO L218 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:09:04,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 07:09:05,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:09:05,038 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:05,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:05,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1429785220, now seen corresponding path program 2 times [2025-03-04 07:09:05,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:09:05,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799452697] [2025-03-04 07:09:05,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:09:05,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:09:05,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:09:05,042 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-04 07:09:05,043 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-04 07:09:05,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes. [2025-03-04 07:09:05,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 07:09:05,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:09:05,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:05,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:09:05,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:09:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 82 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 07:09:05,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:09:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 07:09:06,057 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:09:06,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799452697] [2025-03-04 07:09:06,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799452697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:09:06,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:09:06,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-04 07:09:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285881400] [2025-03-04 07:09:06,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:09:06,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:09:06,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:09:06,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:09:06,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:09:06,059 INFO L87 Difference]: Start difference. First operand 264 states and 309 transitions. Second operand has 18 states, 18 states have (on average 7.777777777777778) internal successors, (140), 18 states have internal predecessors, (140), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:09:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:06,877 INFO L93 Difference]: Finished difference Result 278 states and 328 transitions. [2025-03-04 07:09:06,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 07:09:06,878 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.777777777777778) internal successors, (140), 18 states have internal predecessors, (140), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 140 [2025-03-04 07:09:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:06,878 INFO L225 Difference]: With dead ends: 278 [2025-03-04 07:09:06,878 INFO L226 Difference]: Without dead ends: 272 [2025-03-04 07:09:06,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=324, Invalid=606, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:09:06,879 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 9 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:06,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1755 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:09:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-04 07:09:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-03-04 07:09:06,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 264 states have (on average 1.1704545454545454) internal successors, (309), 266 states have internal predecessors, (309), 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-04 07:09:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 316 transitions. [2025-03-04 07:09:06,884 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 316 transitions. Word has length 140 [2025-03-04 07:09:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:06,884 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 316 transitions. [2025-03-04 07:09:06,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.777777777777778) internal successors, (140), 18 states have internal predecessors, (140), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:09:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 316 transitions. [2025-03-04 07:09:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 07:09:06,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:06,886 INFO L218 NwaCegarLoop]: trace histogram [24, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:09:06,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 07:09:07,086 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-04 07:09:07,087 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:07,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:07,087 INFO L85 PathProgramCache]: Analyzing trace with hash -68557180, now seen corresponding path program 3 times [2025-03-04 07:09:07,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:09:07,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791855570] [2025-03-04 07:09:07,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:09:07,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:09:07,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:09:07,089 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-04 07:09:07,090 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-04 07:09:07,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 148 statements into 10 equivalence classes.