./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:27:12,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:27:13,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-11 17:27:13,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:27:13,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:27:13,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:27:13,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:27:13,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:27:13,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:27:13,108 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:27:13,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:27:13,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:27:13,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:27:13,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:27:13,110 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:27:13,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:27:13,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:27:13,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:27:13,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:27:13,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:27:13,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:27:13,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:27:13,115 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:27:13,115 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:27:13,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:27:13,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:27:13,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:27:13,117 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:27:13,117 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:27:13,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:27:13,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:27:13,118 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:27:13,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:27:13,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:27:13,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:27:13,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:27:13,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:27:13,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:27:13,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:27:13,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:27:13,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:27:13,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:27:13,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:27:13,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:27:13,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:27:13,122 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a [2024-10-11 17:27:13,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:27:13,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:27:13,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:27:13,446 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:27:13,446 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:27:13,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i [2024-10-11 17:27:14,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:27:15,171 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:27:15,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i [2024-10-11 17:27:15,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/642cd2076/98a5e9ad77b24b93b4aa9cd17ce81e64/FLAG27d2e2207 [2024-10-11 17:27:15,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/642cd2076/98a5e9ad77b24b93b4aa9cd17ce81e64 [2024-10-11 17:27:15,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:27:15,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:27:15,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:27:15,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:27:15,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:27:15,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:27:15" (1/1) ... [2024-10-11 17:27:15,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1a2552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:15, skipping insertion in model container [2024-10-11 17:27:15,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:27:15" (1/1) ... [2024-10-11 17:27:15,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:27:16,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:27:16,038 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 17:27:16,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@a72be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:16, skipping insertion in model container [2024-10-11 17:27:16,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:27:16,040 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 17:27:16,042 INFO L158 Benchmark]: Toolchain (without parser) took 595.45ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 65.8MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:27:16,042 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:27:16,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.97ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 65.8MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:27:16,044 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.16ms. Allocated memory is still 142.6MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.97ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 65.8MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:27:18,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:27:18,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-11 17:27:18,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:27:18,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:27:18,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:27:18,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:27:18,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:27:18,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:27:18,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:27:18,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:27:18,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:27:18,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:27:18,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:27:18,165 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:27:18,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:27:18,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:27:18,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:27:18,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:27:18,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:27:18,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:27:18,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:27:18,168 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:27:18,169 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:27:18,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:27:18,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:27:18,170 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:27:18,170 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 17:27:18,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:27:18,171 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 17:27:18,171 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:27:18,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:27:18,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:27:18,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:27:18,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:27:18,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:27:18,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:27:18,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:27:18,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:27:18,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:27:18,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:27:18,174 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 17:27:18,174 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 17:27:18,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:27:18,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:27:18,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:27:18,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:27:18,175 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 17:27:18,175 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a [2024-10-11 17:27:18,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:27:18,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:27:18,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:27:18,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:27:18,516 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:27:18,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i [2024-10-11 17:27:20,094 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:27:20,414 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:27:20,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i [2024-10-11 17:27:20,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a6f73ae4e/2a722eba14c14bf88cf18a4539584ac2/FLAGa6376fa2c [2024-10-11 17:27:20,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a6f73ae4e/2a722eba14c14bf88cf18a4539584ac2 [2024-10-11 17:27:20,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:27:20,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:27:20,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:27:20,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:27:20,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:27:20,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:27:20" (1/1) ... [2024-10-11 17:27:20,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce4a868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:20, skipping insertion in model container [2024-10-11 17:27:20,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:27:20" (1/1) ... [2024-10-11 17:27:20,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:27:21,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:27:21,080 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 17:27:21,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:27:21,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:27:21,185 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:27:21,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:27:21,354 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:27:21,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21 WrapperNode [2024-10-11 17:27:21,355 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:27:21,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:27:21,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:27:21,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:27:21,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21" (1/1) ... [2024-10-11 17:27:21,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21" (1/1) ... [2024-10-11 17:27:21,461 INFO L138 Inliner]: procedures = 180, calls = 291, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1018 [2024-10-11 17:27:21,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:27:21,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:27:21,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:27:21,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:27:21,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21" (1/1) ... [2024-10-11 17:27:21,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21" (1/1) ... [2024-10-11 17:27:21,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21" (1/1) ... [2024-10-11 17:27:21,572 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-11 17:27:21,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21" (1/1) ... [2024-10-11 17:27:21,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21" (1/1) ... [2024-10-11 17:27:21,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21" (1/1) ... [2024-10-11 17:27:21,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21" (1/1) ... [2024-10-11 17:27:21,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21" (1/1) ... [2024-10-11 17:27:21,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21" (1/1) ... [2024-10-11 17:27:21,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:27:21,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:27:21,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:27:21,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:27:21,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21" (1/1) ... [2024-10-11 17:27:21,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:27:21,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:27:21,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:27:21,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:27:21,775 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 17:27:21,775 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 17:27:21,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 17:27:21,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 17:27:21,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 17:27:21,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 17:27:21,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 17:27:21,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 17:27:21,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 17:27:21,778 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 17:27:21,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 17:27:21,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 17:27:21,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 17:27:21,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 17:27:21,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 17:27:21,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 17:27:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-10-11 17:27:21,780 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-10-11 17:27:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:27:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:27:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:27:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:27:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:27:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:27:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:27:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:27:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:27:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:27:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 17:27:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 17:27:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 17:27:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 17:27:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 17:27:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 17:27:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:27:21,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:27:22,043 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:27:22,047 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:27:28,945 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-10-11 17:27:28,946 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:27:28,985 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:27:28,987 INFO L314 CfgBuilder]: Removed 62 assume(true) statements. [2024-10-11 17:27:28,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:27:28 BoogieIcfgContainer [2024-10-11 17:27:28,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:27:28,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:27:28,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:27:28,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:27:28,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:27:20" (1/3) ... [2024-10-11 17:27:28,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4582ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:27:28, skipping insertion in model container [2024-10-11 17:27:28,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:27:21" (2/3) ... [2024-10-11 17:27:28,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4582ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:27:28, skipping insertion in model container [2024-10-11 17:27:28,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:27:28" (3/3) ... [2024-10-11 17:27:28,997 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test8-1.i [2024-10-11 17:27:29,013 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:27:29,014 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 17:27:29,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:27:29,100 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;@3f1fc30a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:27:29,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 17:27:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 203 states have (on average 1.6847290640394088) internal successors, (342), 222 states have internal predecessors, (342), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 17:27:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:27:29,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:29,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:27:29,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:29,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:29,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1355016513, now seen corresponding path program 1 times [2024-10-11 17:27:29,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:29,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357068094] [2024-10-11 17:27:29,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:27:29,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:29,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:29,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:29,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 17:27:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:27:29,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 17:27:29,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:27:29,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:27:29,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:29,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357068094] [2024-10-11 17:27:29,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357068094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:27:29,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:27:29,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:27:29,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938184797] [2024-10-11 17:27:29,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:27:29,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:27:29,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:29,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:27:29,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:27:29,359 INFO L87 Difference]: Start difference. First operand has 232 states, 203 states have (on average 1.6847290640394088) internal successors, (342), 222 states have internal predecessors, (342), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:27:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:29,434 INFO L93 Difference]: Finished difference Result 230 states and 315 transitions. [2024-10-11 17:27:29,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:27:29,437 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-10-11 17:27:29,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:29,446 INFO L225 Difference]: With dead ends: 230 [2024-10-11 17:27:29,446 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 17:27:29,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:27:29,450 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:27:29,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:27:29,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 17:27:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-10-11 17:27:29,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 202 states have (on average 1.3465346534653466) internal successors, (272), 219 states have internal predecessors, (272), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 17:27:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 314 transitions. [2024-10-11 17:27:29,498 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 314 transitions. Word has length 6 [2024-10-11 17:27:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:29,498 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 314 transitions. [2024-10-11 17:27:29,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:27:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 314 transitions. [2024-10-11 17:27:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:27:29,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:29,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:27:29,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 17:27:29,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:29,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:29,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:29,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1715409022, now seen corresponding path program 1 times [2024-10-11 17:27:29,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:29,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521916323] [2024-10-11 17:27:29,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:27:29,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:29,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:29,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:29,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 17:27:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:27:29,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 17:27:29,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:29,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:27:29,972 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:27:29,973 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:27:29,987 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-11 17:27:30,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:27:30,072 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-11 17:27:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:27:30,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:27:30,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521916323] [2024-10-11 17:27:30,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521916323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:27:30,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:27:30,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:27:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847922638] [2024-10-11 17:27:30,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:27:30,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:27:30,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:30,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:27:30,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:27:30,097 INFO L87 Difference]: Start difference. First operand 229 states and 314 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:27:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:30,722 INFO L93 Difference]: Finished difference Result 410 states and 552 transitions. [2024-10-11 17:27:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:27:30,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-11 17:27:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:30,728 INFO L225 Difference]: With dead ends: 410 [2024-10-11 17:27:30,728 INFO L226 Difference]: Without dead ends: 410 [2024-10-11 17:27:30,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:27:30,729 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 224 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:27:30,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 866 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:27:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-11 17:27:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 231. [2024-10-11 17:27:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 204 states have (on average 1.3431372549019607) internal successors, (274), 221 states have internal predecessors, (274), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 17:27:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 316 transitions. [2024-10-11 17:27:30,762 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 316 transitions. Word has length 8 [2024-10-11 17:27:30,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:30,764 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 316 transitions. [2024-10-11 17:27:30,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:27:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 316 transitions. [2024-10-11 17:27:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 17:27:30,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:30,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:27:30,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 17:27:30,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:30,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:30,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1840569330, now seen corresponding path program 1 times [2024-10-11 17:27:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:30,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117099027] [2024-10-11 17:27:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:27:30,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:30,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:30,976 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:30,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 17:27:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:27:31,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:27:31,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:27:31,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:27:31,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:31,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117099027] [2024-10-11 17:27:31,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117099027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:27:31,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:27:31,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:27:31,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8307041] [2024-10-11 17:27:31,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:27:31,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:27:31,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:31,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:27:31,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:27:31,353 INFO L87 Difference]: Start difference. First operand 231 states and 316 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:27:31,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:31,502 INFO L93 Difference]: Finished difference Result 234 states and 311 transitions. [2024-10-11 17:27:31,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:27:31,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 17:27:31,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:31,507 INFO L225 Difference]: With dead ends: 234 [2024-10-11 17:27:31,507 INFO L226 Difference]: Without dead ends: 234 [2024-10-11 17:27:31,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:27:31,508 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 30 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 823 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-11 17:27:31,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 823 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:27:31,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-11 17:27:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-10-11 17:27:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 224 states have internal predecessors, (269), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 17:27:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 311 transitions. [2024-10-11 17:27:31,529 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 311 transitions. Word has length 66 [2024-10-11 17:27:31,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:31,529 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 311 transitions. [2024-10-11 17:27:31,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:27:31,530 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 311 transitions. [2024-10-11 17:27:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 17:27:31,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:31,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:27:31,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 17:27:31,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:31,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:31,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:31,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1862455934, now seen corresponding path program 1 times [2024-10-11 17:27:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:31,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635535599] [2024-10-11 17:27:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:27:31,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:31,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:31,738 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:31,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 17:27:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:27:32,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:27:32,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:27:32,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:27:32,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:32,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635535599] [2024-10-11 17:27:32,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635535599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:27:32,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:27:32,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:27:32,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880165017] [2024-10-11 17:27:32,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:27:32,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:27:32,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:32,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:27:32,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:27:32,240 INFO L87 Difference]: Start difference. First operand 234 states and 311 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:27:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:32,395 INFO L93 Difference]: Finished difference Result 228 states and 301 transitions. [2024-10-11 17:27:32,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:27:32,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 17:27:32,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:32,399 INFO L225 Difference]: With dead ends: 228 [2024-10-11 17:27:32,399 INFO L226 Difference]: Without dead ends: 228 [2024-10-11 17:27:32,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:27:32,400 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 0 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:27:32,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 820 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:27:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-11 17:27:32,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-10-11 17:27:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 201 states have (on average 1.2885572139303483) internal successors, (259), 218 states have internal predecessors, (259), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 17:27:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 301 transitions. [2024-10-11 17:27:32,416 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 301 transitions. Word has length 66 [2024-10-11 17:27:32,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:32,417 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 301 transitions. [2024-10-11 17:27:32,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:27:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 301 transitions. [2024-10-11 17:27:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 17:27:32,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:32,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:27:32,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 17:27:32,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:32,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:32,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:32,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1468089148, now seen corresponding path program 1 times [2024-10-11 17:27:32,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:32,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510412606] [2024-10-11 17:27:32,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:27:32,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:32,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:32,629 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:32,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 17:27:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:27:32,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:27:32,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:27:33,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:27:33,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:33,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510412606] [2024-10-11 17:27:33,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510412606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:27:33,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:27:33,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:27:33,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345947573] [2024-10-11 17:27:33,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:27:33,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:27:33,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:33,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:27:33,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:27:33,327 INFO L87 Difference]: Start difference. First operand 228 states and 301 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:27:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:33,911 INFO L93 Difference]: Finished difference Result 337 states and 432 transitions. [2024-10-11 17:27:33,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:27:33,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 17:27:33,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:33,913 INFO L225 Difference]: With dead ends: 337 [2024-10-11 17:27:33,913 INFO L226 Difference]: Without dead ends: 337 [2024-10-11 17:27:33,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:27:33,914 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 89 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 17:27:33,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 615 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 17:27:33,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-11 17:27:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 332. [2024-10-11 17:27:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 304 states have (on average 1.263157894736842) internal successors, (384), 321 states have internal predecessors, (384), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 17:27:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 428 transitions. [2024-10-11 17:27:33,925 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 428 transitions. Word has length 66 [2024-10-11 17:27:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:33,926 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 428 transitions. [2024-10-11 17:27:33,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:27:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 428 transitions. [2024-10-11 17:27:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 17:27:33,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:33,929 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 17:27:33,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 17:27:34,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:34,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:34,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:34,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1848326325, now seen corresponding path program 1 times [2024-10-11 17:27:34,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:34,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922712254] [2024-10-11 17:27:34,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:27:34,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:34,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:34,138 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:34,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 17:27:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:27:34,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:27:34,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:27:34,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:27:34,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922712254] [2024-10-11 17:27:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922712254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:27:34,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:27:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:27:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753511173] [2024-10-11 17:27:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:27:34,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:27:34,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:34,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:27:34,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:27:34,592 INFO L87 Difference]: Start difference. First operand 332 states and 428 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:27:34,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:34,681 INFO L93 Difference]: Finished difference Result 334 states and 431 transitions. [2024-10-11 17:27:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:27:34,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2024-10-11 17:27:34,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:34,684 INFO L225 Difference]: With dead ends: 334 [2024-10-11 17:27:34,684 INFO L226 Difference]: Without dead ends: 334 [2024-10-11 17:27:34,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:27:34,685 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 0 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 875 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-11 17:27:34,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 875 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:27:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-11 17:27:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-10-11 17:27:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 305 states have (on average 1.2655737704918033) internal successors, (386), 323 states have internal predecessors, (386), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-11 17:27:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 431 transitions. [2024-10-11 17:27:34,697 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 431 transitions. Word has length 79 [2024-10-11 17:27:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:34,698 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 431 transitions. [2024-10-11 17:27:34,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:27:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-10-11 17:27:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 17:27:34,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:34,700 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] [2024-10-11 17:27:34,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 17:27:34,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:34,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:34,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:34,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1458208439, now seen corresponding path program 1 times [2024-10-11 17:27:34,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:34,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034520114] [2024-10-11 17:27:34,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:27:34,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:34,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:34,903 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:34,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 17:27:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:27:35,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:27:35,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:27:35,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:27:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:27:35,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:35,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034520114] [2024-10-11 17:27:35,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034520114] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:27:35,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:27:35,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 17:27:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50570959] [2024-10-11 17:27:35,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:27:35,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:27:35,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:35,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:27:35,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:27:35,452 INFO L87 Difference]: Start difference. First operand 334 states and 431 transitions. Second operand has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:27:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:35,745 INFO L93 Difference]: Finished difference Result 343 states and 445 transitions. [2024-10-11 17:27:35,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:27:35,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 81 [2024-10-11 17:27:35,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:35,751 INFO L225 Difference]: With dead ends: 343 [2024-10-11 17:27:35,751 INFO L226 Difference]: Without dead ends: 343 [2024-10-11 17:27:35,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:27:35,755 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 4 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1452 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-11 17:27:35,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1452 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:27:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-11 17:27:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 342. [2024-10-11 17:27:35,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 312 states have (on average 1.2788461538461537) internal successors, (399), 330 states have internal predecessors, (399), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-11 17:27:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 444 transitions. [2024-10-11 17:27:35,773 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 444 transitions. Word has length 81 [2024-10-11 17:27:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:35,773 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 444 transitions. [2024-10-11 17:27:35,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:27:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 444 transitions. [2024-10-11 17:27:35,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 17:27:35,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:35,775 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-11 17:27:35,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 17:27:35,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:35,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:35,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:35,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1972245077, now seen corresponding path program 2 times [2024-10-11 17:27:35,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:35,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667068648] [2024-10-11 17:27:35,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:27:35,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:35,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:35,979 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:35,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 17:27:37,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:27:37,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:27:37,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:27:37,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:27:37,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:27:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:27:37,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:37,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667068648] [2024-10-11 17:27:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667068648] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:27:37,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:27:37,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-11 17:27:37,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283053840] [2024-10-11 17:27:37,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:27:37,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:27:37,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:37,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:27:37,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:27:37,703 INFO L87 Difference]: Start difference. First operand 342 states and 444 transitions. Second operand has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:27:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:37,992 INFO L93 Difference]: Finished difference Result 348 states and 454 transitions. [2024-10-11 17:27:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:27:37,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 85 [2024-10-11 17:27:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:37,995 INFO L225 Difference]: With dead ends: 348 [2024-10-11 17:27:37,995 INFO L226 Difference]: Without dead ends: 348 [2024-10-11 17:27:37,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:27:37,996 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 6 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:27:37,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1161 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:27:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-11 17:27:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2024-10-11 17:27:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 316 states have (on average 1.2879746835443038) internal successors, (407), 334 states have internal predecessors, (407), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-11 17:27:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 452 transitions. [2024-10-11 17:27:38,009 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 452 transitions. Word has length 85 [2024-10-11 17:27:38,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:38,009 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 452 transitions. [2024-10-11 17:27:38,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:27:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 452 transitions. [2024-10-11 17:27:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 17:27:38,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:38,011 INFO L215 NwaCegarLoop]: trace histogram [10, 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] [2024-10-11 17:27:38,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 17:27:38,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:38,212 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:38,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1294881813, now seen corresponding path program 3 times [2024-10-11 17:27:38,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:38,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062077586] [2024-10-11 17:27:38,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:27:38,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:38,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:38,217 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:38,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 17:27:40,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-11 17:27:40,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:27:40,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 17:27:40,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:27:40,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:27:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:27:40,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:40,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062077586] [2024-10-11 17:27:40,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062077586] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:27:40,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:27:40,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-10-11 17:27:40,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830785591] [2024-10-11 17:27:40,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:27:40,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 17:27:40,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:40,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 17:27:40,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:27:40,702 INFO L87 Difference]: Start difference. First operand 346 states and 452 transitions. Second operand has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:27:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:41,742 INFO L93 Difference]: Finished difference Result 360 states and 475 transitions. [2024-10-11 17:27:41,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 17:27:41,743 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 89 [2024-10-11 17:27:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:41,745 INFO L225 Difference]: With dead ends: 360 [2024-10-11 17:27:41,745 INFO L226 Difference]: Without dead ends: 358 [2024-10-11 17:27:41,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=324, Invalid=606, Unknown=0, NotChecked=0, Total=930 [2024-10-11 17:27:41,746 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 9 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2316 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:27:41,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2316 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:27:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-11 17:27:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2024-10-11 17:27:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 327 states have (on average 1.305810397553517) internal successors, (427), 345 states have internal predecessors, (427), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-11 17:27:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 472 transitions. [2024-10-11 17:27:41,755 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 472 transitions. Word has length 89 [2024-10-11 17:27:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:41,757 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 472 transitions. [2024-10-11 17:27:41,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:27:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 472 transitions. [2024-10-11 17:27:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 17:27:41,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:41,759 INFO L215 NwaCegarLoop]: trace histogram [18, 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] [2024-10-11 17:27:41,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-11 17:27:41,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:41,960 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:41,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1099286635, now seen corresponding path program 4 times [2024-10-11 17:27:41,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:41,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035080480] [2024-10-11 17:27:41,961 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:27:41,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:41,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:41,964 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:41,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 17:27:42,527 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:27:42,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:27:42,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 17:27:42,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 77 proven. 10 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-11 17:27:42,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:27:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 17:27:42,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:42,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035080480] [2024-10-11 17:27:42,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035080480] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:27:42,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:27:42,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 17:27:42,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93845763] [2024-10-11 17:27:42,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:27:42,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:27:42,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:42,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:27:42,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:27:42,784 INFO L87 Difference]: Start difference. First operand 357 states and 472 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:27:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:43,456 INFO L93 Difference]: Finished difference Result 363 states and 479 transitions. [2024-10-11 17:27:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:27:43,458 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 97 [2024-10-11 17:27:43,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:43,460 INFO L225 Difference]: With dead ends: 363 [2024-10-11 17:27:43,460 INFO L226 Difference]: Without dead ends: 361 [2024-10-11 17:27:43,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:27:43,461 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 7 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:27:43,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2034 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:27:43,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-11 17:27:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 360. [2024-10-11 17:27:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 330 states have (on average 1.2969696969696969) internal successors, (428), 348 states have internal predecessors, (428), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-11 17:27:43,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 473 transitions. [2024-10-11 17:27:43,473 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 473 transitions. Word has length 97 [2024-10-11 17:27:43,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:43,473 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 473 transitions. [2024-10-11 17:27:43,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:27:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 473 transitions. [2024-10-11 17:27:43,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 17:27:43,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:43,474 INFO L215 NwaCegarLoop]: trace histogram [24, 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] [2024-10-11 17:27:43,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 17:27:43,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:43,675 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:43,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:43,676 INFO L85 PathProgramCache]: Analyzing trace with hash 953500341, now seen corresponding path program 5 times [2024-10-11 17:27:43,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:43,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822584805] [2024-10-11 17:27:43,676 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 17:27:43,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:43,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:43,677 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:43,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 17:27:44,821 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-10-11 17:27:44,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:27:44,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:27:44,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 167 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-11 17:27:45,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:27:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 17:27:45,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:45,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822584805] [2024-10-11 17:27:45,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822584805] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:27:45,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:27:45,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 17:27:45,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022819971] [2024-10-11 17:27:45,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:27:45,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 17:27:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:45,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 17:27:45,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:27:45,516 INFO L87 Difference]: Start difference. First operand 360 states and 473 transitions. Second operand has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 26 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:27:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:47,382 INFO L93 Difference]: Finished difference Result 375 states and 498 transitions. [2024-10-11 17:27:47,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 17:27:47,383 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 26 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 103 [2024-10-11 17:27:47,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:47,385 INFO L225 Difference]: With dead ends: 375 [2024-10-11 17:27:47,385 INFO L226 Difference]: Without dead ends: 373 [2024-10-11 17:27:47,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 17:27:47,387 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 14 mSDsluCounter, 4059 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4352 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 17:27:47,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4352 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 17:27:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-11 17:27:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 372. [2024-10-11 17:27:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 342 states have (on average 1.286549707602339) internal successors, (440), 360 states have internal predecessors, (440), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-11 17:27:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 485 transitions. [2024-10-11 17:27:47,406 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 485 transitions. Word has length 103 [2024-10-11 17:27:47,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:47,406 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 485 transitions. [2024-10-11 17:27:47,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 26 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:27:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 485 transitions. [2024-10-11 17:27:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 17:27:47,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:47,408 INFO L215 NwaCegarLoop]: trace histogram [36, 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] [2024-10-11 17:27:47,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-11 17:27:47,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:47,609 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:47,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:47,609 INFO L85 PathProgramCache]: Analyzing trace with hash -3747595, now seen corresponding path program 6 times [2024-10-11 17:27:47,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:47,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920671921] [2024-10-11 17:27:47,610 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 17:27:47,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:47,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:47,614 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:47,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 17:27:52,020 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-10-11 17:27:52,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:27:52,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 17:27:52,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 347 proven. 253 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-11 17:27:52,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:27:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 599 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 17:27:54,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:54,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920671921] [2024-10-11 17:27:54,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920671921] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:27:54,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:27:54,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 17:27:54,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103610003] [2024-10-11 17:27:54,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:27:54,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 17:27:54,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:54,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 17:27:54,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 17:27:54,718 INFO L87 Difference]: Start difference. First operand 372 states and 485 transitions. Second operand has 50 states, 48 states have (on average 2.5416666666666665) internal successors, (122), 50 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:28:02,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:02,178 INFO L93 Difference]: Finished difference Result 408 states and 551 transitions. [2024-10-11 17:28:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-11 17:28:02,179 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.5416666666666665) internal successors, (122), 50 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 115 [2024-10-11 17:28:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:02,181 INFO L225 Difference]: With dead ends: 408 [2024-10-11 17:28:02,181 INFO L226 Difference]: Without dead ends: 405 [2024-10-11 17:28:02,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2784, Invalid=5958, Unknown=0, NotChecked=0, Total=8742 [2024-10-11 17:28:02,187 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 25 mSDsluCounter, 6670 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6963 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:02,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6963 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1985 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 17:28:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-11 17:28:02,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2024-10-11 17:28:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 375 states have (on average 1.2853333333333334) internal successors, (482), 393 states have internal predecessors, (482), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-11 17:28:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 527 transitions. [2024-10-11 17:28:02,200 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 527 transitions. Word has length 115 [2024-10-11 17:28:02,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:02,201 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 527 transitions. [2024-10-11 17:28:02,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.5416666666666665) internal successors, (122), 50 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:28:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 527 transitions. [2024-10-11 17:28:02,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 17:28:02,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:02,203 INFO L215 NwaCegarLoop]: trace histogram [58, 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] [2024-10-11 17:28:02,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 17:28:02,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:28:02,403 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:02,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:02,404 INFO L85 PathProgramCache]: Analyzing trace with hash -116136171, now seen corresponding path program 7 times [2024-10-11 17:28:02,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:02,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518796199] [2024-10-11 17:28:02,404 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 17:28:02,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:28:02,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:02,406 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:28:02,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 17:28:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:28:03,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 17:28:03,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 676 proven. 105 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:28:03,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:28:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 676 proven. 105 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:28:04,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:04,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518796199] [2024-10-11 17:28:04,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518796199] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:28:04,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:28:04,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-10-11 17:28:04,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581417931] [2024-10-11 17:28:04,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:28:04,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 17:28:04,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:04,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 17:28:04,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 17:28:04,274 INFO L87 Difference]: Start difference. First operand 405 states and 527 transitions. Second operand has 34 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:28:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:06,664 INFO L93 Difference]: Finished difference Result 414 states and 543 transitions. [2024-10-11 17:28:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-11 17:28:06,665 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 137 [2024-10-11 17:28:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:06,666 INFO L225 Difference]: With dead ends: 414 [2024-10-11 17:28:06,666 INFO L226 Difference]: Without dead ends: 414 [2024-10-11 17:28:06,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1292, Invalid=2614, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 17:28:06,668 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 18 mSDsluCounter, 5497 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 5789 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:06,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 5789 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 17:28:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-11 17:28:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2024-10-11 17:28:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 382 states have (on average 1.2984293193717278) internal successors, (496), 400 states have internal predecessors, (496), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-11 17:28:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 541 transitions. [2024-10-11 17:28:06,684 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 541 transitions. Word has length 137 [2024-10-11 17:28:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:06,685 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 541 transitions. [2024-10-11 17:28:06,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:28:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 541 transitions. [2024-10-11 17:28:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 17:28:06,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:06,687 INFO L215 NwaCegarLoop]: trace histogram [74, 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] [2024-10-11 17:28:06,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-11 17:28:06,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:28:06,887 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:06,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1372204565, now seen corresponding path program 8 times [2024-10-11 17:28:06,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:06,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566790987] [2024-10-11 17:28:06,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:28:06,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:28:06,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:06,891 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:28:06,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 17:28:08,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:28:08,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:28:08,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 17:28:08,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 1396 proven. 465 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:28:09,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:28:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 1396 proven. 465 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:28:12,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:12,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566790987] [2024-10-11 17:28:12,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566790987] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:28:12,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:28:12,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2024-10-11 17:28:12,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987823699] [2024-10-11 17:28:12,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:28:12,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-11 17:28:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:12,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-11 17:28:12,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2024-10-11 17:28:12,011 INFO L87 Difference]: Start difference. First operand 412 states and 541 transitions. Second operand has 66 states, 64 states have (on average 2.109375) internal successors, (135), 66 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:28:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:23,147 INFO L93 Difference]: Finished difference Result 446 states and 607 transitions. [2024-10-11 17:28:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-10-11 17:28:23,148 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 2.109375) internal successors, (135), 66 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2024-10-11 17:28:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:23,150 INFO L225 Difference]: With dead ends: 446 [2024-10-11 17:28:23,150 INFO L226 Difference]: Without dead ends: 446 [2024-10-11 17:28:23,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2760 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=5148, Invalid=10854, Unknown=0, NotChecked=0, Total=16002 [2024-10-11 17:28:23,154 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 33 mSDsluCounter, 9251 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 9543 SdHoareTripleChecker+Invalid, 2309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:23,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 9543 Invalid, 2309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2273 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 17:28:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-11 17:28:23,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 444. [2024-10-11 17:28:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 414 states have (on average 1.3526570048309179) internal successors, (560), 432 states have internal predecessors, (560), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-11 17:28:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 605 transitions. [2024-10-11 17:28:23,167 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 605 transitions. Word has length 153 [2024-10-11 17:28:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:23,167 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 605 transitions. [2024-10-11 17:28:23,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 2.109375) internal successors, (135), 66 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:28:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 605 transitions. [2024-10-11 17:28:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 17:28:23,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:23,169 INFO L215 NwaCegarLoop]: trace histogram [106, 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] [2024-10-11 17:28:23,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 17:28:23,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:28:23,370 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:23,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:23,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1894562837, now seen corresponding path program 9 times [2024-10-11 17:28:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:23,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667612754] [2024-10-11 17:28:23,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:28:23,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:28:23,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:23,373 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:28:23,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process