./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:00:47,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:00:47,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-17 00:00:47,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:00:47,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:00:47,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:00:47,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:00:47,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:00:47,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:00:47,459 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:00:47,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:00:47,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:00:47,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:00:47,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:00:47,461 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:00:47,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:00:47,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:00:47,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:00:47,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:00:47,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:00:47,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:00:47,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:00:47,465 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:00:47,466 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:00:47,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:00:47,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:00:47,466 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:00:47,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:00:47,467 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:00:47,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:00:47,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:00:47,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:00:47,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:00:47,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:00:47,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:00:47,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:00:47,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:00:47,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:00:47,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:00:47,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:00:47,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:00:47,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:00:47,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:00:47,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:00:47,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:00:47,473 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2024-11-17 00:00:47,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:00:47,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:00:47,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:00:47,707 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:00:47,710 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:00:47,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-11-17 00:00:49,010 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:00:49,259 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:00:49,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-11-17 00:00:49,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/447df3f94/a07cd2f1087a47ac96cec77d52a1cae4/FLAG55c49e8ce [2024-11-17 00:00:49,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/447df3f94/a07cd2f1087a47ac96cec77d52a1cae4 [2024-11-17 00:00:49,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:00:49,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:00:49,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:00:49,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:00:49,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:00:49,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:00:49" (1/1) ... [2024-11-17 00:00:49,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e8a383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:49, skipping insertion in model container [2024-11-17 00:00:49,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:00:49" (1/1) ... [2024-11-17 00:00:49,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:00:50,030 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,066 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,070 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,072 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,076 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,102 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,103 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,105 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,111 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,136 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,137 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,138 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,139 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,140 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,141 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,143 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,143 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,144 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,147 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,148 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,148 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,149 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,151 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:50,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:00:50,172 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-11-17 00:00:50,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4b7df6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:50, skipping insertion in model container [2024-11-17 00:00:50,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:00:50,174 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 00:00:50,176 INFO L158 Benchmark]: Toolchain (without parser) took 594.81ms. Allocated memory was 151.0MB in the beginning and 190.8MB in the end (delta: 39.8MB). Free memory was 75.9MB in the beginning and 140.9MB in the end (delta: -65.0MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-17 00:00:50,176 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:00:50,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.89ms. Allocated memory was 151.0MB in the beginning and 190.8MB in the end (delta: 39.8MB). Free memory was 75.6MB in the beginning and 140.9MB in the end (delta: -65.2MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-17 00:00:50,179 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.89ms. Allocated memory was 151.0MB in the beginning and 190.8MB in the end (delta: 39.8MB). Free memory was 75.6MB in the beginning and 140.9MB in the end (delta: -65.2MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 760]: 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:00:52,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:00:52,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-17 00:00:52,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:00:52,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:00:52,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:00:52,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:00:52,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:00:52,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:00:52,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:00:52,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:00:52,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:00:52,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:00:52,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:00:52,137 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:00:52,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:00:52,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:00:52,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:00:52,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:00:52,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:00:52,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:00:52,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:00:52,141 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:00:52,142 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:00:52,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:00:52,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:00:52,144 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:00:52,144 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:00:52,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:00:52,145 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:00:52,145 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:00:52,145 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:00:52,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:00:52,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:00:52,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:00:52,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:00:52,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:00:52,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:00:52,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:00:52,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:00:52,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:00:52,147 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:00:52,147 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:00:52,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:00:52,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:00:52,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:00:52,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:00:52,148 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2024-11-17 00:00:52,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:00:52,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:00:52,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:00:52,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:00:52,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:00:52,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-11-17 00:00:53,729 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:00:53,996 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:00:53,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-11-17 00:00:54,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6a39a1d4/e35ee096cbad491892f7a9547f599e7b/FLAG67af1f17a [2024-11-17 00:00:54,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6a39a1d4/e35ee096cbad491892f7a9547f599e7b [2024-11-17 00:00:54,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:00:54,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:00:54,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:00:54,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:00:54,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:00:54,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:54,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a77aa6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54, skipping insertion in model container [2024-11-17 00:00:54,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:54,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:00:54,433 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,465 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,473 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,475 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,480 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,509 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,514 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,519 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,523 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,556 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,560 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,562 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,562 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,566 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,568 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,573 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,578 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,579 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,582 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,586 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,586 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,587 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,589 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:00:54,613 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 00:00:54,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:00:54,650 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,668 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,669 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,671 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,673 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,687 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,689 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,690 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,695 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,722 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,723 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,726 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,726 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,728 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,729 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,731 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,731 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,732 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,734 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,735 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,736 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,736 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,741 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:00:54,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:00:54,749 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:00:54,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:00:54,866 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:00:54,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54 WrapperNode [2024-11-17 00:00:54,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:00:54,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:00:54,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:00:54,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:00:54,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:54,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:54,977 INFO L138 Inliner]: procedures = 180, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1673 [2024-11-17 00:00:54,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:00:54,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:00:54,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:00:54,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:00:54,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:54,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:55,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:55,110 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 417, 24]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 98, 1]. [2024-11-17 00:00:55,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:55,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:55,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:55,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:55,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:55,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:55,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:00:55,193 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:00:55,193 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:00:55,193 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:00:55,194 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54" (1/1) ... [2024-11-17 00:00:55,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:00:55,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:00:55,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:00:55,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:00:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 00:00:55,296 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 00:00:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 00:00:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 00:00:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 00:00:55,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 00:00:55,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 00:00:55,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 00:00:55,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 00:00:55,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 00:00:55,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 00:00:55,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 00:00:55,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 00:00:55,299 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 00:00:55,299 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 00:00:55,299 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 00:00:55,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:00:55,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:00:55,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:00:55,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:00:55,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:00:55,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:00:55,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:00:55,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:00:55,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:00:55,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:00:55,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 00:00:55,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 00:00:55,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 00:00:55,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 00:00:55,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 00:00:55,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 00:00:55,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:00:55,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:00:55,552 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:00:55,554 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:01:09,556 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2024-11-17 00:01:09,657 INFO L? ?]: Removed 228 outVars from TransFormulas that were not future-live. [2024-11-17 00:01:09,658 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:01:09,676 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:01:09,678 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:01:09,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:01:09 BoogieIcfgContainer [2024-11-17 00:01:09,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:01:09,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:01:09,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:01:09,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:01:09,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:00:54" (1/3) ... [2024-11-17 00:01:09,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d55aaad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:01:09, skipping insertion in model container [2024-11-17 00:01:09,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:00:54" (2/3) ... [2024-11-17 00:01:09,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d55aaad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:01:09, skipping insertion in model container [2024-11-17 00:01:09,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:01:09" (3/3) ... [2024-11-17 00:01:09,687 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-3.i [2024-11-17 00:01:09,699 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:01:09,700 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:01:09,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:01:09,752 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;@5f11e419, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:01:09,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:01:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 333 states, 314 states have (on average 1.6496815286624205) internal successors, (518), 323 states have internal predecessors, (518), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 00:01:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:01:09,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:09,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:01:09,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:09,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:09,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1835895772, now seen corresponding path program 1 times [2024-11-17 00:01:09,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:09,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923301675] [2024-11-17 00:01:09,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:09,780 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-11-17 00:01:09,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:09,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:09,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 00:01:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:09,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 00:01:09,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:09,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:09,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:09,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923301675] [2024-11-17 00:01:09,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923301675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:09,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:09,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:01:09,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714014887] [2024-11-17 00:01:09,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:09,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:01:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:10,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:01:10,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:01:10,021 INFO L87 Difference]: Start difference. First operand has 333 states, 314 states have (on average 1.6496815286624205) internal successors, (518), 323 states have internal predecessors, (518), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:10,079 INFO L93 Difference]: Finished difference Result 331 states and 432 transitions. [2024-11-17 00:01:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:01:10,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:01:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:10,112 INFO L225 Difference]: With dead ends: 331 [2024-11-17 00:01:10,118 INFO L226 Difference]: Without dead ends: 328 [2024-11-17 00:01:10,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-11-17 00:01:10,124 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:10,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:01:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-17 00:01:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-11-17 00:01:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 311 states have (on average 1.302250803858521) internal successors, (405), 318 states have internal predecessors, (405), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 00:01:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 429 transitions. [2024-11-17 00:01:10,173 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 429 transitions. Word has length 11 [2024-11-17 00:01:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:10,173 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 429 transitions. [2024-11-17 00:01:10,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 429 transitions. [2024-11-17 00:01:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:01:10,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:10,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:01:10,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 00:01:10,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:10,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:10,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:10,376 INFO L85 PathProgramCache]: Analyzing trace with hash 12799948, now seen corresponding path program 1 times [2024-11-17 00:01:10,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:10,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125249988] [2024-11-17 00:01:10,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:10,377 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-11-17 00:01:10,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:10,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:10,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 00:01:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:10,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 00:01:10,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:10,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:10,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:10,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125249988] [2024-11-17 00:01:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125249988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:10,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:10,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:01:10,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609805863] [2024-11-17 00:01:10,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:10,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:01:10,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:10,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:01:10,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:01:10,662 INFO L87 Difference]: Start difference. First operand 328 states and 429 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:10,860 INFO L93 Difference]: Finished difference Result 583 states and 766 transitions. [2024-11-17 00:01:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:01:10,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 00:01:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:10,866 INFO L225 Difference]: With dead ends: 583 [2024-11-17 00:01:10,866 INFO L226 Difference]: Without dead ends: 583 [2024-11-17 00:01:10,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-11-17 00:01:10,867 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 311 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:10,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 845 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:01:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-17 00:01:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 332. [2024-11-17 00:01:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 315 states have (on average 1.2984126984126985) internal successors, (409), 322 states have internal predecessors, (409), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 00:01:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 433 transitions. [2024-11-17 00:01:10,888 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 433 transitions. Word has length 15 [2024-11-17 00:01:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:10,888 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 433 transitions. [2024-11-17 00:01:10,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 433 transitions. [2024-11-17 00:01:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-17 00:01:10,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:10,896 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:01:10,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-17 00:01:11,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:11,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:11,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:11,098 INFO L85 PathProgramCache]: Analyzing trace with hash -138666495, now seen corresponding path program 1 times [2024-11-17 00:01:11,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:11,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944849841] [2024-11-17 00:01:11,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:11,100 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-11-17 00:01:11,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:11,105 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:11,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 00:01:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:11,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:01:11,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:11,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:11,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:11,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944849841] [2024-11-17 00:01:11,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944849841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:11,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:11,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:01:11,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471531103] [2024-11-17 00:01:11,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:11,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:01:11,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:11,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:01:11,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:01:11,632 INFO L87 Difference]: Start difference. First operand 332 states and 433 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:11,726 INFO L93 Difference]: Finished difference Result 335 states and 428 transitions. [2024-11-17 00:01:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:01:11,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2024-11-17 00:01:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:11,728 INFO L225 Difference]: With dead ends: 335 [2024-11-17 00:01:11,728 INFO L226 Difference]: Without dead ends: 335 [2024-11-17 00:01:11,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 155 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-11-17 00:01:11,729 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 30 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:11,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1177 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:01:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-17 00:01:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2024-11-17 00:01:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 318 states have (on average 1.270440251572327) internal successors, (404), 325 states have internal predecessors, (404), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 00:01:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 428 transitions. [2024-11-17 00:01:11,737 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 428 transitions. Word has length 158 [2024-11-17 00:01:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:11,738 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 428 transitions. [2024-11-17 00:01:11,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 428 transitions. [2024-11-17 00:01:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-17 00:01:11,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:11,742 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:01:11,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 00:01:11,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:11,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:11,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1295797637, now seen corresponding path program 1 times [2024-11-17 00:01:11,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:11,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684060517] [2024-11-17 00:01:11,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:11,947 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-11-17 00:01:11,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:11,950 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:11,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 00:01:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:12,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:01:12,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:12,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:12,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:12,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684060517] [2024-11-17 00:01:12,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684060517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:12,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:12,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:01:12,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600553452] [2024-11-17 00:01:12,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:12,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:01:12,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:12,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:01:12,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:01:12,667 INFO L87 Difference]: Start difference. First operand 335 states and 428 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:13,254 INFO L93 Difference]: Finished difference Result 433 states and 547 transitions. [2024-11-17 00:01:13,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:01:13,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2024-11-17 00:01:13,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:13,257 INFO L225 Difference]: With dead ends: 433 [2024-11-17 00:01:13,257 INFO L226 Difference]: Without dead ends: 433 [2024-11-17 00:01:13,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 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-11-17 00:01:13,258 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 74 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:13,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 840 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:01:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-17 00:01:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 378. [2024-11-17 00:01:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 361 states have (on average 1.2493074792243768) internal successors, (451), 368 states have internal predecessors, (451), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 00:01:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 475 transitions. [2024-11-17 00:01:13,266 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 475 transitions. Word has length 158 [2024-11-17 00:01:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:13,267 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 475 transitions. [2024-11-17 00:01:13,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 475 transitions. [2024-11-17 00:01:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-17 00:01:13,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:13,269 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:01:13,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:01:13,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:13,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:13,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:13,471 INFO L85 PathProgramCache]: Analyzing trace with hash 934731802, now seen corresponding path program 1 times [2024-11-17 00:01:13,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:13,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019762837] [2024-11-17 00:01:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:13,472 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-11-17 00:01:13,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:13,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:13,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 00:01:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:13,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:01:13,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:14,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:14,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:14,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019762837] [2024-11-17 00:01:14,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019762837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:14,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:14,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:01:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444670925] [2024-11-17 00:01:14,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:14,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:01:14,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:14,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:01:14,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:01:14,010 INFO L87 Difference]: Start difference. First operand 378 states and 475 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:01:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:14,057 INFO L93 Difference]: Finished difference Result 381 states and 480 transitions. [2024-11-17 00:01:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:01:14,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 173 [2024-11-17 00:01:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:14,059 INFO L225 Difference]: With dead ends: 381 [2024-11-17 00:01:14,060 INFO L226 Difference]: Without dead ends: 381 [2024-11-17 00:01:14,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 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-11-17 00:01:14,060 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 0 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:14,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1235 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:01:14,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-17 00:01:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-11-17 00:01:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 363 states have (on average 1.2506887052341598) internal successors, (454), 371 states have internal predecessors, (454), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 00:01:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 480 transitions. [2024-11-17 00:01:14,068 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 480 transitions. Word has length 173 [2024-11-17 00:01:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:14,068 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 480 transitions. [2024-11-17 00:01:14,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:01:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 480 transitions. [2024-11-17 00:01:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-17 00:01:14,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:14,070 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:01:14,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-17 00:01:14,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:14,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:14,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1044404098, now seen corresponding path program 1 times [2024-11-17 00:01:14,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:14,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114806811] [2024-11-17 00:01:14,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:14,273 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-11-17 00:01:14,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:14,274 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:14,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 00:01:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:14,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:01:14,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:01:14,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:01:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:01:14,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:14,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114806811] [2024-11-17 00:01:14,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114806811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:01:14,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:01:14,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 00:01:14,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362222789] [2024-11-17 00:01:14,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:01:14,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:01:14,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:14,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:01:14,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:01:14,857 INFO L87 Difference]: Start difference. First operand 381 states and 480 transitions. Second operand has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:01:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:14,979 INFO L93 Difference]: Finished difference Result 392 states and 497 transitions. [2024-11-17 00:01:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:01:14,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 175 [2024-11-17 00:01:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:14,982 INFO L225 Difference]: With dead ends: 392 [2024-11-17 00:01:14,982 INFO L226 Difference]: Without dead ends: 392 [2024-11-17 00:01:14,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 342 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-11-17 00:01:14,982 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 5 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:14,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1642 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:01:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-17 00:01:14,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2024-11-17 00:01:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 371 states have (on average 1.261455525606469) internal successors, (468), 379 states have internal predecessors, (468), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 00:01:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 494 transitions. [2024-11-17 00:01:14,989 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 494 transitions. Word has length 175 [2024-11-17 00:01:14,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:14,989 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 494 transitions. [2024-11-17 00:01:14,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:01:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 494 transitions. [2024-11-17 00:01:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-17 00:01:14,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:14,991 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:01:15,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-17 00:01:15,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:15,192 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:15,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:15,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1617155514, now seen corresponding path program 2 times [2024-11-17 00:01:15,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:15,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461945574] [2024-11-17 00:01:15,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:01:15,193 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-11-17 00:01:15,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:15,195 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:15,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 00:01:15,485 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:01:15,486 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:01:15,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:01:15,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-17 00:01:15,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:15,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:15,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461945574] [2024-11-17 00:01:15,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461945574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:15,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:15,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:01:15,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393475609] [2024-11-17 00:01:15,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:15,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:01:15,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:15,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:01:15,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:01:15,516 INFO L87 Difference]: Start difference. First operand 390 states and 494 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:01:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:15,592 INFO L93 Difference]: Finished difference Result 393 states and 489 transitions. [2024-11-17 00:01:15,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:01:15,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 179 [2024-11-17 00:01:15,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:15,597 INFO L225 Difference]: With dead ends: 393 [2024-11-17 00:01:15,597 INFO L226 Difference]: Without dead ends: 393 [2024-11-17 00:01:15,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 176 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-11-17 00:01:15,597 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 30 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:15,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1144 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:01:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-17 00:01:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-17 00:01:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 374 states have (on average 1.2379679144385027) internal successors, (463), 382 states have internal predecessors, (463), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 00:01:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 489 transitions. [2024-11-17 00:01:15,604 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 489 transitions. Word has length 179 [2024-11-17 00:01:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:15,604 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 489 transitions. [2024-11-17 00:01:15,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:01:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 489 transitions. [2024-11-17 00:01:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-17 00:01:15,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:15,606 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:01:15,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-17 00:01:15,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:15,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:15,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:15,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1736794188, now seen corresponding path program 1 times [2024-11-17 00:01:15,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:15,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392085233] [2024-11-17 00:01:15,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:15,808 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-11-17 00:01:15,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:15,810 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:15,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 00:01:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:16,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:01:16,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:01:16,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:01:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:01:16,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:16,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392085233] [2024-11-17 00:01:16,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392085233] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:01:16,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:01:16,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 00:01:16,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721335035] [2024-11-17 00:01:16,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:01:16,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:01:16,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:16,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:01:16,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:01:16,537 INFO L87 Difference]: Start difference. First operand 393 states and 489 transitions. Second operand has 14 states, 14 states have (on average 13.142857142857142) internal successors, (184), 14 states have internal predecessors, (184), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:01:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:16,922 INFO L93 Difference]: Finished difference Result 408 states and 512 transitions. [2024-11-17 00:01:16,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:01:16,923 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 13.142857142857142) internal successors, (184), 14 states have internal predecessors, (184), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 179 [2024-11-17 00:01:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:16,924 INFO L225 Difference]: With dead ends: 408 [2024-11-17 00:01:16,924 INFO L226 Difference]: Without dead ends: 404 [2024-11-17 00:01:16,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:01:16,925 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 8 mSDsluCounter, 1999 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:16,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2401 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:01:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-17 00:01:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 402. [2024-11-17 00:01:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 383 states have (on average 1.2402088772845954) internal successors, (475), 391 states have internal predecessors, (475), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 00:01:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 501 transitions. [2024-11-17 00:01:16,932 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 501 transitions. Word has length 179 [2024-11-17 00:01:16,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:16,932 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 501 transitions. [2024-11-17 00:01:16,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.142857142857142) internal successors, (184), 14 states have internal predecessors, (184), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:01:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 501 transitions. [2024-11-17 00:01:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-17 00:01:16,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:16,934 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:01:16,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-17 00:01:17,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:17,135 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:17,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash -987618533, now seen corresponding path program 2 times [2024-11-17 00:01:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:17,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855774711] [2024-11-17 00:01:17,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:01:17,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-11-17 00:01:17,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:17,137 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:17,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 00:01:17,706 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:01:17,707 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:01:17,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:01:17,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 00:01:17,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:01:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-17 00:01:18,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:18,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855774711] [2024-11-17 00:01:18,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855774711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:01:18,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:01:18,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 00:01:18,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396227235] [2024-11-17 00:01:18,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:01:18,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:01:18,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:18,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:01:18,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:01:18,289 INFO L87 Difference]: Start difference. First operand 402 states and 501 transitions. Second operand has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 26 states have internal predecessors, (196), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:01:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:19,534 INFO L93 Difference]: Finished difference Result 426 states and 542 transitions. [2024-11-17 00:01:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 00:01:19,535 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 26 states have internal predecessors, (196), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 188 [2024-11-17 00:01:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:19,536 INFO L225 Difference]: With dead ends: 426 [2024-11-17 00:01:19,536 INFO L226 Difference]: Without dead ends: 422 [2024-11-17 00:01:19,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 00:01:19,537 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 14 mSDsluCounter, 4788 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5190 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:19,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5190 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:01:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-17 00:01:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2024-11-17 00:01:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 401 states have (on average 1.2443890274314215) internal successors, (499), 409 states have internal predecessors, (499), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 00:01:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 525 transitions. [2024-11-17 00:01:19,544 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 525 transitions. Word has length 188 [2024-11-17 00:01:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:19,544 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 525 transitions. [2024-11-17 00:01:19,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 26 states have internal predecessors, (196), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:01:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 525 transitions. [2024-11-17 00:01:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-17 00:01:19,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:19,546 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:01:19,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 00:01:19,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:19,747 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:19,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:19,747 INFO L85 PathProgramCache]: Analyzing trace with hash -347345349, now seen corresponding path program 3 times [2024-11-17 00:01:19,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:19,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001926272] [2024-11-17 00:01:19,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:01:19,748 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-11-17 00:01:19,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:19,751 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:19,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-17 00:01:20,316 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:01:20,316 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:01:20,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:01:20,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2024-11-17 00:01:20,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:20,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:20,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001926272] [2024-11-17 00:01:20,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001926272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:20,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:20,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:01:20,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612885391] [2024-11-17 00:01:20,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:20,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:01:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:20,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:01:20,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:01:20,354 INFO L87 Difference]: Start difference. First operand 420 states and 525 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:01:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:20,415 INFO L93 Difference]: Finished difference Result 423 states and 520 transitions. [2024-11-17 00:01:20,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:01:20,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 206 [2024-11-17 00:01:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:20,417 INFO L225 Difference]: With dead ends: 423 [2024-11-17 00:01:20,417 INFO L226 Difference]: Without dead ends: 423 [2024-11-17 00:01:20,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 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-11-17 00:01:20,418 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 33 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:20,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1108 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:01:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-17 00:01:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2024-11-17 00:01:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 404 states have (on average 1.2227722772277227) internal successors, (494), 412 states have internal predecessors, (494), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 00:01:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 520 transitions. [2024-11-17 00:01:20,424 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 520 transitions. Word has length 206 [2024-11-17 00:01:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:20,424 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 520 transitions. [2024-11-17 00:01:20,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:01:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 520 transitions. [2024-11-17 00:01:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-17 00:01:20,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:20,426 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:01:20,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-17 00:01:20,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:20,627 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:20,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:20,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1834538194, now seen corresponding path program 1 times [2024-11-17 00:01:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:20,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374102427] [2024-11-17 00:01:20,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:20,630 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-11-17 00:01:20,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:20,632 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:20,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 00:01:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:21,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 00:01:21,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-17 00:01:21,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:01:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-17 00:01:22,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:22,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374102427] [2024-11-17 00:01:22,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374102427] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:01:22,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:01:22,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 00:01:22,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122948268] [2024-11-17 00:01:22,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:01:22,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 00:01:22,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 00:01:22,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 00:01:22,912 INFO L87 Difference]: Start difference. First operand 423 states and 520 transitions. Second operand has 50 states, 50 states have (on average 4.4) internal successors, (220), 50 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:01:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:27,525 INFO L93 Difference]: Finished difference Result 463 states and 593 transitions. [2024-11-17 00:01:27,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 00:01:27,526 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.4) internal successors, (220), 50 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 206 [2024-11-17 00:01:27,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:27,527 INFO L225 Difference]: With dead ends: 463 [2024-11-17 00:01:27,527 INFO L226 Difference]: Without dead ends: 459 [2024-11-17 00:01:27,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 00:01:27,529 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 26 mSDsluCounter, 9696 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10087 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:27,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10087 Invalid, 2066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 00:01:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-17 00:01:27,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2024-11-17 00:01:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 438 states have (on average 1.2328767123287672) internal successors, (540), 446 states have internal predecessors, (540), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 00:01:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 566 transitions. [2024-11-17 00:01:27,537 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 566 transitions. Word has length 206 [2024-11-17 00:01:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:27,537 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 566 transitions. [2024-11-17 00:01:27,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.4) internal successors, (220), 50 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:01:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 566 transitions. [2024-11-17 00:01:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-17 00:01:27,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:27,539 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:01:27,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-17 00:01:27,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:27,740 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:27,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash 797246322, now seen corresponding path program 2 times [2024-11-17 00:01:27,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:27,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934783772] [2024-11-17 00:01:27,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:01:27,742 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-11-17 00:01:27,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:27,744 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:27,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-17 00:01:28,949 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:01:28,949 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:01:28,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:01:28,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:01:29,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:01:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:01:30,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:30,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934783772] [2024-11-17 00:01:30,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934783772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:01:30,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:01:30,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-17 00:01:30,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75413796] [2024-11-17 00:01:30,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:01:30,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-17 00:01:30,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:30,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-17 00:01:30,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-17 00:01:30,582 INFO L87 Difference]: Start difference. First operand 457 states and 566 transitions. Second operand has 52 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 52 states have internal predecessors, (218), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:01:35,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:35,156 INFO L93 Difference]: Finished difference Result 486 states and 622 transitions. [2024-11-17 00:01:35,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-17 00:01:35,157 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 52 states have internal predecessors, (218), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 240 [2024-11-17 00:01:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:35,158 INFO L225 Difference]: With dead ends: 486 [2024-11-17 00:01:35,158 INFO L226 Difference]: Without dead ends: 486 [2024-11-17 00:01:35,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-17 00:01:35,160 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 27 mSDsluCounter, 9653 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10043 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:35,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10043 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 00:01:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-17 00:01:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 482. [2024-11-17 00:01:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 463 states have (on average 1.2742980561555075) internal successors, (590), 471 states have internal predecessors, (590), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 00:01:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 616 transitions. [2024-11-17 00:01:35,167 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 616 transitions. Word has length 240 [2024-11-17 00:01:35,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:35,167 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 616 transitions. [2024-11-17 00:01:35,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 52 states have internal predecessors, (218), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:01:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 616 transitions. [2024-11-17 00:01:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-17 00:01:35,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:35,169 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:01:35,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-17 00:01:35,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:35,370 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:35,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:35,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1272037909, now seen corresponding path program 3 times [2024-11-17 00:01:35,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:35,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119463468] [2024-11-17 00:01:35,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:01:35,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:35,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:35,372 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:35,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-17 00:01:36,036 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:01:36,036 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:01:36,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:01:36,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4374 trivial. 0 not checked. [2024-11-17 00:01:36,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:36,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:36,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119463468] [2024-11-17 00:01:36,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119463468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:36,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:36,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:01:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871571927] [2024-11-17 00:01:36,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:36,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:01:36,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:36,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:01:36,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:01:36,112 INFO L87 Difference]: Start difference. First operand 482 states and 616 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:01:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:36,171 INFO L93 Difference]: Finished difference Result 476 states and 606 transitions. [2024-11-17 00:01:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:01:36,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 265 [2024-11-17 00:01:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:36,173 INFO L225 Difference]: With dead ends: 476 [2024-11-17 00:01:36,173 INFO L226 Difference]: Without dead ends: 476 [2024-11-17 00:01:36,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 261 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-11-17 00:01:36,173 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 6 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:36,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:01:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-17 00:01:36,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2024-11-17 00:01:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 457 states have (on average 1.2691466083150984) internal successors, (580), 465 states have internal predecessors, (580), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 00:01:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 606 transitions. [2024-11-17 00:01:36,184 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 606 transitions. Word has length 265 [2024-11-17 00:01:36,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:36,184 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 606 transitions. [2024-11-17 00:01:36,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:01:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 606 transitions. [2024-11-17 00:01:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-17 00:01:36,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:36,186 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:01:36,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-17 00:01:36,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:36,387 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:36,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:36,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1050985934, now seen corresponding path program 1 times [2024-11-17 00:01:36,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:36,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910394599] [2024-11-17 00:01:36,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:36,388 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-11-17 00:01:36,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:36,389 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:36,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-17 00:01:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:37,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 1737 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-17 00:01:37,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:01:39,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:01:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:01:43,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:43,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910394599] [2024-11-17 00:01:43,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910394599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:01:43,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:01:43,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-17 00:01:43,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391137935] [2024-11-17 00:01:43,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:01:43,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-17 00:01:43,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:43,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-17 00:01:43,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-17 00:01:43,839 INFO L87 Difference]: Start difference. First operand 476 states and 606 transitions. Second operand has 102 states, 102 states have (on average 2.627450980392157) internal successors, (268), 102 states have internal predecessors, (268), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:02:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:08,587 INFO L93 Difference]: Finished difference Result 534 states and 719 transitions. [2024-11-17 00:02:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-11-17 00:02:08,588 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 2.627450980392157) internal successors, (268), 102 states have internal predecessors, (268), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 265 [2024-11-17 00:02:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:08,589 INFO L225 Difference]: With dead ends: 534 [2024-11-17 00:02:08,589 INFO L226 Difference]: Without dead ends: 534 [2024-11-17 00:02:08,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7008 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=12595, Invalid=26807, Unknown=0, NotChecked=0, Total=39402 [2024-11-17 00:02:08,595 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 57 mSDsluCounter, 18721 mSDsCounter, 0 mSdLazyCounter, 5493 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 19107 SdHoareTripleChecker+Invalid, 5595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 5493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:02:08,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 19107 Invalid, 5595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 5493 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-17 00:02:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-17 00:02:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 530. [2024-11-17 00:02:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 511 states have (on average 1.3444227005870841) internal successors, (687), 519 states have internal predecessors, (687), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 00:02:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 713 transitions. [2024-11-17 00:02:08,604 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 713 transitions. Word has length 265 [2024-11-17 00:02:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:08,604 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 713 transitions. [2024-11-17 00:02:08,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 2.627450980392157) internal successors, (268), 102 states have internal predecessors, (268), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:02:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 713 transitions. [2024-11-17 00:02:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-17 00:02:08,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:08,606 INFO L215 NwaCegarLoop]: trace histogram [142, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:02:08,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-17 00:02:08,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:08,807 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:08,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:08,807 INFO L85 PathProgramCache]: Analyzing trace with hash -795811922, now seen corresponding path program 2 times [2024-11-17 00:02:08,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:08,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685846060] [2024-11-17 00:02:08,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:02:08,808 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-11-17 00:02:08,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:08,809 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:08,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-17 00:02:10,912 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:02:10,912 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:02:10,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 2287 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-17 00:02:10,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10301 backedges. 4459 proven. 4851 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:02:15,657 INFO L311 TraceCheckSpWp]: Computing backward predicates...