./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_OAT_nondet_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:53:28,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:53:28,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-24 15:53:28,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:53:28,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:53:28,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:53:28,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:53:28,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:53:28,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:53:28,306 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:53:28,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:53:28,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:53:28,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:53:28,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:53:28,308 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:53:28,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:53:28,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:53:28,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:53:28,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:53:28,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:53:28,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:53:28,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:53:28,318 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:53:28,318 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:53:28,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:53:28,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:53:28,319 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:53:28,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:53:28,320 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:53:28,320 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:53:28,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:53:28,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:53:28,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:53:28,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:53:28,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:53:28,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:53:28,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:53:28,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:53:28,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:53:28,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:53:28,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:53:28,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:53:28,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:53:28,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:53:28,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:53:28,325 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-10-24 15:53:28,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:53:28,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:53:28,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:53:28,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:53:28,618 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:53:28,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-10-24 15:53:30,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:53:30,397 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:53:30,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-10-24 15:53:30,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7566a0ee1/6455e62bbbb64e6891c53fc953ce7593/FLAGba7dc3252 [2024-10-24 15:53:30,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7566a0ee1/6455e62bbbb64e6891c53fc953ce7593 [2024-10-24 15:53:30,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:53:30,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:53:30,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:53:30,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:53:30,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:53:30,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:53:30" (1/1) ... [2024-10-24 15:53:30,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2441164e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:30, skipping insertion in model container [2024-10-24 15:53:30,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:53:30" (1/1) ... [2024-10-24 15:53:30,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:53:31,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:53:31,141 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-24 15:53:31,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@67cf692a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:31, skipping insertion in model container [2024-10-24 15:53:31,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:53:31,143 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 15:53:31,145 INFO L158 Benchmark]: Toolchain (without parser) took 696.08ms. Allocated memory was 172.0MB in the beginning and 234.9MB in the end (delta: 62.9MB). Free memory was 95.9MB in the beginning and 195.6MB in the end (delta: -99.7MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-10-24 15:53:31,146 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:53:31,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 691.91ms. Allocated memory was 172.0MB in the beginning and 234.9MB in the end (delta: 62.9MB). Free memory was 95.7MB in the beginning and 195.6MB in the end (delta: -99.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-10-24 15:53:31,148 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 691.91ms. Allocated memory was 172.0MB in the beginning and 234.9MB in the end (delta: 62.9MB). Free memory was 95.7MB in the beginning and 195.6MB in the end (delta: -99.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 739]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:53:33,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:53:33,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-24 15:53:33,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:53:33,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:53:33,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:53:33,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:53:33,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:53:33,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:53:33,394 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:53:33,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:53:33,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:53:33,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:53:33,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:53:33,395 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:53:33,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:53:33,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:53:33,399 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:53:33,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:53:33,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:53:33,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:53:33,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:53:33,404 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:53:33,404 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:53:33,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:53:33,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:53:33,405 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:53:33,405 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 15:53:33,405 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:53:33,405 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 15:53:33,406 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:53:33,406 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:53:33,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:53:33,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:53:33,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:53:33,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:53:33,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:53:33,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:53:33,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:53:33,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:53:33,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:53:33,409 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 15:53:33,409 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 15:53:33,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:53:33,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:53:33,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:53:33,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:53:33,410 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 15:53:33,411 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-10-24 15:53:33,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:53:33,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:53:33,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:53:33,770 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:53:33,770 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:53:33,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-10-24 15:53:35,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:53:35,728 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:53:35,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-10-24 15:53:35,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60f63cdd/6262662270f4407baa9d3d11df45cfb4/FLAG70e88f45a [2024-10-24 15:53:36,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60f63cdd/6262662270f4407baa9d3d11df45cfb4 [2024-10-24 15:53:36,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:53:36,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:53:36,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:53:36,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:53:36,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:53:36,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:36,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46842d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36, skipping insertion in model container [2024-10-24 15:53:36,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:36,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:53:36,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:53:36,700 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 15:53:36,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:53:36,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:53:36,826 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:53:36,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:53:36,976 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:53:36,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36 WrapperNode [2024-10-24 15:53:36,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:53:36,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:53:36,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:53:36,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:53:36,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:37,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:37,094 INFO L138 Inliner]: procedures = 180, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1189 [2024-10-24 15:53:37,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:53:37,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:53:37,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:53:37,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:53:37,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:37,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:37,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:37,216 INFO L175 MemorySlicer]: Split 302 memory accesses to 3 slices as follows [2, 266, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-10-24 15:53:37,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:37,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:37,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:37,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:37,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:37,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:37,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:53:37,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:53:37,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:53:37,321 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:53:37,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36" (1/1) ... [2024-10-24 15:53:37,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:53:37,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:53:37,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 15:53:37,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 15:53:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 15:53:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 15:53:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 15:53:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 15:53:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 15:53:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 15:53:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 15:53:37,405 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 15:53:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 15:53:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 15:53:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 15:53:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 15:53:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 15:53:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 15:53:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:53:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:53:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 15:53:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 15:53:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 15:53:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 15:53:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 15:53:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 15:53:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 15:53:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 15:53:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 15:53:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 15:53:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:53:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 15:53:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 15:53:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 15:53:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:53:37,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:53:37,643 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:53:37,645 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:53:45,302 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-10-24 15:53:45,303 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:53:45,347 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:53:45,347 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-24 15:53:45,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:53:45 BoogieIcfgContainer [2024-10-24 15:53:45,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:53:45,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:53:45,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:53:45,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:53:45,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:53:36" (1/3) ... [2024-10-24 15:53:45,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19282e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:53:45, skipping insertion in model container [2024-10-24 15:53:45,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:53:36" (2/3) ... [2024-10-24 15:53:45,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19282e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:53:45, skipping insertion in model container [2024-10-24 15:53:45,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:53:45" (3/3) ... [2024-10-24 15:53:45,356 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test3-2.i [2024-10-24 15:53:45,371 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:53:45,371 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 15:53:45,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:53:45,429 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;@4d1c6f04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:53:45,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 15:53:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 218 states have (on average 1.6743119266055047) internal successors, (365), 221 states have internal predecessors, (365), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 15:53:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 15:53:45,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:45,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 15:53:45,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:45,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:45,445 INFO L85 PathProgramCache]: Analyzing trace with hash 960911, now seen corresponding path program 1 times [2024-10-24 15:53:45,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:45,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147081787] [2024-10-24 15:53:45,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:45,461 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-24 15:53:45,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:45,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:45,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 15:53:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:45,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:53:45,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:45,740 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_20| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_20|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_20| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-24 15:53:45,742 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-24 15:53:45,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:45,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:45,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147081787] [2024-10-24 15:53:45,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147081787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:45,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:45,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:53:45,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395523618] [2024-10-24 15:53:45,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:45,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:53:45,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:45,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:53:45,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-24 15:53:45,783 INFO L87 Difference]: Start difference. First operand has 228 states, 218 states have (on average 1.6743119266055047) internal successors, (365), 221 states have internal predecessors, (365), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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-24 15:53:50,015 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-24 15:53:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:50,211 INFO L93 Difference]: Finished difference Result 350 states and 462 transitions. [2024-10-24 15:53:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:53:50,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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-24 15:53:50,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:50,222 INFO L225 Difference]: With dead ends: 350 [2024-10-24 15:53:50,222 INFO L226 Difference]: Without dead ends: 348 [2024-10-24 15:53:50,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-24 15:53:50,226 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 156 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 463 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:50,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 555 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 1 Unknown, 463 Unchecked, 4.4s Time] [2024-10-24 15:53:50,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-24 15:53:50,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 226. [2024-10-24 15:53:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 217 states have (on average 1.3087557603686637) internal successors, (284), 219 states have internal predecessors, (284), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 15:53:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2024-10-24 15:53:50,279 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 3 [2024-10-24 15:53:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:50,279 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2024-10-24 15:53:50,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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-24 15:53:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2024-10-24 15:53:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 15:53:50,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:50,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:50,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 15:53:50,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:50,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:50,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1246087299, now seen corresponding path program 1 times [2024-10-24 15:53:50,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:50,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932241547] [2024-10-24 15:53:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:50,486 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-24 15:53:50,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:50,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:50,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 15:53:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:50,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:53:50,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:53:50,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:50,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:50,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932241547] [2024-10-24 15:53:50,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932241547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:50,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:50,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:53:50,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273019954] [2024-10-24 15:53:50,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:50,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:53:50,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:50,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:53:50,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:53:50,788 INFO L87 Difference]: Start difference. First operand 226 states and 294 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:53:55,147 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-24 15:53:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:57,809 INFO L93 Difference]: Finished difference Result 372 states and 485 transitions. [2024-10-24 15:53:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:53:57,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-24 15:53:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:57,814 INFO L225 Difference]: With dead ends: 372 [2024-10-24 15:53:57,814 INFO L226 Difference]: Without dead ends: 372 [2024-10-24 15:53:57,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:53:57,816 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 181 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:57,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 815 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 120 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2024-10-24 15:53:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-24 15:53:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 341. [2024-10-24 15:53:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.3081570996978853) internal successors, (433), 334 states have internal predecessors, (433), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 15:53:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 445 transitions. [2024-10-24 15:53:57,846 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 445 transitions. Word has length 14 [2024-10-24 15:53:57,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:57,846 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 445 transitions. [2024-10-24 15:53:57,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:53:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 445 transitions. [2024-10-24 15:53:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 15:53:57,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:57,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:57,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 15:53:58,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:58,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:58,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:58,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2113762318, now seen corresponding path program 1 times [2024-10-24 15:53:58,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:58,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530414087] [2024-10-24 15:53:58,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:58,053 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-24 15:53:58,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:58,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:58,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 15:53:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:58,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:53:58,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:58,461 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_21| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_21| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_21|)))) is different from true [2024-10-24 15:53:58,462 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-24 15:53:58,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:58,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530414087] [2024-10-24 15:53:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530414087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:58,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:58,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:53:58,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108929822] [2024-10-24 15:53:58,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:58,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:53:58,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:58,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:53:58,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-24 15:53:58,468 INFO L87 Difference]: Start difference. First operand 341 states and 445 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-24 15:54:02,631 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-24 15:54:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:54:03,336 INFO L93 Difference]: Finished difference Result 434 states and 564 transitions. [2024-10-24 15:54:03,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:54:03,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2024-10-24 15:54:03,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:54:03,345 INFO L225 Difference]: With dead ends: 434 [2024-10-24 15:54:03,345 INFO L226 Difference]: Without dead ends: 426 [2024-10-24 15:54:03,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-24 15:54:03,346 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 86 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 396 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-24 15:54:03,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 554 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 1 Unknown, 396 Unchecked, 4.9s Time] [2024-10-24 15:54:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-10-24 15:54:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 386. [2024-10-24 15:54:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 375 states have (on average 1.3066666666666666) internal successors, (490), 378 states have internal predecessors, (490), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 15:54:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 504 transitions. [2024-10-24 15:54:03,368 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 504 transitions. Word has length 15 [2024-10-24 15:54:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:54:03,368 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 504 transitions. [2024-10-24 15:54:03,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-24 15:54:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 504 transitions. [2024-10-24 15:54:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 15:54:03,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:54:03,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:54:03,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 15:54:03,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:54:03,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:54:03,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:54:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash 244903731, now seen corresponding path program 1 times [2024-10-24 15:54:03,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:54:03,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077401066] [2024-10-24 15:54:03,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:54:03,572 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-24 15:54:03,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:54:03,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:54:03,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 15:54:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:54:03,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:54:03,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:54:03,825 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-24 15:54:03,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:54:03,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:54:03,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077401066] [2024-10-24 15:54:03,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077401066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:54:03,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:54:03,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:54:03,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529169425] [2024-10-24 15:54:03,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:54:03,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:54:03,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:54:03,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:54:03,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:54:03,828 INFO L87 Difference]: Start difference. First operand 386 states and 504 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:54:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:54:04,002 INFO L93 Difference]: Finished difference Result 395 states and 489 transitions. [2024-10-24 15:54:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:54:04,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-24 15:54:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:54:04,004 INFO L225 Difference]: With dead ends: 395 [2024-10-24 15:54:04,004 INFO L226 Difference]: Without dead ends: 395 [2024-10-24 15:54:04,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-24 15:54:04,005 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 30 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:54:04,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 763 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:54:04,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-24 15:54:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-10-24 15:54:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 384 states have (on average 1.2369791666666667) internal successors, (475), 387 states have internal predecessors, (475), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 15:54:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2024-10-24 15:54:04,025 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 50 [2024-10-24 15:54:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:54:04,026 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2024-10-24 15:54:04,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:54:04,026 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2024-10-24 15:54:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 15:54:04,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:54:04,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:54:04,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 15:54:04,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:54:04,229 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:54:04,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:54:04,229 INFO L85 PathProgramCache]: Analyzing trace with hash 660080423, now seen corresponding path program 1 times [2024-10-24 15:54:04,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:54:04,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301935202] [2024-10-24 15:54:04,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:54:04,230 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-24 15:54:04,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:54:04,236 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:54:04,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 15:54:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:54:04,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:54:04,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:54:04,483 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:54:04,483 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:54:04,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:54:04,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-24 15:54:04,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:54:04,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-24 15:54:04,676 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-24 15:54:04,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:54:04,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:54:04,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301935202] [2024-10-24 15:54:04,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301935202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:54:04,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:54:04,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:54:04,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79044206] [2024-10-24 15:54:04,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:54:04,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:54:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:54:04,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:54:04,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:54:04,681 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:54:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:54:05,292 INFO L93 Difference]: Finished difference Result 396 states and 496 transitions. [2024-10-24 15:54:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:54:05,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-24 15:54:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:54:05,295 INFO L225 Difference]: With dead ends: 396 [2024-10-24 15:54:05,295 INFO L226 Difference]: Without dead ends: 393 [2024-10-24 15:54:05,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 15:54:05,296 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 108 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 15:54:05,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1065 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 15:54:05,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-24 15:54:05,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 346. [2024-10-24 15:54:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 336 states have (on average 1.2529761904761905) internal successors, (421), 339 states have internal predecessors, (421), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 15:54:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 433 transitions. [2024-10-24 15:54:05,305 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 433 transitions. Word has length 50 [2024-10-24 15:54:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:54:05,305 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 433 transitions. [2024-10-24 15:54:05,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:54:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 433 transitions. [2024-10-24 15:54:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 15:54:05,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:54:05,308 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:54:05,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 15:54:05,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:54:05,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:54:05,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:54:05,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1008474594, now seen corresponding path program 1 times [2024-10-24 15:54:05,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:54:05,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094927471] [2024-10-24 15:54:05,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:54:05,511 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-24 15:54:05,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:54:05,514 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:54:05,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 15:54:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:54:05,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:54:05,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:54:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 15:54:06,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:54:06,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:54:06,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094927471] [2024-10-24 15:54:06,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094927471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:54:06,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:54:06,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:54:06,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045560112] [2024-10-24 15:54:06,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:54:06,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:54:06,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:54:06,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:54:06,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:54:06,034 INFO L87 Difference]: Start difference. First operand 346 states and 433 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:54:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:54:06,145 INFO L93 Difference]: Finished difference Result 352 states and 423 transitions. [2024-10-24 15:54:06,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:54:06,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2024-10-24 15:54:06,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:54:06,147 INFO L225 Difference]: With dead ends: 352 [2024-10-24 15:54:06,147 INFO L226 Difference]: Without dead ends: 352 [2024-10-24 15:54:06,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:54:06,149 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 33 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:54:06,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 727 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:54:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-24 15:54:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-10-24 15:54:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 342 states have (on average 1.2017543859649122) internal successors, (411), 345 states have internal predecessors, (411), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 15:54:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 423 transitions. [2024-10-24 15:54:06,157 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 423 transitions. Word has length 83 [2024-10-24 15:54:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:54:06,166 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 423 transitions. [2024-10-24 15:54:06,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:54:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 423 transitions. [2024-10-24 15:54:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 15:54:06,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:54:06,168 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:54:06,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 15:54:06,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:54:06,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:54:06,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:54:06,370 INFO L85 PathProgramCache]: Analyzing trace with hash 253443154, now seen corresponding path program 1 times [2024-10-24 15:54:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:54:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978129726] [2024-10-24 15:54:06,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:54:06,371 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-24 15:54:06,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:54:06,372 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:54:06,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 15:54:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:54:06,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:54:06,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:54:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 15:54:06,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:54:06,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:54:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978129726] [2024-10-24 15:54:06,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978129726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:54:06,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:54:06,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:54:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665376549] [2024-10-24 15:54:06,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:54:06,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:54:06,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:54:06,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:54:06,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:54:06,937 INFO L87 Difference]: Start difference. First operand 352 states and 423 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:54:07,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:54:07,072 INFO L93 Difference]: Finished difference Result 340 states and 403 transitions. [2024-10-24 15:54:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:54:07,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2024-10-24 15:54:07,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:54:07,074 INFO L225 Difference]: With dead ends: 340 [2024-10-24 15:54:07,074 INFO L226 Difference]: Without dead ends: 340 [2024-10-24 15:54:07,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 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-24 15:54:07,075 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 2 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:54:07,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 965 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:54:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-24 15:54:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2024-10-24 15:54:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 330 states have (on average 1.1848484848484848) internal successors, (391), 333 states have internal predecessors, (391), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 15:54:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 403 transitions. [2024-10-24 15:54:07,083 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 403 transitions. Word has length 83 [2024-10-24 15:54:07,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:54:07,084 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 403 transitions. [2024-10-24 15:54:07,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:54:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 403 transitions. [2024-10-24 15:54:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 15:54:07,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:54:07,086 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:54:07,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 15:54:07,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:54:07,286 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:54:07,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:54:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2093376664, now seen corresponding path program 1 times [2024-10-24 15:54:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:54:07,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406291326] [2024-10-24 15:54:07,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:54:07,288 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-24 15:54:07,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:54:07,289 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:54:07,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 15:54:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:54:07,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:54:07,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:54:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:54:07,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:54:07,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:54:07,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406291326] [2024-10-24 15:54:07,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406291326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:54:07,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:54:07,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:54:07,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168748151] [2024-10-24 15:54:07,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:54:07,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:54:07,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:54:07,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:54:07,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:54:07,805 INFO L87 Difference]: Start difference. First operand 340 states and 403 transitions. Second operand has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:54:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:54:07,875 INFO L93 Difference]: Finished difference Result 342 states and 406 transitions. [2024-10-24 15:54:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:54:07,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2024-10-24 15:54:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:54:07,878 INFO L225 Difference]: With dead ends: 342 [2024-10-24 15:54:07,879 INFO L226 Difference]: Without dead ends: 342 [2024-10-24 15:54:07,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 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-24 15:54:07,879 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:54:07,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 782 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:54:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-24 15:54:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-10-24 15:54:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 331 states have (on average 1.1873111782477341) internal successors, (393), 335 states have internal predecessors, (393), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 15:54:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 406 transitions. [2024-10-24 15:54:07,888 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 406 transitions. Word has length 83 [2024-10-24 15:54:07,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:54:07,889 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 406 transitions. [2024-10-24 15:54:07,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:54:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 406 transitions. [2024-10-24 15:54:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 15:54:07,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:54:07,891 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:54:07,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-24 15:54:08,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:54:08,096 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:54:08,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:54:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1964088936, now seen corresponding path program 1 times [2024-10-24 15:54:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:54:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534000252] [2024-10-24 15:54:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:54:08,097 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-24 15:54:08,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:54:08,100 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:54:08,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 15:54:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:54:08,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:54:08,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:54:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:54:08,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:54:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:54:08,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:54:08,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534000252] [2024-10-24 15:54:08,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534000252] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:54:08,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:54:08,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 15:54:08,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423777060] [2024-10-24 15:54:08,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:54:08,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:54:08,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:54:08,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:54:08,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:54:08,730 INFO L87 Difference]: Start difference. First operand 342 states and 406 transitions. Second operand has 8 states, 6 states have (on average 14.333333333333334) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:54:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:54:09,008 INFO L93 Difference]: Finished difference Result 351 states and 420 transitions. [2024-10-24 15:54:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 15:54:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 14.333333333333334) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 85 [2024-10-24 15:54:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:54:09,011 INFO L225 Difference]: With dead ends: 351 [2024-10-24 15:54:09,011 INFO L226 Difference]: Without dead ends: 351 [2024-10-24 15:54:09,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 162 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-24 15:54:09,012 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 4 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:54:09,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1297 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:54:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-24 15:54:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 350. [2024-10-24 15:54:09,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 338 states have (on average 1.2011834319526626) internal successors, (406), 342 states have internal predecessors, (406), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 15:54:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 419 transitions. [2024-10-24 15:54:09,020 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 419 transitions. Word has length 85 [2024-10-24 15:54:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:54:09,020 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 419 transitions. [2024-10-24 15:54:09,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 14.333333333333334) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:54:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 419 transitions. [2024-10-24 15:54:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 15:54:09,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:54:09,021 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:54:09,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 15:54:09,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:54:09,222 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:54:09,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:54:09,223 INFO L85 PathProgramCache]: Analyzing trace with hash 569093400, now seen corresponding path program 2 times [2024-10-24 15:54:09,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:54:09,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170308765] [2024-10-24 15:54:09,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:54:09,223 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-24 15:54:09,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:54:09,225 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:54:09,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 15:54:09,730 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:54:09,730 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:54:09,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 15:54:09,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:54:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 15:54:09,823 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:54:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 15:54:10,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:54:10,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170308765] [2024-10-24 15:54:10,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170308765] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:54:10,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:54:10,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 15:54:10,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55139658] [2024-10-24 15:54:10,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:54:10,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 15:54:10,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:54:10,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 15:54:10,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 15:54:10,035 INFO L87 Difference]: Start difference. First operand 350 states and 419 transitions. Second operand has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 14 states have internal predecessors, (92), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:54:10,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:54:10,661 INFO L93 Difference]: Finished difference Result 362 states and 438 transitions. [2024-10-24 15:54:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 15:54:10,663 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 14 states have internal predecessors, (92), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 89 [2024-10-24 15:54:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:54:10,665 INFO L225 Difference]: With dead ends: 362 [2024-10-24 15:54:10,665 INFO L226 Difference]: Without dead ends: 360 [2024-10-24 15:54:10,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 164 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-24 15:54:10,666 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 7 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 15:54:10,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1817 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 15:54:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-24 15:54:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 359. [2024-10-24 15:54:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 347 states have (on average 1.2046109510086456) internal successors, (418), 351 states have internal predecessors, (418), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 15:54:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 431 transitions. [2024-10-24 15:54:10,678 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 431 transitions. Word has length 89 [2024-10-24 15:54:10,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:54:10,679 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 431 transitions. [2024-10-24 15:54:10,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 14 states have internal predecessors, (92), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:54:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 431 transitions. [2024-10-24 15:54:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 15:54:10,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:54:10,680 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:54:10,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 15:54:10,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:54:10,881 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:54:10,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:54:10,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1309903236, now seen corresponding path program 3 times [2024-10-24 15:54:10,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:54:10,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514518767] [2024-10-24 15:54:10,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:54:10,882 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-24 15:54:10,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:54:10,884 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:54:10,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 15:54:11,277 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 15:54:11,277 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:54:11,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 15:54:11,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:54:11,594 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:54:11,595 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:54:11,595 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:54:11,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-24 15:54:11,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:54:11,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-24 15:54:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-24 15:54:11,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:54:11,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:54:11,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514518767] [2024-10-24 15:54:11,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514518767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:54:11,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:54:11,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 15:54:11,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235591297] [2024-10-24 15:54:11,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:54:11,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:54:11,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:54:11,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:54:11,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:54:11,696 INFO L87 Difference]: Start difference. First operand 359 states and 431 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:54:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:54:12,027 INFO L93 Difference]: Finished difference Result 476 states and 579 transitions. [2024-10-24 15:54:12,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:54:12,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2024-10-24 15:54:12,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:54:12,031 INFO L225 Difference]: With dead ends: 476 [2024-10-24 15:54:12,031 INFO L226 Difference]: Without dead ends: 476 [2024-10-24 15:54:12,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-10-24 15:54:12,032 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 338 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:54:12,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 747 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 15:54:12,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-10-24 15:54:12,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 361. [2024-10-24 15:54:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 349 states have (on average 1.2034383954154728) internal successors, (420), 353 states have internal predecessors, (420), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 15:54:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 433 transitions. [2024-10-24 15:54:12,043 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 433 transitions. Word has length 98 [2024-10-24 15:54:12,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:54:12,044 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 433 transitions. [2024-10-24 15:54:12,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:54:12,045 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 433 transitions. [2024-10-24 15:54:12,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 15:54:12,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:54:12,046 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:54:12,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-24 15:54:12,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:54:12,247 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:54:12,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:54:12,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1564402776, now seen corresponding path program 1 times [2024-10-24 15:54:12,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:54:12,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507478741] [2024-10-24 15:54:12,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:54:12,249 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-24 15:54:12,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:54:12,252 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:54:12,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 15:54:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:54:12,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 15:54:12,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:54:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 15:54:12,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:54:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 15:54:13,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:54:13,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507478741] [2024-10-24 15:54:13,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507478741] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:54:13,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:54:13,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 15:54:13,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039914295] [2024-10-24 15:54:13,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:54:13,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 15:54:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:54:13,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 15:54:13,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 15:54:13,650 INFO L87 Difference]: Start difference. First operand 361 states and 433 transitions. Second operand has 26 states, 24 states have (on average 5.833333333333333) internal successors, (140), 26 states have internal predecessors, (140), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:54:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:54:15,546 INFO L93 Difference]: Finished difference Result 382 states and 470 transitions. [2024-10-24 15:54:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 15:54:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.833333333333333) internal successors, (140), 26 states have internal predecessors, (140), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 134 [2024-10-24 15:54:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:54:15,549 INFO L225 Difference]: With dead ends: 382 [2024-10-24 15:54:15,549 INFO L226 Difference]: Without dead ends: 380 [2024-10-24 15:54:15,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 15:54:15,550 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 13 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 15:54:15,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3370 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 15:54:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-24 15:54:15,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 379. [2024-10-24 15:54:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 367 states have (on average 1.2098092643051772) internal successors, (444), 371 states have internal predecessors, (444), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 15:54:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 457 transitions. [2024-10-24 15:54:15,558 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 457 transitions. Word has length 134 [2024-10-24 15:54:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:54:15,559 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 457 transitions. [2024-10-24 15:54:15,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.833333333333333) internal successors, (140), 26 states have internal predecessors, (140), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:54:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 457 transitions. [2024-10-24 15:54:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-24 15:54:15,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:54:15,561 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:54:15,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-24 15:54:15,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:54:15,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:54:15,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:54:15,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1390218712, now seen corresponding path program 2 times [2024-10-24 15:54:15,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:54:15,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114399520] [2024-10-24 15:54:15,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:54:15,764 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-24 15:54:15,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:54:15,766 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:54:15,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 15:54:16,502 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:54:16,502 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:54:16,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 15:54:16,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:54:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 15:54:17,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:54:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-24 15:54:18,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:54:18,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114399520] [2024-10-24 15:54:18,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114399520] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:54:18,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:54:18,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 15:54:18,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301928651] [2024-10-24 15:54:18,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:54:18,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 15:54:18,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:54:18,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 15:54:18,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 15:54:18,731 INFO L87 Difference]: Start difference. First operand 379 states and 457 transitions. Second operand has 50 states, 48 states have (on average 3.4166666666666665) internal successors, (164), 50 states have internal predecessors, (164), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:54:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:54:25,284 INFO L93 Difference]: Finished difference Result 416 states and 526 transitions. [2024-10-24 15:54:25,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-24 15:54:25,285 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.4166666666666665) internal successors, (164), 50 states have internal predecessors, (164), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 152 [2024-10-24 15:54:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:54:25,287 INFO L225 Difference]: With dead ends: 416 [2024-10-24 15:54:25,287 INFO L226 Difference]: Without dead ends: 414 [2024-10-24 15:54:25,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-24 15:54:25,289 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 26 mSDsluCounter, 5959 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6221 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 15:54:25,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6221 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 15:54:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-24 15:54:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 413. [2024-10-24 15:54:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 401 states have (on average 1.2219451371571073) internal successors, (490), 405 states have internal predecessors, (490), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 15:54:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 503 transitions. [2024-10-24 15:54:25,297 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 503 transitions. Word has length 152 [2024-10-24 15:54:25,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:54:25,298 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 503 transitions. [2024-10-24 15:54:25,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.4166666666666665) internal successors, (164), 50 states have internal predecessors, (164), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:54:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 503 transitions. [2024-10-24 15:54:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-24 15:54:25,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:54:25,300 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:54:25,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 15:54:25,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:54:25,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:54:25,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:54:25,501 INFO L85 PathProgramCache]: Analyzing trace with hash -442274648, now seen corresponding path program 3 times [2024-10-24 15:54:25,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:54:25,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805311231] [2024-10-24 15:54:25,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:54:25,503 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-24 15:54:25,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:54:25,506 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:54:25,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 15:54:26,198 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 15:54:26,198 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:54:26,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:54:26,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:54:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-24 15:54:26,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:54:26,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:54:26,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805311231] [2024-10-24 15:54:26,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805311231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:54:26,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:54:26,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:54:26,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695073348] [2024-10-24 15:54:26,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:54:26,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:54:26,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:54:26,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:54:26,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:54:26,583 INFO L87 Difference]: Start difference. First operand 413 states and 503 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:54:30,954 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-24 15:54:34,963 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-24 15:54:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:54:37,327 INFO L93 Difference]: Finished difference Result 581 states and 715 transitions. [2024-10-24 15:54:37,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:54:37,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 186 [2024-10-24 15:54:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:54:37,331 INFO L225 Difference]: With dead ends: 581 [2024-10-24 15:54:37,331 INFO L226 Difference]: Without dead ends: 581 [2024-10-24 15:54:37,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 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-24 15:54:37,332 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 516 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-10-24 15:54:37,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 558 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 10.7s Time] [2024-10-24 15:54:37,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-10-24 15:54:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 509. [2024-10-24 15:54:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 495 states have (on average 1.2202020202020203) internal successors, (604), 500 states have internal predecessors, (604), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-24 15:54:37,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 621 transitions. [2024-10-24 15:54:37,345 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 621 transitions. Word has length 186 [2024-10-24 15:54:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:54:37,345 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 621 transitions. [2024-10-24 15:54:37,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:54:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 621 transitions. [2024-10-24 15:54:37,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 15:54:37,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:54:37,347 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:54:37,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-24 15:54:37,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:54:37,548 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:54:37,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:54:37,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1262769422, now seen corresponding path program 1 times [2024-10-24 15:54:37,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:54:37,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807064973] [2024-10-24 15:54:37,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:54:37,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-24 15:54:37,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:54:37,551 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:54:37,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-24 15:54:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:54:38,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 15:54:38,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:54:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:54:39,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:54:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:54:41,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:54:41,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807064973] [2024-10-24 15:54:41,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807064973] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:54:41,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:54:41,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-24 15:54:41,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708354097] [2024-10-24 15:54:41,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:54:41,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-24 15:54:41,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:54:41,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-24 15:54:41,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 15:54:41,907 INFO L87 Difference]: Start difference. First operand 509 states and 621 transitions. Second operand has 52 states, 50 states have (on average 3.42) internal successors, (171), 52 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:54:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:54:49,573 INFO L93 Difference]: Finished difference Result 536 states and 673 transitions. [2024-10-24 15:54:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-24 15:54:49,574 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.42) internal successors, (171), 52 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 194 [2024-10-24 15:54:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:54:49,576 INFO L225 Difference]: With dead ends: 536 [2024-10-24 15:54:49,576 INFO L226 Difference]: Without dead ends: 536 [2024-10-24 15:54:49,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-24 15:54:49,579 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 26 mSDsluCounter, 6712 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6973 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-24 15:54:49,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6973 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-24 15:54:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-24 15:54:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 534. [2024-10-24 15:54:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 520 states have (on average 1.2576923076923077) internal successors, (654), 525 states have internal predecessors, (654), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-24 15:54:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 671 transitions. [2024-10-24 15:54:49,589 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 671 transitions. Word has length 194 [2024-10-24 15:54:49,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:54:49,589 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 671 transitions. [2024-10-24 15:54:49,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.42) internal successors, (171), 52 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:54:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 671 transitions. [2024-10-24 15:54:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 15:54:49,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:54:49,592 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:54:49,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-24 15:54:49,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:54:49,797 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:54:49,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:54:49,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1033786374, now seen corresponding path program 2 times [2024-10-24 15:54:49,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:54:49,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783624866] [2024-10-24 15:54:49,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:54:49,798 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-24 15:54:49,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:54:49,801 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:54:49,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-24 15:54:51,521 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:54:51,522 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:54:51,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-24 15:54:51,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:54:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:54:53,248 INFO L311 TraceCheckSpWp]: Computing backward predicates...