./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:12:04,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:12:05,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:12:05,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:12:05,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:12:05,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:12:05,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:12:05,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:12:05,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:12:05,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:12:05,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:12:05,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:12:05,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:12:05,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:12:05,062 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:12:05,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:12:05,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:12:05,064 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:12:05,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:12:05,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:12:05,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:12:05,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:12:05,069 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:12:05,070 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:12:05,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:12:05,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:12:05,070 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:12:05,071 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:12:05,071 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:12:05,071 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:12:05,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:12:05,072 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:12:05,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:12:05,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:12:05,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:12:05,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:12:05,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:12:05,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:12:05,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:12:05,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:12:05,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:12:05,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:12:05,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:12:05,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:12:05,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:12:05,075 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-10-13 10:12:05,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:12:05,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:12:05,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:12:05,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:12:05,355 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:12:05,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2024-10-13 10:12:06,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:12:07,070 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:12:07,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2024-10-13 10:12:07,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d390000bd/a4d6e0a4ea8446ee88a1b5376c70550c/FLAG72c0d4b46 [2024-10-13 10:12:07,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d390000bd/a4d6e0a4ea8446ee88a1b5376c70550c [2024-10-13 10:12:07,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:12:07,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:12:07,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:12:07,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:12:07,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:12:07,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:12:07" (1/1) ... [2024-10-13 10:12:07,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@367b4a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:07, skipping insertion in model container [2024-10-13 10:12:07,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:12:07" (1/1) ... [2024-10-13 10:12:07,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:12:07,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:12:07,825 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 10:12:07,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@56b2083a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:07, skipping insertion in model container [2024-10-13 10:12:07,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:12:07,826 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:12:07,829 INFO L158 Benchmark]: Toolchain (without parser) took 713.25ms. Allocated memory was 127.9MB in the beginning and 176.2MB in the end (delta: 48.2MB). Free memory was 56.6MB in the beginning and 133.7MB in the end (delta: -77.1MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-10-13 10:12:07,830 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 127.9MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:12:07,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 709.52ms. Allocated memory was 127.9MB in the beginning and 176.2MB in the end (delta: 48.2MB). Free memory was 56.6MB in the beginning and 133.7MB in the end (delta: -77.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-10-13 10:12:07,832 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 127.9MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 709.52ms. Allocated memory was 127.9MB in the beginning and 176.2MB in the end (delta: 48.2MB). Free memory was 56.6MB in the beginning and 133.7MB in the end (delta: -77.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 740]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:12:09,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:12:10,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:12:10,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:12:10,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:12:10,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:12:10,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:12:10,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:12:10,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:12:10,112 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:12:10,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:12:10,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:12:10,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:12:10,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:12:10,117 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:12:10,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:12:10,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:12:10,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:12:10,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:12:10,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:12:10,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:12:10,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:12:10,124 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:12:10,124 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:12:10,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:12:10,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:12:10,124 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:12:10,125 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:12:10,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:12:10,125 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:12:10,125 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:12:10,126 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:12:10,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:12:10,126 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:12:10,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:12:10,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:12:10,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:12:10,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:12:10,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:12:10,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:12:10,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:12:10,130 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:12:10,131 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:12:10,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:12:10,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:12:10,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:12:10,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:12:10,132 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:12:10,133 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-10-13 10:12:10,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:12:10,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:12:10,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:12:10,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:12:10,571 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:12:10,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2024-10-13 10:12:12,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:12:12,638 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:12:12,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2024-10-13 10:12:12,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a577e0d/66119b017ca145c6a11f81564ce0e587/FLAG7847cbf82 [2024-10-13 10:12:12,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a577e0d/66119b017ca145c6a11f81564ce0e587 [2024-10-13 10:12:12,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:12:12,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:12:12,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:12:12,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:12:12,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:12:12,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:12:12" (1/1) ... [2024-10-13 10:12:12,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425cad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:12, skipping insertion in model container [2024-10-13 10:12:12,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:12:12" (1/1) ... [2024-10-13 10:12:12,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:12:13,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:12:13,557 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:12:13,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:12:13,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:12:13,704 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:12:13,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:12:13,839 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:12:13,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13 WrapperNode [2024-10-13 10:12:13,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:12:13,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:12:13,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:12:13,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:12:13,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13" (1/1) ... [2024-10-13 10:12:13,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13" (1/1) ... [2024-10-13 10:12:13,978 INFO L138 Inliner]: procedures = 179, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1431 [2024-10-13 10:12:13,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:12:13,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:12:13,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:12:13,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:12:13,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13" (1/1) ... [2024-10-13 10:12:13,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13" (1/1) ... [2024-10-13 10:12:14,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13" (1/1) ... [2024-10-13 10:12:14,158 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-10-13 10:12:14,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13" (1/1) ... [2024-10-13 10:12:14,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13" (1/1) ... [2024-10-13 10:12:14,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13" (1/1) ... [2024-10-13 10:12:14,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13" (1/1) ... [2024-10-13 10:12:14,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13" (1/1) ... [2024-10-13 10:12:14,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13" (1/1) ... [2024-10-13 10:12:14,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:12:14,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:12:14,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:12:14,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:12:14,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13" (1/1) ... [2024-10-13 10:12:14,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:12:14,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:12:14,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:12:14,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:12:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 10:12:14,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 10:12:14,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:12:14,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:12:14,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 10:12:14,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 10:12:14,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 10:12:14,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 10:12:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:12:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:12:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:12:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:12:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:12:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:12:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:12:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:12:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:12:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:12:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:12:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:12:14,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:12:14,703 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:12:14,706 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:12:29,734 INFO L? ?]: Removed 200 outVars from TransFormulas that were not future-live. [2024-10-13 10:12:29,735 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:12:29,789 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:12:29,791 INFO L314 CfgBuilder]: Removed 77 assume(true) statements. [2024-10-13 10:12:29,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:12:29 BoogieIcfgContainer [2024-10-13 10:12:29,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:12:29,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:12:29,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:12:29,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:12:29,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:12:12" (1/3) ... [2024-10-13 10:12:29,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27698d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:12:29, skipping insertion in model container [2024-10-13 10:12:29,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:12:13" (2/3) ... [2024-10-13 10:12:29,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27698d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:12:29, skipping insertion in model container [2024-10-13 10:12:29,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:12:29" (3/3) ... [2024-10-13 10:12:29,802 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test4-3.i [2024-10-13 10:12:29,820 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:12:29,821 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:12:29,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:12:29,892 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;@4f25f322, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:12:29,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:12:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 246 states, 236 states have (on average 1.6694915254237288) internal successors, (394), 238 states have internal predecessors, (394), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:12:29,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:12:29,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:12:29,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:12:29,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:12:29,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:12:29,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1021285, now seen corresponding path program 1 times [2024-10-13 10:12:29,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:12:29,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029612109] [2024-10-13 10:12:29,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:12:29,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:12:29,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:12:29,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:12:29,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 10:12:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:12:30,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 10:12:30,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:12:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:12:30,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:12:30,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:12:30,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029612109] [2024-10-13 10:12:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029612109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:12:30,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:12:30,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:12:30,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692774404] [2024-10-13 10:12:30,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:12:30,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:12:30,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:12:30,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:12:30,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:12:30,243 INFO L87 Difference]: Start difference. First operand has 246 states, 236 states have (on average 1.6694915254237288) internal successors, (394), 238 states have internal predecessors, (394), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:12:34,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:12:38,443 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 [] [2024-10-13 10:12:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:12:39,696 INFO L93 Difference]: Finished difference Result 308 states and 403 transitions. [2024-10-13 10:12:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:12:39,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 10:12:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:12:39,714 INFO L225 Difference]: With dead ends: 308 [2024-10-13 10:12:39,714 INFO L226 Difference]: Without dead ends: 305 [2024-10-13 10:12:39,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:12:39,719 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 80 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:12:39,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 644 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2024-10-13 10:12:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-13 10:12:39,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 255. [2024-10-13 10:12:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 246 states have (on average 1.3048780487804879) internal successors, (321), 247 states have internal predecessors, (321), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:12:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 333 transitions. [2024-10-13 10:12:39,813 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 333 transitions. Word has length 3 [2024-10-13 10:12:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:12:39,813 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 333 transitions. [2024-10-13 10:12:39,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:12:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 333 transitions. [2024-10-13 10:12:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:12:39,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:12:39,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:12:39,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 10:12:40,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:12:40,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:12:40,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:12:40,034 INFO L85 PathProgramCache]: Analyzing trace with hash -475425146, now seen corresponding path program 1 times [2024-10-13 10:12:40,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:12:40,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572109127] [2024-10-13 10:12:40,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:12:40,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:12:40,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:12:40,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:12:40,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 10:12:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:12:40,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:12:40,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:12:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:12:40,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:12:40,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:12:40,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572109127] [2024-10-13 10:12:40,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572109127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:12:40,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:12:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:12:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265423618] [2024-10-13 10:12:40,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:12:40,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:12:40,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:12:40,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:12:40,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:12:40,282 INFO L87 Difference]: Start difference. First operand 255 states and 333 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:12:44,878 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 [] [2024-10-13 10:12:49,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:12:55,471 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 [] [2024-10-13 10:12:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:12:56,256 INFO L93 Difference]: Finished difference Result 375 states and 488 transitions. [2024-10-13 10:12:56,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:12:56,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 10:12:56,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:12:56,260 INFO L225 Difference]: With dead ends: 375 [2024-10-13 10:12:56,260 INFO L226 Difference]: Without dead ends: 375 [2024-10-13 10:12:56,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:12:56,261 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 156 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:12:56,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 863 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 3 Unknown, 0 Unchecked, 15.9s Time] [2024-10-13 10:12:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-13 10:12:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-10-13 10:12:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 363 states have (on average 1.2947658402203857) internal successors, (470), 364 states have internal predecessors, (470), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:12:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 488 transitions. [2024-10-13 10:12:56,289 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 488 transitions. Word has length 10 [2024-10-13 10:12:56,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:12:56,289 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 488 transitions. [2024-10-13 10:12:56,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:12:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 488 transitions. [2024-10-13 10:12:56,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:12:56,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:12:56,291 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:12:56,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 10:12:56,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:12:56,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:12:56,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:12:56,493 INFO L85 PathProgramCache]: Analyzing trace with hash 214148145, now seen corresponding path program 1 times [2024-10-13 10:12:56,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:12:56,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762771464] [2024-10-13 10:12:56,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:12:56,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:12:56,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:12:56,497 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:12:56,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 10:12:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:12:56,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:12:56,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:12:56,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:12:56,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:12:56,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:12:56,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762771464] [2024-10-13 10:12:56,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762771464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:12:56,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:12:56,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:12:56,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982042246] [2024-10-13 10:12:56,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:12:56,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:12:56,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:12:56,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:12:56,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:12:56,804 INFO L87 Difference]: Start difference. First operand 375 states and 488 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:12:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:12:57,448 INFO L93 Difference]: Finished difference Result 426 states and 554 transitions. [2024-10-13 10:12:57,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:12:57,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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 25 [2024-10-13 10:12:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:12:57,456 INFO L225 Difference]: With dead ends: 426 [2024-10-13 10:12:57,456 INFO L226 Difference]: Without dead ends: 426 [2024-10-13 10:12:57,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:12:57,457 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 120 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:12:57,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 593 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:12:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-10-13 10:12:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 373. [2024-10-13 10:12:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 361 states have (on average 1.290858725761773) internal successors, (466), 362 states have internal predecessors, (466), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:12:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 484 transitions. [2024-10-13 10:12:57,483 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 484 transitions. Word has length 25 [2024-10-13 10:12:57,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:12:57,483 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 484 transitions. [2024-10-13 10:12:57,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:12:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 484 transitions. [2024-10-13 10:12:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:12:57,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:12:57,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:12:57,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 10:12:57,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:12:57,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:12:57,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:12:57,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1474795597, now seen corresponding path program 1 times [2024-10-13 10:12:57,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:12:57,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950358760] [2024-10-13 10:12:57,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:12:57,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:12:57,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:12:57,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:12:57,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 10:12:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:12:57,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:12:57,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:12:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:12:57,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:12:57,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:12:57,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950358760] [2024-10-13 10:12:57,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950358760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:12:57,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:12:57,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:12:57,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973615533] [2024-10-13 10:12:57,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:12:57,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:12:57,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:12:57,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:12:57,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:12:57,947 INFO L87 Difference]: Start difference. First operand 373 states and 484 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:13:02,324 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 [] [2024-10-13 10:13:06,333 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 [] [2024-10-13 10:13:12,141 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 [] [2024-10-13 10:13:16,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:13:22,663 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 [] [2024-10-13 10:13:25,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:13:28,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:13:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:29,868 INFO L93 Difference]: Finished difference Result 547 states and 712 transitions. [2024-10-13 10:13:29,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:13:29,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2024-10-13 10:13:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:29,876 INFO L225 Difference]: With dead ends: 547 [2024-10-13 10:13:29,876 INFO L226 Difference]: Without dead ends: 541 [2024-10-13 10:13:29,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:13:29,877 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 217 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:29,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 845 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 5 Unknown, 0 Unchecked, 31.9s Time] [2024-10-13 10:13:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-10-13 10:13:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 369. [2024-10-13 10:13:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 357 states have (on average 1.2913165266106443) internal successors, (461), 358 states have internal predecessors, (461), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:13:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 479 transitions. [2024-10-13 10:13:29,893 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 479 transitions. Word has length 25 [2024-10-13 10:13:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:29,894 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 479 transitions. [2024-10-13 10:13:29,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:13:29,894 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 479 transitions. [2024-10-13 10:13:29,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 10:13:29,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:29,905 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:29,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 10:13:30,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:30,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:30,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:30,107 INFO L85 PathProgramCache]: Analyzing trace with hash 884065145, now seen corresponding path program 1 times [2024-10-13 10:13:30,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:30,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244976219] [2024-10-13 10:13:30,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:13:30,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:30,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:30,110 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:13:30,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 10:13:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:13:30,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:13:30,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 10:13:30,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:13:30,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:30,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244976219] [2024-10-13 10:13:30,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244976219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:13:30,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:13:30,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:13:30,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74803337] [2024-10-13 10:13:30,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:13:30,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:13:30,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:30,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:13:30,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:13:30,929 INFO L87 Difference]: Start difference. First operand 369 states and 479 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:13:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:31,088 INFO L93 Difference]: Finished difference Result 375 states and 469 transitions. [2024-10-13 10:13:31,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:13:31,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 142 [2024-10-13 10:13:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:31,091 INFO L225 Difference]: With dead ends: 375 [2024-10-13 10:13:31,091 INFO L226 Difference]: Without dead ends: 375 [2024-10-13 10:13:31,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:13:31,092 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 41 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:31,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 828 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:13:31,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-13 10:13:31,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-10-13 10:13:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 363 states have (on average 1.2424242424242424) internal successors, (451), 364 states have internal predecessors, (451), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:13:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 469 transitions. [2024-10-13 10:13:31,102 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 469 transitions. Word has length 142 [2024-10-13 10:13:31,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:31,102 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 469 transitions. [2024-10-13 10:13:31,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:13:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 469 transitions. [2024-10-13 10:13:31,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 10:13:31,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:31,106 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:31,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 10:13:31,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:31,307 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:31,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:31,308 INFO L85 PathProgramCache]: Analyzing trace with hash 489388583, now seen corresponding path program 1 times [2024-10-13 10:13:31,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:31,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571020838] [2024-10-13 10:13:31,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:13:31,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:31,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:31,312 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:13:31,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 10:13:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:13:32,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:13:32,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 10:13:32,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:13:32,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:32,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571020838] [2024-10-13 10:13:32,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571020838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:13:32,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:13:32,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:13:32,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643540681] [2024-10-13 10:13:32,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:13:32,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:13:32,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:32,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:13:32,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:13:32,171 INFO L87 Difference]: Start difference. First operand 375 states and 469 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:13:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:32,305 INFO L93 Difference]: Finished difference Result 363 states and 449 transitions. [2024-10-13 10:13:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:13:32,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 142 [2024-10-13 10:13:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:32,307 INFO L225 Difference]: With dead ends: 363 [2024-10-13 10:13:32,307 INFO L226 Difference]: Without dead ends: 363 [2024-10-13 10:13:32,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:13:32,308 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 9 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:32,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 829 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:13:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-13 10:13:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2024-10-13 10:13:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 351 states have (on average 1.227920227920228) internal successors, (431), 352 states have internal predecessors, (431), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:13:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 449 transitions. [2024-10-13 10:13:32,317 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 449 transitions. Word has length 142 [2024-10-13 10:13:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:32,318 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 449 transitions. [2024-10-13 10:13:32,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:13:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 449 transitions. [2024-10-13 10:13:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 10:13:32,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:32,320 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:32,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 10:13:32,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:32,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:32,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:32,522 INFO L85 PathProgramCache]: Analyzing trace with hash 191264815, now seen corresponding path program 1 times [2024-10-13 10:13:32,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:32,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383277437] [2024-10-13 10:13:32,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:13:32,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:32,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:32,527 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:13:32,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 10:13:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:13:33,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:13:33,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 10:13:33,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:13:33,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:33,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383277437] [2024-10-13 10:13:33,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383277437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:13:33,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:13:33,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:13:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28527054] [2024-10-13 10:13:33,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:13:33,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:13:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:33,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:13:33,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:13:33,255 INFO L87 Difference]: Start difference. First operand 363 states and 449 transitions. Second operand has 4 states, 3 states have (on average 43.333333333333336) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:13:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:33,371 INFO L93 Difference]: Finished difference Result 365 states and 454 transitions. [2024-10-13 10:13:33,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:13:33,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 43.333333333333336) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 142 [2024-10-13 10:13:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:33,376 INFO L225 Difference]: With dead ends: 365 [2024-10-13 10:13:33,376 INFO L226 Difference]: Without dead ends: 365 [2024-10-13 10:13:33,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:13:33,377 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 0 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:33,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 878 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:13:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-13 10:13:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-10-13 10:13:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 352 states have (on average 1.2301136363636365) internal successors, (433), 354 states have internal predecessors, (433), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:13:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 454 transitions. [2024-10-13 10:13:33,387 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 454 transitions. Word has length 142 [2024-10-13 10:13:33,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:33,388 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 454 transitions. [2024-10-13 10:13:33,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 43.333333333333336) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:13:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 454 transitions. [2024-10-13 10:13:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 10:13:33,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:33,390 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:33,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 10:13:33,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:33,591 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:33,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1686193135, now seen corresponding path program 1 times [2024-10-13 10:13:33,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:33,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124728245] [2024-10-13 10:13:33,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:13:33,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:33,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:33,594 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:13:33,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 10:13:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:13:34,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:13:34,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 10:13:34,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:13:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:13:34,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:34,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124728245] [2024-10-13 10:13:34,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124728245] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:13:34,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:13:34,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:13:34,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255935163] [2024-10-13 10:13:34,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:13:34,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:13:34,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:34,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:13:34,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:13:34,465 INFO L87 Difference]: Start difference. First operand 365 states and 454 transitions. Second operand has 8 states, 6 states have (on average 23.0) internal successors, (138), 8 states have internal predecessors, (138), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:13:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:34,703 INFO L93 Difference]: Finished difference Result 374 states and 470 transitions. [2024-10-13 10:13:34,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:13:34,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 23.0) internal successors, (138), 8 states have internal predecessors, (138), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 146 [2024-10-13 10:13:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:34,708 INFO L225 Difference]: With dead ends: 374 [2024-10-13 10:13:34,708 INFO L226 Difference]: Without dead ends: 374 [2024-10-13 10:13:34,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:13:34,709 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 4 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:34,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1450 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:13:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-13 10:13:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2024-10-13 10:13:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 359 states have (on average 1.2423398328690807) internal successors, (446), 361 states have internal predecessors, (446), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:13:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 467 transitions. [2024-10-13 10:13:34,721 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 467 transitions. Word has length 146 [2024-10-13 10:13:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:34,721 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 467 transitions. [2024-10-13 10:13:34,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 23.0) internal successors, (138), 8 states have internal predecessors, (138), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:13:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 467 transitions. [2024-10-13 10:13:34,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 10:13:34,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:34,723 INFO L215 NwaCegarLoop]: trace histogram [12, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:34,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 10:13:34,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:34,924 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:34,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:34,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2095099857, now seen corresponding path program 2 times [2024-10-13 10:13:34,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:34,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430963460] [2024-10-13 10:13:34,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:13:34,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:34,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:34,927 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:13:34,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 10:13:35,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:13:35,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:13:35,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:13:35,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-13 10:13:35,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:13:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-13 10:13:35,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:35,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430963460] [2024-10-13 10:13:35,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430963460] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:13:35,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:13:35,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:13:35,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013243368] [2024-10-13 10:13:35,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:13:35,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:13:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:13:35,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:13:35,974 INFO L87 Difference]: Start difference. First operand 373 states and 467 transitions. Second operand has 14 states, 12 states have (on average 12.0) internal successors, (144), 14 states have internal predecessors, (144), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:13:36,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:36,683 INFO L93 Difference]: Finished difference Result 385 states and 488 transitions. [2024-10-13 10:13:36,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:13:36,685 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 12.0) internal successors, (144), 14 states have internal predecessors, (144), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 154 [2024-10-13 10:13:36,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:36,687 INFO L225 Difference]: With dead ends: 385 [2024-10-13 10:13:36,688 INFO L226 Difference]: Without dead ends: 383 [2024-10-13 10:13:36,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:13:36,691 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 8 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:36,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2035 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:13:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-13 10:13:36,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 382. [2024-10-13 10:13:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 368 states have (on average 1.2445652173913044) internal successors, (458), 370 states have internal predecessors, (458), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:13:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 479 transitions. [2024-10-13 10:13:36,707 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 479 transitions. Word has length 154 [2024-10-13 10:13:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:36,707 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 479 transitions. [2024-10-13 10:13:36,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 12.0) internal successors, (144), 14 states have internal predecessors, (144), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:13:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 479 transitions. [2024-10-13 10:13:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 10:13:36,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:36,710 INFO L215 NwaCegarLoop]: trace histogram [30, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:36,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 10:13:36,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:36,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:36,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:36,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1997667411, now seen corresponding path program 3 times [2024-10-13 10:13:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:36,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964715893] [2024-10-13 10:13:36,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:13:36,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:36,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:36,914 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:13:36,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 10:13:38,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-13 10:13:38,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:13:38,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:13:38,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 172 proven. 15 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-10-13 10:13:39,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:13:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 172 proven. 15 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-10-13 10:13:39,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:39,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964715893] [2024-10-13 10:13:39,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964715893] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:13:39,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:13:39,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-13 10:13:39,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449416320] [2024-10-13 10:13:39,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:13:39,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 10:13:39,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:39,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 10:13:39,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:13:39,573 INFO L87 Difference]: Start difference. First operand 382 states and 479 transitions. Second operand has 16 states, 14 states have (on average 10.214285714285714) internal successors, (143), 16 states have internal predecessors, (143), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 10:13:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:40,691 INFO L93 Difference]: Finished difference Result 391 states and 496 transitions. [2024-10-13 10:13:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 10:13:40,692 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 10.214285714285714) internal successors, (143), 16 states have internal predecessors, (143), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 172 [2024-10-13 10:13:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:40,693 INFO L225 Difference]: With dead ends: 391 [2024-10-13 10:13:40,694 INFO L226 Difference]: Without dead ends: 390 [2024-10-13 10:13:40,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-10-13 10:13:40,695 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 8 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:40,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2311 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:13:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-13 10:13:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2024-10-13 10:13:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 375 states have (on average 1.256) internal successors, (471), 377 states have internal predecessors, (471), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:13:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 492 transitions. [2024-10-13 10:13:40,704 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 492 transitions. Word has length 172 [2024-10-13 10:13:40,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:40,705 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 492 transitions. [2024-10-13 10:13:40,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 10.214285714285714) internal successors, (143), 16 states have internal predecessors, (143), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 10:13:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 492 transitions. [2024-10-13 10:13:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-13 10:13:40,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:40,707 INFO L215 NwaCegarLoop]: trace histogram [44, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:40,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 10:13:40,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:40,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:40,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash -565499857, now seen corresponding path program 4 times [2024-10-13 10:13:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:40,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037306054] [2024-10-13 10:13:40,910 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 10:13:40,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:13:40,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:40,911 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:13:40,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process