./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.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_JEN_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80f1df6d4bc7961b41bec7d16d328ef23e1639399b1fb3a18bcdda9891a98148 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:04:38,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:04:38,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-17 00:04:38,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:04:38,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:04:38,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:04:38,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:04:38,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:04:38,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:04:38,233 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:04:38,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:04:38,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:04:38,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:04:38,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:04:38,235 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:04:38,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:04:38,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:04:38,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:04:38,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:04:38,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:04:38,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:04:38,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:04:38,238 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:04:38,238 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:04:38,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:04:38,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:04:38,239 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:04:38,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:04:38,240 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:04:38,240 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:04:38,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:04:38,241 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:04:38,241 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:04:38,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:04:38,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:04:38,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:04:38,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:04:38,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:04:38,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:04:38,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:04:38,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:04:38,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:04:38,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:04:38,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:04:38,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:04:38,247 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 -> 80f1df6d4bc7961b41bec7d16d328ef23e1639399b1fb3a18bcdda9891a98148 [2024-11-17 00:04:38,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:04:38,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:04:38,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:04:38,519 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:04:38,519 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:04:38,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2024-11-17 00:04:39,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:04:40,269 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:04:40,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2024-11-17 00:04:40,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d4c29d2/e8a1573d8b7042b484fea59668c8a6cb/FLAG7f00603c8 [2024-11-17 00:04:40,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d4c29d2/e8a1573d8b7042b484fea59668c8a6cb [2024-11-17 00:04:40,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:04:40,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:04:40,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:04:40,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:04:40,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:04:40,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:04:40" (1/1) ... [2024-11-17 00:04:40,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7bfe1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:40, skipping insertion in model container [2024-11-17 00:04:40,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:04:40" (1/1) ... [2024-11-17 00:04:40,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:04:40,829 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:04:40,881 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:04:40,887 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:04:40,890 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:04:40,901 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:04:40,946 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:04:40,947 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:04:40,951 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:04:40,951 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:04:40,954 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:04:40,958 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:04:40,959 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:04:40,961 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:04:40,964 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:04:40,969 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:04:40,973 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:04:40,973 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:04:40,975 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:04:40,982 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:04:40,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:04:41,006 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:04:41,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@68f0f331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:41, skipping insertion in model container [2024-11-17 00:04:41,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:04:41,008 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 00:04:41,011 INFO L158 Benchmark]: Toolchain (without parser) took 687.85ms. Allocated memory is still 188.7MB. Free memory was 116.5MB in the beginning and 92.1MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-17 00:04:41,011 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 117.4MB. Free memory is still 78.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:04:41,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 684.91ms. Allocated memory is still 188.7MB. Free memory was 116.2MB in the beginning and 92.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-17 00:04:41,013 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.60ms. Allocated memory is still 117.4MB. Free memory is still 78.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 684.91ms. Allocated memory is still 188.7MB. Free memory was 116.2MB in the beginning and 92.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 778]: 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_JEN_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80f1df6d4bc7961b41bec7d16d328ef23e1639399b1fb3a18bcdda9891a98148 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:04:43,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:04:43,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-17 00:04:43,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:04:43,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:04:43,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:04:43,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:04:43,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:04:43,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:04:43,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:04:43,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:04:43,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:04:43,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:04:43,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:04:43,179 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:04:43,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:04:43,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:04:43,180 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:04:43,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:04:43,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:04:43,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:04:43,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:04:43,186 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:04:43,186 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:04:43,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:04:43,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:04:43,186 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:04:43,187 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:04:43,187 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:04:43,187 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:04:43,187 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:04:43,188 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:04:43,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:04:43,188 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:04:43,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:04:43,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:04:43,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:04:43,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:04:43,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:04:43,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:04:43,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:04:43,192 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:04:43,192 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:04:43,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:04:43,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:04:43,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:04:43,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:04:43,193 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 -> 80f1df6d4bc7961b41bec7d16d328ef23e1639399b1fb3a18bcdda9891a98148 [2024-11-17 00:04:43,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:04:43,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:04:43,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:04:43,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:04:43,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:04:43,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2024-11-17 00:04:45,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:04:45,450 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:04:45,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2024-11-17 00:04:45,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5d06807/7889013557c44372a982c78cf2b6b2b8/FLAGfa257b513 [2024-11-17 00:04:45,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5d06807/7889013557c44372a982c78cf2b6b2b8 [2024-11-17 00:04:45,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:04:45,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:04:45,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:04:45,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:04:45,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:04:45,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:04:45" (1/1) ... [2024-11-17 00:04:45,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4b12e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:45, skipping insertion in model container [2024-11-17 00:04:45,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:04:45" (1/1) ... [2024-11-17 00:04:45,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:04:45,995 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:04:46,032 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:04:46,036 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:04:46,040 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:04:46,045 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:04:46,095 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:04:46,096 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:04:46,099 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:04:46,099 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:04:46,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:04:46,104 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:04:46,106 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:04:46,106 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:04:46,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:04:46,114 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:04:46,115 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:04:46,116 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:04:46,116 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:04:46,120 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:04:46,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:04:46,137 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 00:04:46,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:04:46,183 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:04:46,199 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:04:46,201 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:04:46,206 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:04:46,214 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:04:46,237 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:04:46,241 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:04:46,243 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:04:46,245 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:04:46,247 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:04:46,248 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:04:46,249 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:04:46,249 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:04:46,253 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:04:46,254 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:04:46,255 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:04:46,255 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:04:46,256 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:04:46,260 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:04:46,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:04:46,275 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:04:46,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:04:46,459 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:04:46,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:46 WrapperNode [2024-11-17 00:04:46,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:04:46,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:04:46,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:04:46,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:04:46,469 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:04:46" (1/1) ... [2024-11-17 00:04:46,507 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:04:46" (1/1) ... [2024-11-17 00:04:46,576 INFO L138 Inliner]: procedures = 180, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1137 [2024-11-17 00:04:46,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:04:46,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:04:46,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:04:46,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:04:46,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:46" (1/1) ... [2024-11-17 00:04:46,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:46" (1/1) ... [2024-11-17 00:04:46,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:46" (1/1) ... [2024-11-17 00:04:46,735 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 268, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-11-17 00:04:46,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:46" (1/1) ... [2024-11-17 00:04:46,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:46" (1/1) ... [2024-11-17 00:04:46,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:46" (1/1) ... [2024-11-17 00:04:46,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:46" (1/1) ... [2024-11-17 00:04:46,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:46" (1/1) ... [2024-11-17 00:04:46,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:46" (1/1) ... [2024-11-17 00:04:46,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:04:46,799 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:04:46,800 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:04:46,800 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:04:46,800 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:46" (1/1) ... [2024-11-17 00:04:46,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:04:46,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:04:46,839 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:04:46,842 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:04:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 00:04:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 00:04:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 00:04:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 00:04:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 00:04:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 00:04:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 00:04:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 00:04:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 00:04:46,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 00:04:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 00:04:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 00:04:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 00:04:46,878 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 00:04:46,879 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 00:04:46,879 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 00:04:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-11-17 00:04:46,879 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-11-17 00:04:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:04:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:04:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:04:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:04:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:04:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:04:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:04:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:04:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:04:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:04:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 00:04:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 00:04:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 00:04:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 00:04:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 00:04:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 00:04:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:04:46,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:04:47,153 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:04:47,156 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:04:54,237 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 00:04:54,317 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-17 00:04:54,318 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:04:54,339 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:04:54,340 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:04:54,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:04:54 BoogieIcfgContainer [2024-11-17 00:04:54,341 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:04:54,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:04:54,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:04:54,347 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:04:54,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:04:45" (1/3) ... [2024-11-17 00:04:54,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72825133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:04:54, skipping insertion in model container [2024-11-17 00:04:54,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:04:46" (2/3) ... [2024-11-17 00:04:54,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72825133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:04:54, skipping insertion in model container [2024-11-17 00:04:54,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:04:54" (3/3) ... [2024-11-17 00:04:54,352 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test8-2.i [2024-11-17 00:04:54,367 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:04:54,368 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:04:54,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:04:54,424 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;@52559a48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:04:54,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:04:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 273 states, 244 states have (on average 1.651639344262295) internal successors, (403), 263 states have internal predecessors, (403), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-17 00:04:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:04:54,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:04:54,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:04:54,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:04:54,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:04:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash -692504238, now seen corresponding path program 1 times [2024-11-17 00:04:54,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:04:54,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117003207] [2024-11-17 00:04:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:04:54,452 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:04:54,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:04:54,463 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:04:54,465 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:04:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:04:54,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 00:04:54,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:04:54,696 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:04:54,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:04:54,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:04:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117003207] [2024-11-17 00:04:54,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117003207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:04:54,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:04:54,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:04:54,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363595732] [2024-11-17 00:04:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:04:54,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:04:54,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:04:54,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:04:54,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:04:54,740 INFO L87 Difference]: Start difference. First operand has 273 states, 244 states have (on average 1.651639344262295) internal successors, (403), 263 states have internal predecessors, (403), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 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:04:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:04:54,801 INFO L93 Difference]: Finished difference Result 271 states and 367 transitions. [2024-11-17 00:04:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:04:54,804 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:04:54,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:04:54,826 INFO L225 Difference]: With dead ends: 271 [2024-11-17 00:04:54,826 INFO L226 Difference]: Without dead ends: 268 [2024-11-17 00:04:54,828 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:04:54,835 INFO L432 NwaCegarLoop]: 367 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, 367 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:04:54,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:04:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-17 00:04:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-17 00:04:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 241 states have (on average 1.3360995850622406) internal successors, (322), 258 states have internal predecessors, (322), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-17 00:04:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 364 transitions. [2024-11-17 00:04:54,943 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 364 transitions. Word has length 11 [2024-11-17 00:04:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:04:54,944 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 364 transitions. [2024-11-17 00:04:54,944 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:04:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 364 transitions. [2024-11-17 00:04:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:04:54,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:04:54,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:04:54,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-17 00:04:55,145 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:04:55,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:04:55,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:04:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1391014543, now seen corresponding path program 1 times [2024-11-17 00:04:55,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:04:55,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681007886] [2024-11-17 00:04:55,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:04:55,148 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:04:55,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:04:55,149 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:04:55,150 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:04:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:04:55,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:04:55,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:04:55,431 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:04:55,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:04:55,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:04:55,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681007886] [2024-11-17 00:04:55,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681007886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:04:55,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:04:55,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:04:55,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191308144] [2024-11-17 00:04:55,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:04:55,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:04:55,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:04:55,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:04:55,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:04:55,439 INFO L87 Difference]: Start difference. First operand 268 states and 364 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:04:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:04:56,280 INFO L93 Difference]: Finished difference Result 416 states and 557 transitions. [2024-11-17 00:04:56,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:04:56,284 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:04:56,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:04:56,286 INFO L225 Difference]: With dead ends: 416 [2024-11-17 00:04:56,287 INFO L226 Difference]: Without dead ends: 416 [2024-11-17 00:04:56,287 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:04:56,288 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 179 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:04:56,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 673 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 00:04:56,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-17 00:04:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 382. [2024-11-17 00:04:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 354 states have (on average 1.3276836158192091) internal successors, (470), 371 states have internal predecessors, (470), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-17 00:04:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 514 transitions. [2024-11-17 00:04:56,317 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 514 transitions. Word has length 15 [2024-11-17 00:04:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:04:56,317 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 514 transitions. [2024-11-17 00:04:56,320 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:04:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 514 transitions. [2024-11-17 00:04:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:04:56,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:04:56,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:04:56,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 00:04:56,522 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:04:56,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:04:56,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:04:56,524 INFO L85 PathProgramCache]: Analyzing trace with hash -503510862, now seen corresponding path program 1 times [2024-11-17 00:04:56,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:04:56,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192951214] [2024-11-17 00:04:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:04:56,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:04:56,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:04:56,528 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:04:56,530 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:04:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:04:56,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:04:56,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:04:56,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:04:56,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:04:56,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:04:56,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-17 00:04:56,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:04:56,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 00:04:56,848 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:04:56,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:04:56,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:04:56,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192951214] [2024-11-17 00:04:56,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192951214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:04:56,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:04:56,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:04:56,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591847694] [2024-11-17 00:04:56,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:04:56,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:04:56,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:04:56,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:04:56,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:04:56,851 INFO L87 Difference]: Start difference. First operand 382 states and 514 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:04:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:04:57,351 INFO L93 Difference]: Finished difference Result 582 states and 778 transitions. [2024-11-17 00:04:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:04:57,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:04:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:04:57,354 INFO L225 Difference]: With dead ends: 582 [2024-11-17 00:04:57,355 INFO L226 Difference]: Without dead ends: 582 [2024-11-17 00:04:57,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:04:57,356 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 267 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:04:57,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1079 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:04:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-17 00:04:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 381. [2024-11-17 00:04:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 353 states have (on average 1.3257790368271956) internal successors, (468), 370 states have internal predecessors, (468), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-17 00:04:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 512 transitions. [2024-11-17 00:04:57,381 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 512 transitions. Word has length 15 [2024-11-17 00:04:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:04:57,382 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 512 transitions. [2024-11-17 00:04:57,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:04:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 512 transitions. [2024-11-17 00:04:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-17 00:04:57,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:04:57,388 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:04:57,396 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:04:57,589 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:04:57,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:04:57,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:04:57,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1377768136, now seen corresponding path program 1 times [2024-11-17 00:04:57,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:04:57,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552830356] [2024-11-17 00:04:57,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:04:57,592 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:04:57,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:04:57,595 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:04:57,597 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:04:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:04:58,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:04:58,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:04:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:04:58,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:04:58,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:04:58,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552830356] [2024-11-17 00:04:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552830356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:04:58,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:04:58,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:04:58,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352105653] [2024-11-17 00:04:58,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:04:58,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:04:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:04:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:04:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:04:58,073 INFO L87 Difference]: Start difference. First operand 381 states and 512 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:04:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:04:58,180 INFO L93 Difference]: Finished difference Result 387 states and 502 transitions. [2024-11-17 00:04:58,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:04:58,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2024-11-17 00:04:58,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:04:58,183 INFO L225 Difference]: With dead ends: 387 [2024-11-17 00:04:58,183 INFO L226 Difference]: Without dead ends: 387 [2024-11-17 00:04:58,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:04:58,184 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 30 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 982 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:04:58,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 982 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:04:58,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-17 00:04:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2024-11-17 00:04:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 359 states have (on average 1.275766016713092) internal successors, (458), 376 states have internal predecessors, (458), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-17 00:04:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 502 transitions. [2024-11-17 00:04:58,197 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 502 transitions. Word has length 83 [2024-11-17 00:04:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:04:58,198 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 502 transitions. [2024-11-17 00:04:58,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:04:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 502 transitions. [2024-11-17 00:04:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-17 00:04:58,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:04:58,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:04:58,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 00:04:58,401 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:04:58,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:04:58,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:04:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash 857128718, now seen corresponding path program 1 times [2024-11-17 00:04:58,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:04:58,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766199269] [2024-11-17 00:04:58,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:04:58,403 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:04:58,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:04:58,406 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:04:58,408 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:04:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:04:58,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:04:58,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:04:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:04:58,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:04:58,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:04:58,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766199269] [2024-11-17 00:04:58,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766199269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:04:58,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:04:58,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:04:58,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625640921] [2024-11-17 00:04:58,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:04:58,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:04:58,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:04:58,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:04:58,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:04:58,921 INFO L87 Difference]: Start difference. First operand 387 states and 502 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:04:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:04:58,970 INFO L93 Difference]: Finished difference Result 390 states and 506 transitions. [2024-11-17 00:04:58,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:04:58,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2024-11-17 00:04:58,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:04:58,974 INFO L225 Difference]: With dead ends: 390 [2024-11-17 00:04:58,974 INFO L226 Difference]: Without dead ends: 390 [2024-11-17 00:04:58,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:04:58,977 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 0 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:04:58,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1046 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:04:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-17 00:04:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-11-17 00:04:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 361 states have (on average 1.2770083102493075) internal successors, (461), 379 states have internal predecessors, (461), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-17 00:04:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 506 transitions. [2024-11-17 00:04:58,993 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 506 transitions. Word has length 83 [2024-11-17 00:04:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:04:58,993 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 506 transitions. [2024-11-17 00:04:58,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:04:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 506 transitions. [2024-11-17 00:04:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-17 00:04:58,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:04:58,996 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:04:59,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 00:04:59,202 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:04:59,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:04:59,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:04:59,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1058119282, now seen corresponding path program 1 times [2024-11-17 00:04:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:04:59,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190200467] [2024-11-17 00:04:59,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:04:59,204 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:04:59,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:04:59,205 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:04:59,206 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:04:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:04:59,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:04:59,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:04:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:04:59,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:04:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:04:59,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:04:59,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190200467] [2024-11-17 00:04:59,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190200467] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:04:59,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:04:59,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 00:04:59,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926956089] [2024-11-17 00:04:59,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:04:59,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:04:59,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:04:59,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:04:59,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:04:59,885 INFO L87 Difference]: Start difference. First operand 390 states and 506 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:05:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:00,082 INFO L93 Difference]: Finished difference Result 401 states and 522 transitions. [2024-11-17 00:05:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:05:00,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 85 [2024-11-17 00:05:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:00,088 INFO L225 Difference]: With dead ends: 401 [2024-11-17 00:05:00,088 INFO L226 Difference]: Without dead ends: 401 [2024-11-17 00:05:00,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:05:00,089 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 4 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:00,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1739 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:05:00,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-17 00:05:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 399. [2024-11-17 00:05:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 369 states have (on average 1.2872628726287263) internal successors, (475), 387 states have internal predecessors, (475), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-17 00:05:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 520 transitions. [2024-11-17 00:05:00,107 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 520 transitions. Word has length 85 [2024-11-17 00:05:00,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:00,107 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 520 transitions. [2024-11-17 00:05:00,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:05:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 520 transitions. [2024-11-17 00:05:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-17 00:05:00,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:00,113 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:00,132 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:05:00,314 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:05:00,314 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:00,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:00,315 INFO L85 PathProgramCache]: Analyzing trace with hash -511389138, now seen corresponding path program 2 times [2024-11-17 00:05:00,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:00,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54375012] [2024-11-17 00:05:00,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:05:00,316 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:05:00,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:00,317 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:05:00,318 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:05:01,290 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:05:01,291 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:05:01,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:05:01,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:05:01,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:05:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:05:01,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:01,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54375012] [2024-11-17 00:05:01,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54375012] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:05:01,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:05:01,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 00:05:01,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825519149] [2024-11-17 00:05:01,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:05:01,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:05:01,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:01,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:05:01,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:05:01,605 INFO L87 Difference]: Start difference. First operand 399 states and 520 transitions. Second operand has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:05:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:02,170 INFO L93 Difference]: Finished difference Result 414 states and 542 transitions. [2024-11-17 00:05:02,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:05:02,171 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 89 [2024-11-17 00:05:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:02,173 INFO L225 Difference]: With dead ends: 414 [2024-11-17 00:05:02,173 INFO L226 Difference]: Without dead ends: 410 [2024-11-17 00:05:02,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:05:02,175 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 8 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:02,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2094 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:05:02,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-17 00:05:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2024-11-17 00:05:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 378 states have (on average 1.2883597883597884) internal successors, (487), 396 states have internal predecessors, (487), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-17 00:05:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 532 transitions. [2024-11-17 00:05:02,185 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 532 transitions. Word has length 89 [2024-11-17 00:05:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:02,186 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 532 transitions. [2024-11-17 00:05:02,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:05:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 532 transitions. [2024-11-17 00:05:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 00:05:02,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:02,188 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:02,206 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:05:02,388 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:05:02,389 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:02,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1586690503, now seen corresponding path program 3 times [2024-11-17 00:05:02,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:02,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845336904] [2024-11-17 00:05:02,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:05:02,390 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:05:02,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:02,392 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:05:02,393 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:05:04,265 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-17 00:05:04,265 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:05:04,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:05:04,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-17 00:05:04,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:05:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-17 00:05:04,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:04,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845336904] [2024-11-17 00:05:04,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845336904] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:05:04,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:05:04,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-17 00:05:04,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730571464] [2024-11-17 00:05:04,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:05:04,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 00:05:04,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:04,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 00:05:04,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:05:04,690 INFO L87 Difference]: Start difference. First operand 408 states and 532 transitions. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:05:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:05,199 INFO L93 Difference]: Finished difference Result 419 states and 549 transitions. [2024-11-17 00:05:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-17 00:05:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 98 [2024-11-17 00:05:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:05,202 INFO L225 Difference]: With dead ends: 419 [2024-11-17 00:05:05,202 INFO L226 Difference]: Without dead ends: 417 [2024-11-17 00:05:05,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-17 00:05:05,203 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 9 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:05,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2440 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:05:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-17 00:05:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 415. [2024-11-17 00:05:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 385 states have (on average 1.2987012987012987) internal successors, (500), 403 states have internal predecessors, (500), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-17 00:05:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 545 transitions. [2024-11-17 00:05:05,216 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 545 transitions. Word has length 98 [2024-11-17 00:05:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:05,217 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 545 transitions. [2024-11-17 00:05:05,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:05:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 545 transitions. [2024-11-17 00:05:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-17 00:05:05,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:05,219 INFO L215 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:05,237 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:05:05,419 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:05:05,420 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:05,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:05,420 INFO L85 PathProgramCache]: Analyzing trace with hash 661875630, now seen corresponding path program 4 times [2024-11-17 00:05:05,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:05,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672231749] [2024-11-17 00:05:05,421 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 00:05:05,421 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:05:05,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:05,424 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:05:05,425 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:05:06,070 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 00:05:06,071 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:05:06,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:05:06,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 146 proven. 55 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-17 00:05:06,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:05:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-17 00:05:06,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:06,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672231749] [2024-11-17 00:05:06,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672231749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:05:06,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:05:06,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 00:05:06,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367021137] [2024-11-17 00:05:06,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:05:06,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:05:06,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:06,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:05:06,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:05:06,825 INFO L87 Difference]: Start difference. First operand 415 states and 545 transitions. Second operand has 26 states, 26 states have (on average 4.0) internal successors, (104), 26 states have internal predecessors, (104), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:05:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:08,258 INFO L93 Difference]: Finished difference Result 433 states and 573 transitions. [2024-11-17 00:05:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 00:05:08,259 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.0) internal successors, (104), 26 states have internal predecessors, (104), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 105 [2024-11-17 00:05:08,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:08,263 INFO L225 Difference]: With dead ends: 433 [2024-11-17 00:05:08,263 INFO L226 Difference]: Without dead ends: 429 [2024-11-17 00:05:08,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 00:05:08,266 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 14 mSDsluCounter, 3832 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4182 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:08,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4182 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 00:05:08,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-17 00:05:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2024-11-17 00:05:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 397 states have (on average 1.2896725440806045) internal successors, (512), 415 states have internal predecessors, (512), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-17 00:05:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 557 transitions. [2024-11-17 00:05:08,279 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 557 transitions. Word has length 105 [2024-11-17 00:05:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:08,279 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 557 transitions. [2024-11-17 00:05:08,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.0) internal successors, (104), 26 states have internal predecessors, (104), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:05:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 557 transitions. [2024-11-17 00:05:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-17 00:05:08,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:08,280 INFO L215 NwaCegarLoop]: trace histogram [34, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:08,300 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:05:08,481 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:05:08,481 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:08,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash 609224942, now seen corresponding path program 5 times [2024-11-17 00:05:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:08,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260730744] [2024-11-17 00:05:08,483 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 00:05:08,483 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:05:08,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:08,484 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:05:08,485 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:05:09,665 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2024-11-17 00:05:09,666 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:05:09,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 00:05:09,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 302 proven. 253 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-17 00:05:10,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:05:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 554 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-17 00:05:11,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:11,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260730744] [2024-11-17 00:05:11,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260730744] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:05:11,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:05:11,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 00:05:11,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720473532] [2024-11-17 00:05:11,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:05:11,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 00:05:11,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:11,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 00:05:11,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 00:05:11,955 INFO L87 Difference]: Start difference. First operand 427 states and 557 transitions. Second operand has 50 states, 50 states have (on average 2.56) internal successors, (128), 50 states have internal predecessors, (128), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:05:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:17,522 INFO L93 Difference]: Finished difference Result 466 states and 627 transitions. [2024-11-17 00:05:17,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 00:05:17,523 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.56) internal successors, (128), 50 states have internal predecessors, (128), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 117 [2024-11-17 00:05:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:17,528 INFO L225 Difference]: With dead ends: 466 [2024-11-17 00:05:17,528 INFO L226 Difference]: Without dead ends: 462 [2024-11-17 00:05:17,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 00:05:17,532 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 26 mSDsluCounter, 9042 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9392 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:17,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9392 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-17 00:05:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-17 00:05:17,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2024-11-17 00:05:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 430 states have (on average 1.2930232558139534) internal successors, (556), 448 states have internal predecessors, (556), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-17 00:05:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 601 transitions. [2024-11-17 00:05:17,546 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 601 transitions. Word has length 117 [2024-11-17 00:05:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:17,547 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 601 transitions. [2024-11-17 00:05:17,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.56) internal successors, (128), 50 states have internal predecessors, (128), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:05:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 601 transitions. [2024-11-17 00:05:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-17 00:05:17,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:17,549 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:17,573 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 (11)] Forceful destruction successful, exit code 0 [2024-11-17 00:05:17,749 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:05:17,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:17,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:17,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1254030073, now seen corresponding path program 6 times [2024-11-17 00:05:17,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:17,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428547006] [2024-11-17 00:05:17,752 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-17 00:05:17,752 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:05:17,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:17,755 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:05:17,756 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:05:25,080 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2024-11-17 00:05:25,080 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:05:25,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 00:05:25,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:05:25,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:05:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:05:27,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:27,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428547006] [2024-11-17 00:05:27,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428547006] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:05:27,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:05:27,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-17 00:05:27,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004873403] [2024-11-17 00:05:27,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:05:27,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-17 00:05:27,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:27,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-17 00:05:27,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-17 00:05:27,526 INFO L87 Difference]: Start difference. First operand 460 states and 601 transitions. Second operand has 52 states, 52 states have (on average 2.423076923076923) internal successors, (126), 52 states have internal predecessors, (126), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:05:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:34,532 INFO L93 Difference]: Finished difference Result 489 states and 654 transitions. [2024-11-17 00:05:34,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-17 00:05:34,535 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.423076923076923) internal successors, (126), 52 states have internal predecessors, (126), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 150 [2024-11-17 00:05:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:34,537 INFO L225 Difference]: With dead ends: 489 [2024-11-17 00:05:34,537 INFO L226 Difference]: Without dead ends: 487 [2024-11-17 00:05:34,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-17 00:05:34,542 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 27 mSDsluCounter, 8700 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 9050 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:34,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 9050 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 00:05:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-17 00:05:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2024-11-17 00:05:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 455 states have (on average 1.3296703296703296) internal successors, (605), 473 states have internal predecessors, (605), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-17 00:05:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 650 transitions. [2024-11-17 00:05:34,555 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 650 transitions. Word has length 150 [2024-11-17 00:05:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:34,557 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 650 transitions. [2024-11-17 00:05:34,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.423076923076923) internal successors, (126), 52 states have internal predecessors, (126), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:05:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 650 transitions. [2024-11-17 00:05:34,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-17 00:05:34,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:34,559 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:34,599 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:05:34,760 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:05:34,760 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:34,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:34,760 INFO L85 PathProgramCache]: Analyzing trace with hash 877370190, now seen corresponding path program 7 times [2024-11-17 00:05:34,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:34,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902107462] [2024-11-17 00:05:34,761 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-17 00:05:34,761 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:05:34,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:34,762 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:05:34,763 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:05:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:05:36,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-17 00:05:36,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:05:38,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:05:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:05:44,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:44,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902107462] [2024-11-17 00:05:44,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902107462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:05:44,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:05:44,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-17 00:05:44,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796255387] [2024-11-17 00:05:44,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:05:44,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-17 00:05:44,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:44,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-17 00:05:44,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-17 00:05:44,348 INFO L87 Difference]: Start difference. First operand 485 states and 650 transitions. Second operand has 102 states, 102 states have (on average 1.7254901960784315) internal successors, (176), 102 states have internal predecessors, (176), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)