./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_BER_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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-dev-84cfde4 [2024-10-11 17:25:26,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:25:26,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-11 17:25:26,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:25:26,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:25:26,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:25:26,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:25:26,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:25:26,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:25:26,278 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:25:26,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:25:26,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:25:26,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:25:26,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:25:26,281 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:25:26,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:25:26,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:25:26,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:25:26,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:25:26,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:25:26,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:25:26,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:25:26,287 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:25:26,287 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:25:26,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:25:26,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:25:26,288 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:25:26,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:25:26,288 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:25:26,288 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:25:26,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:25:26,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:25:26,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:25:26,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:25:26,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:25:26,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:25:26,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:25:26,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:25:26,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:25:26,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:25:26,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:25:26,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:25:26,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:25:26,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:25:26,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:25:26,293 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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-11 17:25:26,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:25:26,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:25:26,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:25:26,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:25:26,537 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:25:26,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i [2024-10-11 17:25:27,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:25:28,320 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:25:28,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i [2024-10-11 17:25:28,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b16ee3ddf/ff66635dd810444fa57b0a6f5998f35b/FLAG46fa27de5 [2024-10-11 17:25:28,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b16ee3ddf/ff66635dd810444fa57b0a6f5998f35b [2024-10-11 17:25:28,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:25:28,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:25:28,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:25:28,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:25:28,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:25:28,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:25:28" (1/1) ... [2024-10-11 17:25:28,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e44dc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:28, skipping insertion in model container [2024-10-11 17:25:28,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:25:28" (1/1) ... [2024-10-11 17:25:28,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:25:28,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:25:28,993 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 17:25:28,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@59709300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:28, skipping insertion in model container [2024-10-11 17:25:28,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:25:28,994 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 17:25:28,997 INFO L158 Benchmark]: Toolchain (without parser) took 639.76ms. Allocated memory is still 161.5MB. Free memory was 90.0MB in the beginning and 66.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 17:25:28,997 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:25:28,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.57ms. Allocated memory is still 161.5MB. Free memory was 90.0MB in the beginning and 66.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 17:25:28,999 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.17ms. Allocated memory is still 121.6MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.57ms. Allocated memory is still 161.5MB. Free memory was 90.0MB in the beginning and 66.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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-dev-84cfde4 [2024-10-11 17:25:31,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:25:31,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-11 17:25:31,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:25:31,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:25:31,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:25:31,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:25:31,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:25:31,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:25:31,179 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:25:31,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:25:31,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:25:31,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:25:31,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:25:31,183 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:25:31,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:25:31,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:25:31,184 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:25:31,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:25:31,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:25:31,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:25:31,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:25:31,189 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:25:31,189 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:25:31,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:25:31,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:25:31,190 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:25:31,190 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 17:25:31,190 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:25:31,191 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 17:25:31,191 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:25:31,191 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:25:31,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:25:31,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:25:31,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:25:31,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:25:31,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:25:31,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:25:31,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:25:31,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:25:31,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:25:31,194 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 17:25:31,195 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 17:25:31,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:25:31,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:25:31,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:25:31,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:25:31,196 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 17:25:31,196 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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-11 17:25:31,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:25:31,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:25:31,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:25:31,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:25:31,509 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:25:31,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i [2024-10-11 17:25:33,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:25:33,367 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:25:33,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i [2024-10-11 17:25:33,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6354bbf05/d28b0e2ee6e547708f69e4a7d51665c6/FLAG718e9be31 [2024-10-11 17:25:33,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6354bbf05/d28b0e2ee6e547708f69e4a7d51665c6 [2024-10-11 17:25:33,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:25:33,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:25:33,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:25:33,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:25:33,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:25:33,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:25:33" (1/1) ... [2024-10-11 17:25:33,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bbc0236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:33, skipping insertion in model container [2024-10-11 17:25:33,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:25:33" (1/1) ... [2024-10-11 17:25:33,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:25:34,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:25:34,074 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 17:25:34,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:25:34,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:25:34,222 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:25:34,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:25:34,349 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:25:34,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34 WrapperNode [2024-10-11 17:25:34,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:25:34,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:25:34,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:25:34,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:25:34,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34" (1/1) ... [2024-10-11 17:25:34,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34" (1/1) ... [2024-10-11 17:25:34,489 INFO L138 Inliner]: procedures = 179, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1431 [2024-10-11 17:25:34,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:25:34,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:25:34,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:25:34,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:25:34,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34" (1/1) ... [2024-10-11 17:25:34,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34" (1/1) ... [2024-10-11 17:25:34,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34" (1/1) ... [2024-10-11 17:25:34,642 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-11 17:25:34,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34" (1/1) ... [2024-10-11 17:25:34,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34" (1/1) ... [2024-10-11 17:25:34,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34" (1/1) ... [2024-10-11 17:25:34,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34" (1/1) ... [2024-10-11 17:25:34,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34" (1/1) ... [2024-10-11 17:25:34,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34" (1/1) ... [2024-10-11 17:25:34,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:25:34,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:25:34,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:25:34,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:25:34,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34" (1/1) ... [2024-10-11 17:25:34,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:25:34,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:25:34,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:25:34,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:25:34,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 17:25:34,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 17:25:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 17:25:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 17:25:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 17:25:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 17:25:34,859 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 17:25:34,860 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 17:25:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:25:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:25:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:25:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:25:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:25:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:25:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:25:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 17:25:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 17:25:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 17:25:34,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 17:25:34,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:25:34,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:25:35,149 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:25:35,152 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:25:48,824 INFO L? ?]: Removed 200 outVars from TransFormulas that were not future-live. [2024-10-11 17:25:48,824 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:25:48,870 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:25:48,871 INFO L314 CfgBuilder]: Removed 77 assume(true) statements. [2024-10-11 17:25:48,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:25:48 BoogieIcfgContainer [2024-10-11 17:25:48,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:25:48,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:25:48,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:25:48,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:25:48,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:25:33" (1/3) ... [2024-10-11 17:25:48,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e21d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:25:48, skipping insertion in model container [2024-10-11 17:25:48,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:25:34" (2/3) ... [2024-10-11 17:25:48,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e21d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:25:48, skipping insertion in model container [2024-10-11 17:25:48,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:25:48" (3/3) ... [2024-10-11 17:25:48,880 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-3.i [2024-10-11 17:25:48,896 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:25:48,896 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 17:25:48,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:25:48,961 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;@16d0214a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:25:48,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 17:25:48,967 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-11 17:25:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:25:48,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:25:48,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:25:48,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:25:48,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:25:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1021285, now seen corresponding path program 1 times [2024-10-11 17:25:48,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:25:48,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672313080] [2024-10-11 17:25:48,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:25:48,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:25:48,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:25:48,997 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:25:48,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 17:25:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:25:49,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 17:25:49,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:25:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:25:49,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:25:49,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:25:49,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672313080] [2024-10-11 17:25:49,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672313080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:25:49,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:25:49,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:25:49,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310263564] [2024-10-11 17:25:49,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:25:49,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:25:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:25:49,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:25:49,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:25:49,284 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-11 17:25:53,393 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-11 17:25:57,450 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-11 17:25:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:25:57,925 INFO L93 Difference]: Finished difference Result 308 states and 403 transitions. [2024-10-11 17:25:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:25:57,934 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-11 17:25:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:25:57,942 INFO L225 Difference]: With dead ends: 308 [2024-10-11 17:25:57,942 INFO L226 Difference]: Without dead ends: 305 [2024-10-11 17:25:57,943 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-11 17:25:57,946 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 80 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s 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, 8.6s IncrementalHoareTripleChecker+Time [2024-10-11 17:25:57,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 644 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-10-11 17:25:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-11 17:25:58,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 255. [2024-10-11 17:25:58,014 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-11 17:25:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 333 transitions. [2024-10-11 17:25:58,025 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 333 transitions. Word has length 3 [2024-10-11 17:25:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:25:58,027 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 333 transitions. [2024-10-11 17:25:58,027 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-11 17:25:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 333 transitions. [2024-10-11 17:25:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:25:58,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:25:58,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:25:58,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 17:25:58,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:25:58,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:25:58,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:25:58,232 INFO L85 PathProgramCache]: Analyzing trace with hash -475425146, now seen corresponding path program 1 times [2024-10-11 17:25:58,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:25:58,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889522135] [2024-10-11 17:25:58,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:25:58,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:25:58,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:25:58,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:25:58,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 17:25:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:25:58,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:25:58,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:25:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:25:58,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:25:58,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:25:58,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889522135] [2024-10-11 17:25:58,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889522135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:25:58,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:25:58,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:25:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809323322] [2024-10-11 17:25:58,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:25:58,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:25:58,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:25:58,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:25:58,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:25:58,461 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-11 17:26:03,007 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-11 17:26:08,019 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-11 17:26:13,397 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-11 17:26:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:14,322 INFO L93 Difference]: Finished difference Result 375 states and 488 transitions. [2024-10-11 17:26:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:26:14,326 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-11 17:26:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:14,328 INFO L225 Difference]: With dead ends: 375 [2024-10-11 17:26:14,328 INFO L226 Difference]: Without dead ends: 375 [2024-10-11 17:26:14,328 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-11 17:26:14,329 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 156 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s 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.8s IncrementalHoareTripleChecker+Time [2024-10-11 17:26:14,330 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.8s Time] [2024-10-11 17:26:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-11 17:26:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-10-11 17:26:14,352 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-11 17:26:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 488 transitions. [2024-10-11 17:26:14,355 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 488 transitions. Word has length 10 [2024-10-11 17:26:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:14,355 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 488 transitions. [2024-10-11 17:26:14,356 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-11 17:26:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 488 transitions. [2024-10-11 17:26:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:26:14,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:14,357 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-11 17:26:14,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 17:26:14,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:14,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:14,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash 214148145, now seen corresponding path program 1 times [2024-10-11 17:26:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:14,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499883149] [2024-10-11 17:26:14,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:14,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:14,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:14,562 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:14,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 17:26:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:26:14,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:26:14,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:14,850 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-11 17:26:14,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:26:14,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:14,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499883149] [2024-10-11 17:26:14,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499883149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:26:14,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:26:14,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:26:14,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590028260] [2024-10-11 17:26:14,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:26:14,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:26:14,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:14,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:26:14,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:26:14,857 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-11 17:26:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:15,339 INFO L93 Difference]: Finished difference Result 426 states and 554 transitions. [2024-10-11 17:26:15,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:26:15,344 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-11 17:26:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:15,346 INFO L225 Difference]: With dead ends: 426 [2024-10-11 17:26:15,346 INFO L226 Difference]: Without dead ends: 426 [2024-10-11 17:26:15,346 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-11 17:26:15,347 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 120 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:26:15,348 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.5s Time] [2024-10-11 17:26:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-10-11 17:26:15,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 373. [2024-10-11 17:26:15,362 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-11 17:26:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 484 transitions. [2024-10-11 17:26:15,364 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 484 transitions. Word has length 25 [2024-10-11 17:26:15,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:15,364 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 484 transitions. [2024-10-11 17:26:15,364 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-11 17:26:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 484 transitions. [2024-10-11 17:26:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:26:15,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:15,366 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-11 17:26:15,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 17:26:15,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:15,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:15,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1474795597, now seen corresponding path program 1 times [2024-10-11 17:26:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:15,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687974268] [2024-10-11 17:26:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:15,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:15,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:15,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:15,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 17:26:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:26:15,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:26:15,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:15,798 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-11 17:26:15,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:26:15,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:15,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687974268] [2024-10-11 17:26:15,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687974268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:26:15,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:26:15,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:26:15,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919498838] [2024-10-11 17:26:15,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:26:15,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:26:15,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:15,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:26:15,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:26:15,802 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-11 17:26:20,062 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-11 17:26:24,070 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-11 17:26:29,442 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-11 17:26:33,449 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-11 17:26:40,635 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-11 17:26:44,644 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-11 17:26:45,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 17:26:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:48,178 INFO L93 Difference]: Finished difference Result 547 states and 712 transitions. [2024-10-11 17:26:48,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:26:48,182 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-11 17:26:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:48,184 INFO L225 Difference]: With dead ends: 547 [2024-10-11 17:26:48,184 INFO L226 Difference]: Without dead ends: 541 [2024-10-11 17:26:48,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-11 17:26:48,186 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 217 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:26:48,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 845 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 6 Unknown, 0 Unchecked, 32.3s Time] [2024-10-11 17:26:48,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-10-11 17:26:48,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 369. [2024-10-11 17:26:48,200 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-11 17:26:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 479 transitions. [2024-10-11 17:26:48,201 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 479 transitions. Word has length 25 [2024-10-11 17:26:48,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:48,202 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 479 transitions. [2024-10-11 17:26:48,202 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-11 17:26:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 479 transitions. [2024-10-11 17:26:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 17:26:48,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:48,207 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-11 17:26:48,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 17:26:48,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:48,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:48,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:48,409 INFO L85 PathProgramCache]: Analyzing trace with hash 884065145, now seen corresponding path program 1 times [2024-10-11 17:26:48,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:48,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960161545] [2024-10-11 17:26:48,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:48,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:48,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:48,413 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:48,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 17:26:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:26:49,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:26:49,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:49,156 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-11 17:26:49,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:26:49,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:49,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960161545] [2024-10-11 17:26:49,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960161545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:26:49,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:26:49,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:26:49,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935903963] [2024-10-11 17:26:49,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:26:49,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:26:49,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:49,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:26:49,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:26:49,187 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-11 17:26:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:49,287 INFO L93 Difference]: Finished difference Result 375 states and 469 transitions. [2024-10-11 17:26:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:26:49,288 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-11 17:26:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:49,290 INFO L225 Difference]: With dead ends: 375 [2024-10-11 17:26:49,290 INFO L226 Difference]: Without dead ends: 375 [2024-10-11 17:26:49,290 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-11 17:26:49,291 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-11 17:26:49,291 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-11 17:26:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-11 17:26:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-10-11 17:26:49,298 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-11 17:26:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 469 transitions. [2024-10-11 17:26:49,300 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 469 transitions. Word has length 142 [2024-10-11 17:26:49,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:49,300 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 469 transitions. [2024-10-11 17:26:49,300 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-11 17:26:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 469 transitions. [2024-10-11 17:26:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 17:26:49,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:49,305 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-11 17:26:49,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 17:26:49,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:49,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:49,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:49,506 INFO L85 PathProgramCache]: Analyzing trace with hash 489388583, now seen corresponding path program 1 times [2024-10-11 17:26:49,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:49,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121436779] [2024-10-11 17:26:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:49,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:49,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:49,509 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:49,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 17:26:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:26:50,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:26:50,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:50,359 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-11 17:26:50,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:26:50,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:50,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121436779] [2024-10-11 17:26:50,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121436779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:26:50,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:26:50,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:26:50,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756371807] [2024-10-11 17:26:50,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:26:50,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:26:50,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:50,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:26:50,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:26:50,362 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-11 17:26:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:50,499 INFO L93 Difference]: Finished difference Result 363 states and 449 transitions. [2024-10-11 17:26:50,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:26:50,501 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-11 17:26:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:50,502 INFO L225 Difference]: With dead ends: 363 [2024-10-11 17:26:50,502 INFO L226 Difference]: Without dead ends: 363 [2024-10-11 17:26:50,502 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-11 17:26:50,503 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-11 17:26:50,503 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-11 17:26:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-11 17:26:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2024-10-11 17:26:50,514 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-11 17:26:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 449 transitions. [2024-10-11 17:26:50,518 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 449 transitions. Word has length 142 [2024-10-11 17:26:50,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:50,518 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 449 transitions. [2024-10-11 17:26:50,518 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-11 17:26:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 449 transitions. [2024-10-11 17:26:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 17:26:50,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:50,521 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-11 17:26:50,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 17:26:50,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:50,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:50,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:50,723 INFO L85 PathProgramCache]: Analyzing trace with hash 191264815, now seen corresponding path program 1 times [2024-10-11 17:26:50,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:50,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469433149] [2024-10-11 17:26:50,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:50,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:50,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:50,725 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:50,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 17:26:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:26:51,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:26:51,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:51,528 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-11 17:26:51,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:26:51,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:51,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469433149] [2024-10-11 17:26:51,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469433149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:26:51,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:26:51,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:26:51,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115691485] [2024-10-11 17:26:51,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:26:51,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:26:51,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:51,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:26:51,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:26:51,531 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-11 17:26:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:51,628 INFO L93 Difference]: Finished difference Result 365 states and 454 transitions. [2024-10-11 17:26:51,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:26:51,629 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-11 17:26:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:51,632 INFO L225 Difference]: With dead ends: 365 [2024-10-11 17:26:51,632 INFO L226 Difference]: Without dead ends: 365 [2024-10-11 17:26:51,633 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-11 17:26:51,633 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-11 17:26:51,634 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-11 17:26:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-11 17:26:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-10-11 17:26:51,643 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-11 17:26:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 454 transitions. [2024-10-11 17:26:51,645 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 454 transitions. Word has length 142 [2024-10-11 17:26:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:51,645 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 454 transitions. [2024-10-11 17:26:51,646 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-11 17:26:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 454 transitions. [2024-10-11 17:26:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 17:26:51,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:51,648 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-11 17:26:51,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 17:26:51,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:51,849 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:51,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1686193135, now seen corresponding path program 1 times [2024-10-11 17:26:51,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:51,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943538481] [2024-10-11 17:26:51,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:51,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:51,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:51,852 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:51,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 17:26:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:26:52,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:26:52,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:52,600 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-11 17:26:52,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:26:52,718 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-11 17:26:52,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:52,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943538481] [2024-10-11 17:26:52,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943538481] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:26:52,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:26:52,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 17:26:52,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450954179] [2024-10-11 17:26:52,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:26:52,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:26:52,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:52,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:26:52,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:26:52,720 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-11 17:26:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:52,991 INFO L93 Difference]: Finished difference Result 374 states and 470 transitions. [2024-10-11 17:26:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:26:52,992 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-11 17:26:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:52,994 INFO L225 Difference]: With dead ends: 374 [2024-10-11 17:26:52,994 INFO L226 Difference]: Without dead ends: 374 [2024-10-11 17:26:52,995 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-11 17:26:52,995 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-11 17:26:52,995 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-11 17:26:52,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-11 17:26:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2024-10-11 17:26:53,003 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-11 17:26:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 467 transitions. [2024-10-11 17:26:53,005 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 467 transitions. Word has length 146 [2024-10-11 17:26:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:53,005 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 467 transitions. [2024-10-11 17:26:53,006 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-11 17:26:53,006 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 467 transitions. [2024-10-11 17:26:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 17:26:53,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:53,007 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-11 17:26:53,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 17:26:53,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:53,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:53,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2095099857, now seen corresponding path program 2 times [2024-10-11 17:26:53,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:53,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165456732] [2024-10-11 17:26:53,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:26:53,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:53,211 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:53,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 17:26:53,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:26:53,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:26:53,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 17:26:53,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:54,066 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-11 17:26:54,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:26:54,344 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-11 17:26:54,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:54,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165456732] [2024-10-11 17:26:54,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165456732] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:26:54,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:26:54,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 17:26:54,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230129958] [2024-10-11 17:26:54,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:26:54,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:26:54,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:54,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:26:54,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:26:54,347 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-11 17:26:54,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:54,955 INFO L93 Difference]: Finished difference Result 385 states and 488 transitions. [2024-10-11 17:26:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:26:54,956 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-11 17:26:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:54,958 INFO L225 Difference]: With dead ends: 385 [2024-10-11 17:26:54,958 INFO L226 Difference]: Without dead ends: 383 [2024-10-11 17:26:54,959 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-11 17:26:54,961 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-11 17:26:54,962 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-11 17:26:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-11 17:26:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 382. [2024-10-11 17:26:54,970 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-11 17:26:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 479 transitions. [2024-10-11 17:26:54,972 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 479 transitions. Word has length 154 [2024-10-11 17:26:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:54,972 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 479 transitions. [2024-10-11 17:26:54,973 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-11 17:26:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 479 transitions. [2024-10-11 17:26:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 17:26:54,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:54,975 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-11 17:26:54,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-11 17:26:55,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:55,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:55,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1997667411, now seen corresponding path program 3 times [2024-10-11 17:26:55,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:55,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864946530] [2024-10-11 17:26:55,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:26:55,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:55,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:55,181 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:55,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 17:26:56,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-11 17:26:56,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:26:57,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 17:26:57,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:57,118 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-11 17:26:57,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:26:57,463 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-11 17:26:57,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:57,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864946530] [2024-10-11 17:26:57,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864946530] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:26:57,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:26:57,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-11 17:26:57,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007234320] [2024-10-11 17:26:57,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:26:57,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 17:26:57,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:57,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 17:26:57,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:26:57,466 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-11 17:26:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:58,269 INFO L93 Difference]: Finished difference Result 391 states and 496 transitions. [2024-10-11 17:26:58,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 17:26:58,270 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-11 17:26:58,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:58,272 INFO L225 Difference]: With dead ends: 391 [2024-10-11 17:26:58,272 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 17:26:58,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-10-11 17:26:58,273 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 8 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:26:58,273 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.4s Time] [2024-10-11 17:26:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 17:26:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2024-10-11 17:26:58,281 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-11 17:26:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 492 transitions. [2024-10-11 17:26:58,284 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 492 transitions. Word has length 172 [2024-10-11 17:26:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:58,284 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 492 transitions. [2024-10-11 17:26:58,284 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-11 17:26:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 492 transitions. [2024-10-11 17:26:58,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-11 17:26:58,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:58,287 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-11 17:26:58,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 17:26:58,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:58,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:58,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -565499857, now seen corresponding path program 4 times [2024-10-11 17:26:58,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:58,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378157795] [2024-10-11 17:26:58,490 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:26:58,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:58,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:58,493 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:58,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 17:26:59,132 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:26:59,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:26:59,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 17:26:59,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-10-11 17:26:59,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:26:59,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:59,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378157795] [2024-10-11 17:26:59,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378157795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:26:59,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:26:59,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:26:59,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727429314] [2024-10-11 17:26:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:26:59,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:26:59,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:59,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:26:59,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:26:59,195 INFO L87 Difference]: Start difference. First operand 389 states and 492 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:26:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:59,327 INFO L93 Difference]: Finished difference Result 429 states and 532 transitions. [2024-10-11 17:26:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:26:59,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 186 [2024-10-11 17:26:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:59,331 INFO L225 Difference]: With dead ends: 429 [2024-10-11 17:26:59,331 INFO L226 Difference]: Without dead ends: 429 [2024-10-11 17:26:59,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 184 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-11 17:26:59,332 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 4 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:26:59,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 542 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:26:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-11 17:26:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2024-10-11 17:26:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 415 states have (on average 1.2313253012048193) internal successors, (511), 417 states have internal predecessors, (511), 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-11 17:26:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 532 transitions. [2024-10-11 17:26:59,343 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 532 transitions. Word has length 186 [2024-10-11 17:26:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:59,344 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 532 transitions. [2024-10-11 17:26:59,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:26:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 532 transitions. [2024-10-11 17:26:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-11 17:26:59,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:59,347 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-11 17:26:59,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-11 17:26:59,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:59,548 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:59,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:59,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1511837041, now seen corresponding path program 1 times [2024-10-11 17:26:59,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:59,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497603143] [2024-10-11 17:26:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:59,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:59,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:59,550 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:59,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 17:27:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:27:00,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:27:00,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 414 proven. 55 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-10-11 17:27:00,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:27:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 1 proven. 465 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2024-10-11 17:27:01,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:01,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497603143] [2024-10-11 17:27:01,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497603143] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:27:01,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:27:01,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 17:27:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470352713] [2024-10-11 17:27:01,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:27:01,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 17:27:01,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:01,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 17:27:01,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:27:01,272 INFO L87 Difference]: Start difference. First operand 429 states and 532 transitions. Second operand has 26 states, 24 states have (on average 6.5) internal successors, (156), 26 states have internal predecessors, (156), 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)