./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_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-wip.dd.update-z3-fca748b-m [2024-11-20 14:14:45,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:14:45,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-20 14:14:45,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:14:45,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:14:45,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:14:45,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:14:45,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:14:45,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:14:45,271 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:14:45,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:14:45,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:14:45,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:14:45,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:14:45,275 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:14:45,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:14:45,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 14:14:45,276 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:14:45,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:14:45,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:14:45,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:14:45,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 14:14:45,280 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:14:45,280 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:14:45,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:14:45,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 14:14:45,281 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:14:45,281 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:14:45,282 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:14:45,282 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:14:45,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 14:14:45,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:14:45,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:14:45,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:14:45,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:14:45,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:14:45,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:14:45,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:14:45,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:14:45,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:14:45,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:14:45,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:14:45,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:14:45,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:14:45,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:14:45,288 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-20 14:14:45,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:14:45,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:14:45,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:14:45,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:14:45,549 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:14:45,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2024-11-20 14:14:46,973 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:14:47,298 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:14:47,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2024-11-20 14:14:47,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74e6539a6/24fa1badc3b8487b9a9395606ca4d2a0/FLAGe51bbd99d [2024-11-20 14:14:47,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74e6539a6/24fa1badc3b8487b9a9395606ca4d2a0 [2024-11-20 14:14:47,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:14:47,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:14:47,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:14:47,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:14:47,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:14:47,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:14:47" (1/1) ... [2024-11-20 14:14:47,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f16206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:47, skipping insertion in model container [2024-11-20 14:14:47,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:14:47" (1/1) ... [2024-11-20 14:14:47,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:14:48,024 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,060 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,063 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,066 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,075 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,116 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,118 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,120 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,121 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,125 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,127 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,129 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,130 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,137 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,138 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,141 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,143 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,143 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,148 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:48,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:14:48,179 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-20 14:14:48,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@30e9adc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:48, skipping insertion in model container [2024-11-20 14:14:48,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:14:48,181 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-20 14:14:48,183 INFO L158 Benchmark]: Toolchain (without parser) took 633.14ms. Allocated memory is still 188.7MB. Free memory was 155.7MB in the beginning and 130.9MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 14:14:48,184 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 140.5MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:14:48,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.19ms. Allocated memory is still 188.7MB. Free memory was 155.7MB in the beginning and 130.9MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 14:14:48,186 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.19ms. Allocated memory is still 140.5MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.19ms. Allocated memory is still 188.7MB. Free memory was 155.7MB in the beginning and 130.9MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_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-wip.dd.update-z3-fca748b-m [2024-11-20 14:14:50,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:14:50,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-20 14:14:50,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:14:50,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:14:50,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:14:50,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:14:50,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:14:50,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:14:50,296 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:14:50,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:14:50,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:14:50,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:14:50,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:14:50,299 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:14:50,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:14:50,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 14:14:50,300 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:14:50,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:14:50,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:14:50,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:14:50,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 14:14:50,305 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:14:50,305 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:14:50,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:14:50,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 14:14:50,306 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:14:50,306 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 14:14:50,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:14:50,307 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 14:14:50,307 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:14:50,307 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:14:50,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 14:14:50,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:14:50,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:14:50,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:14:50,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:14:50,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:14:50,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:14:50,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:14:50,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:14:50,312 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 14:14:50,312 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 14:14:50,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:14:50,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:14:50,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:14:50,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:14:50,313 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-20 14:14:50,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:14:50,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:14:50,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:14:50,673 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:14:50,673 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:14:50,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2024-11-20 14:14:52,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:14:52,505 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:14:52,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2024-11-20 14:14:52,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb6d0d71/1afc7899ee5942cca5051407adc8fdf4/FLAGb3200dd8d [2024-11-20 14:14:52,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb6d0d71/1afc7899ee5942cca5051407adc8fdf4 [2024-11-20 14:14:52,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:14:52,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:14:52,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:14:52,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:14:52,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:14:52,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:14:52" (1/1) ... [2024-11-20 14:14:52,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3590543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:52, skipping insertion in model container [2024-11-20 14:14:52,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:14:52" (1/1) ... [2024-11-20 14:14:52,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:14:53,049 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,086 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,091 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,096 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,103 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,139 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,139 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,142 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,142 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,146 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,151 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,152 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,152 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,157 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,158 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,159 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,160 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,161 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,168 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:14:53,198 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-20 14:14:53,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:14:53,239 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,257 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,259 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,261 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,264 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,279 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,279 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,281 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,281 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,283 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,284 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,288 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,289 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,292 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,294 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,295 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,296 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,296 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,300 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:14:53,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:14:53,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:14:53,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:14:53,439 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:14:53,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53 WrapperNode [2024-11-20 14:14:53,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:14:53,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:14:53,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:14:53,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:14:53,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53" (1/1) ... [2024-11-20 14:14:53,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53" (1/1) ... [2024-11-20 14:14:53,562 INFO L138 Inliner]: procedures = 180, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1176 [2024-11-20 14:14:53,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:14:53,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:14:53,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:14:53,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:14:53,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53" (1/1) ... [2024-11-20 14:14:53,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53" (1/1) ... [2024-11-20 14:14:53,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53" (1/1) ... [2024-11-20 14:14:53,712 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-20 14:14:53,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53" (1/1) ... [2024-11-20 14:14:53,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53" (1/1) ... [2024-11-20 14:14:53,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53" (1/1) ... [2024-11-20 14:14:53,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53" (1/1) ... [2024-11-20 14:14:53,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53" (1/1) ... [2024-11-20 14:14:53,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53" (1/1) ... [2024-11-20 14:14:53,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:14:53,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:14:53,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:14:53,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:14:53,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53" (1/1) ... [2024-11-20 14:14:53,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:14:53,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:14:53,869 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-20 14:14:53,876 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-20 14:14:53,916 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-20 14:14:53,917 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-20 14:14:53,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 14:14:53,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 14:14:53,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 14:14:53,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 14:14:53,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 14:14:53,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 14:14:53,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 14:14:53,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 14:14:53,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-20 14:14:53,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-20 14:14:53,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-20 14:14:53,920 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-20 14:14:53,921 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-20 14:14:53,921 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-20 14:14:53,921 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-11-20 14:14:53,921 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-11-20 14:14:53,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:14:53,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:14:53,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:14:53,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 14:14:53,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 14:14:53,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 14:14:53,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:14:53,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:14:53,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 14:14:53,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:14:53,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 14:14:53,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 14:14:53,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 14:14:53,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 14:14:53,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 14:14:53,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 14:14:53,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:14:53,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:14:54,159 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:14:54,161 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:15:02,974 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-20 14:15:02,975 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:15:03,001 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:15:03,001 INFO L316 CfgBuilder]: Removed 71 assume(true) statements. [2024-11-20 14:15:03,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:15:03 BoogieIcfgContainer [2024-11-20 14:15:03,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:15:03,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:15:03,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:15:03,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:15:03,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:14:52" (1/3) ... [2024-11-20 14:15:03,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3488f4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:15:03, skipping insertion in model container [2024-11-20 14:15:03,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53" (2/3) ... [2024-11-20 14:15:03,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3488f4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:15:03, skipping insertion in model container [2024-11-20 14:15:03,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:15:03" (3/3) ... [2024-11-20 14:15:03,012 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test8-2.i [2024-11-20 14:15:03,028 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:15:03,029 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 14:15:03,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:15:03,093 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;@4cf75ec3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:15:03,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 14:15:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 268 states, 239 states have (on average 1.6652719665271967) internal successors, (398), 258 states have internal predecessors, (398), 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-20 14:15:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 14:15:03,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:15:03,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:15:03,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:15:03,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:15:03,116 INFO L85 PathProgramCache]: Analyzing trace with hash 901390748, now seen corresponding path program 1 times [2024-11-20 14:15:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:15:03,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693768458] [2024-11-20 14:15:03,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:15:03,130 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-20 14:15:03,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:15:03,134 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-20 14:15:03,154 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-20 14:15:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:15:03,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 14:15:03,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:15:03,364 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-20 14:15:03,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:15:03,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:15:03,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693768458] [2024-11-20 14:15:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693768458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:15:03,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:15:03,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:15:03,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256600357] [2024-11-20 14:15:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:15:03,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 14:15:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:15:03,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 14:15:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 14:15:03,405 INFO L87 Difference]: Start difference. First operand has 268 states, 239 states have (on average 1.6652719665271967) internal successors, (398), 258 states have internal predecessors, (398), 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-20 14:15:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:15:03,453 INFO L93 Difference]: Finished difference Result 266 states and 362 transitions. [2024-11-20 14:15:03,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 14:15:03,455 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-20 14:15:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:15:03,489 INFO L225 Difference]: With dead ends: 266 [2024-11-20 14:15:03,491 INFO L226 Difference]: Without dead ends: 264 [2024-11-20 14:15:03,495 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-20 14:15:03,500 INFO L432 NwaCegarLoop]: 362 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, 362 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-20 14:15:03,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:15:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-20 14:15:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-20 14:15:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 237 states have (on average 1.3417721518987342) internal successors, (318), 254 states have internal predecessors, (318), 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-20 14:15:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 360 transitions. [2024-11-20 14:15:03,622 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 360 transitions. Word has length 11 [2024-11-20 14:15:03,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:15:03,623 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 360 transitions. [2024-11-20 14:15:03,623 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-20 14:15:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 360 transitions. [2024-11-20 14:15:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:15:03,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:15:03,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:15:03,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 14:15:03,824 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-20 14:15:03,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:15:03,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:15:03,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1574241252, now seen corresponding path program 1 times [2024-11-20 14:15:03,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:15:03,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334943262] [2024-11-20 14:15:03,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:15:03,828 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-20 14:15:03,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:15:03,831 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-20 14:15:03,832 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-20 14:15:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:15:04,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 14:15:04,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:15:04,061 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:15:04,063 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:15:04,064 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:15:04,080 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-20 14:15:04,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:15:04,167 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-20 14:15:04,187 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-20 14:15:04,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:15:04,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:15:04,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334943262] [2024-11-20 14:15:04,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334943262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:15:04,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:15:04,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:15:04,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364516705] [2024-11-20 14:15:04,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:15:04,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:15:04,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:15:04,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:15:04,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:15:04,194 INFO L87 Difference]: Start difference. First operand 264 states and 360 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-20 14:15:04,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:15:04,848 INFO L93 Difference]: Finished difference Result 477 states and 641 transitions. [2024-11-20 14:15:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:15:04,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-20 14:15:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:15:04,852 INFO L225 Difference]: With dead ends: 477 [2024-11-20 14:15:04,852 INFO L226 Difference]: Without dead ends: 477 [2024-11-20 14:15:04,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-20 14:15:04,854 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 267 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1065 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.6s IncrementalHoareTripleChecker+Time [2024-11-20 14:15:04,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1065 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 14:15:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-20 14:15:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 266. [2024-11-20 14:15:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 239 states have (on average 1.3389121338912133) internal successors, (320), 256 states have internal predecessors, (320), 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-20 14:15:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 362 transitions. [2024-11-20 14:15:04,883 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 362 transitions. Word has length 13 [2024-11-20 14:15:04,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:15:04,884 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 362 transitions. [2024-11-20 14:15:04,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-20 14:15:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 362 transitions. [2024-11-20 14:15:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 14:15:04,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:15:04,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:15:04,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 14:15:05,087 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-20 14:15:05,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:15:05,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:15:05,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1418349862, now seen corresponding path program 1 times [2024-11-20 14:15:05,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:15:05,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218930230] [2024-11-20 14:15:05,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:15:05,090 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-20 14:15:05,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:15:05,093 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-20 14:15:05,095 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-20 14:15:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:15:05,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 14:15:05,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:15:05,528 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-20 14:15:05,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:15:05,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:15:05,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218930230] [2024-11-20 14:15:05,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218930230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:15:05,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:15:05,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:15:05,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257475538] [2024-11-20 14:15:05,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:15:05,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:15:05,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:15:05,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:15:05,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:15:05,532 INFO L87 Difference]: Start difference. First operand 266 states and 362 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:15:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:15:05,681 INFO L93 Difference]: Finished difference Result 269 states and 357 transitions. [2024-11-20 14:15:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:15:05,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-20 14:15:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:15:05,683 INFO L225 Difference]: With dead ends: 269 [2024-11-20 14:15:05,684 INFO L226 Difference]: Without dead ends: 269 [2024-11-20 14:15:05,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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-20 14:15:05,685 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 30 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 971 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-20 14:15:05,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 971 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:15:05,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-20 14:15:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-20 14:15:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 259 states have internal predecessors, (315), 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-20 14:15:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 357 transitions. [2024-11-20 14:15:05,701 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 357 transitions. Word has length 67 [2024-11-20 14:15:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:15:05,701 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 357 transitions. [2024-11-20 14:15:05,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:15:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 357 transitions. [2024-11-20 14:15:05,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 14:15:05,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:15:05,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:15:05,718 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-20 14:15:05,906 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-20 14:15:05,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:15:05,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:15:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1396463258, now seen corresponding path program 1 times [2024-11-20 14:15:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:15:05,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311386063] [2024-11-20 14:15:05,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:15:05,909 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-20 14:15:05,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:15:05,912 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-20 14:15:05,914 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-20 14:15:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:15:06,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 14:15:06,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:15:06,377 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-20 14:15:06,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:15:06,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:15:06,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311386063] [2024-11-20 14:15:06,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311386063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:15:06,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:15:06,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:15:06,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34046511] [2024-11-20 14:15:06,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:15:06,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:15:06,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:15:06,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:15:06,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:15:06,384 INFO L87 Difference]: Start difference. First operand 269 states and 357 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:15:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:15:06,467 INFO L93 Difference]: Finished difference Result 263 states and 347 transitions. [2024-11-20 14:15:06,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:15:06,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-20 14:15:06,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:15:06,470 INFO L225 Difference]: With dead ends: 263 [2024-11-20 14:15:06,471 INFO L226 Difference]: Without dead ends: 263 [2024-11-20 14:15:06,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:15:06,473 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:15:06,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:15:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-20 14:15:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-20 14:15:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 253 states have internal predecessors, (305), 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-20 14:15:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 347 transitions. [2024-11-20 14:15:06,485 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 347 transitions. Word has length 67 [2024-11-20 14:15:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:15:06,486 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 347 transitions. [2024-11-20 14:15:06,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:15:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 347 transitions. [2024-11-20 14:15:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 14:15:06,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:15:06,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:15:06,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 14:15:06,688 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-20 14:15:06,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:15:06,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:15:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1790830044, now seen corresponding path program 1 times [2024-11-20 14:15:06,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:15:06,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763557591] [2024-11-20 14:15:06,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:15:06,690 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-20 14:15:06,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:15:06,694 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-20 14:15:06,695 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-20 14:15:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:15:07,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 14:15:07,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:15:07,300 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-20 14:15:07,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:15:07,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:15:07,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763557591] [2024-11-20 14:15:07,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763557591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:15:07,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:15:07,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:15:07,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523709614] [2024-11-20 14:15:07,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:15:07,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:15:07,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:15:07,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:15:07,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:15:07,304 INFO L87 Difference]: Start difference. First operand 263 states and 347 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:15:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:15:08,050 INFO L93 Difference]: Finished difference Result 402 states and 518 transitions. [2024-11-20 14:15:08,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:15:08,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-20 14:15:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:15:08,054 INFO L225 Difference]: With dead ends: 402 [2024-11-20 14:15:08,054 INFO L226 Difference]: Without dead ends: 402 [2024-11-20 14:15:08,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-20 14:15:08,056 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 126 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 689 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.7s IncrementalHoareTripleChecker+Time [2024-11-20 14:15:08,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 689 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 14:15:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-20 14:15:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 369. [2024-11-20 14:15:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 341 states have (on average 1.2668621700879765) internal successors, (432), 358 states have internal predecessors, (432), 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-20 14:15:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 476 transitions. [2024-11-20 14:15:08,081 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 476 transitions. Word has length 67 [2024-11-20 14:15:08,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:15:08,082 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 476 transitions. [2024-11-20 14:15:08,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:15:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 476 transitions. [2024-11-20 14:15:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-20 14:15:08,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:15:08,088 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] [2024-11-20 14:15:08,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 14:15:08,288 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-20 14:15:08,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:15:08,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:15:08,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2007894925, now seen corresponding path program 1 times [2024-11-20 14:15:08,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:15:08,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080817426] [2024-11-20 14:15:08,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:15:08,291 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-20 14:15:08,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:15:08,294 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-20 14:15:08,295 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-20 14:15:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:15:08,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 14:15:08,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:15:08,776 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-20 14:15:08,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:15:08,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:15:08,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080817426] [2024-11-20 14:15:08,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080817426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:15:08,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:15:08,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:15:08,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772034151] [2024-11-20 14:15:08,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:15:08,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:15:08,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:15:08,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:15:08,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:15:08,780 INFO L87 Difference]: Start difference. First operand 369 states and 476 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-20 14:15:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:15:08,831 INFO L93 Difference]: Finished difference Result 372 states and 480 transitions. [2024-11-20 14:15:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:15:08,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 82 [2024-11-20 14:15:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:15:08,834 INFO L225 Difference]: With dead ends: 372 [2024-11-20 14:15:08,834 INFO L226 Difference]: Without dead ends: 372 [2024-11-20 14:15:08,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 79 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-20 14:15:08,835 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 0 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1022 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-20 14:15:08,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1022 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:15:08,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-20 14:15:08,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2024-11-20 14:15:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 343 states have (on average 1.2682215743440233) internal successors, (435), 361 states have internal predecessors, (435), 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-20 14:15:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 480 transitions. [2024-11-20 14:15:08,845 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 480 transitions. Word has length 82 [2024-11-20 14:15:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:15:08,846 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 480 transitions. [2024-11-20 14:15:08,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-20 14:15:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 480 transitions. [2024-11-20 14:15:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 14:15:08,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:15:08,851 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] [2024-11-20 14:15:08,864 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-20 14:15:09,052 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-20 14:15:09,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:15:09,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:15:09,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1850860785, now seen corresponding path program 1 times [2024-11-20 14:15:09,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:15:09,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546038321] [2024-11-20 14:15:09,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:15:09,054 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-20 14:15:09,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:15:09,055 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-20 14:15:09,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 14:15:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:15:09,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:15:09,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:15:09,507 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-20 14:15:09,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:15:09,608 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-20 14:15:09,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:15:09,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546038321] [2024-11-20 14:15:09,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546038321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:15:09,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:15:09,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 14:15:09,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929180959] [2024-11-20 14:15:09,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:15:09,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:15:09,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:15:09,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:15:09,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:15:09,611 INFO L87 Difference]: Start difference. First operand 372 states and 480 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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-20 14:15:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:15:09,802 INFO L93 Difference]: Finished difference Result 383 states and 496 transitions. [2024-11-20 14:15:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:15:09,803 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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 84 [2024-11-20 14:15:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:15:09,805 INFO L225 Difference]: With dead ends: 383 [2024-11-20 14:15:09,805 INFO L226 Difference]: Without dead ends: 383 [2024-11-20 14:15:09,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 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-20 14:15:09,805 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 5 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:15:09,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1699 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:15:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-20 14:15:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2024-11-20 14:15:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 351 states have (on average 1.2792022792022792) internal successors, (449), 369 states have internal predecessors, (449), 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-20 14:15:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 494 transitions. [2024-11-20 14:15:09,815 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 494 transitions. Word has length 84 [2024-11-20 14:15:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:15:09,815 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 494 transitions. [2024-11-20 14:15:09,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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-20 14:15:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 494 transitions. [2024-11-20 14:15:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-20 14:15:09,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:15:09,816 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] [2024-11-20 14:15:09,828 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-20 14:15:10,017 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-20 14:15:10,017 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:15:10,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:15:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash 45321043, now seen corresponding path program 2 times [2024-11-20 14:15:10,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:15:10,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66549276] [2024-11-20 14:15:10,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:15:10,019 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-20 14:15:10,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:15:10,020 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-20 14:15:10,021 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-20 14:15:11,553 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:15:11,554 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:15:11,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 14:15:11,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:15:11,674 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-20 14:15:11,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:15:11,888 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-20 14:15:11,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:15:11,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66549276] [2024-11-20 14:15:11,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66549276] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:15:11,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:15:11,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-20 14:15:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511736899] [2024-11-20 14:15:11,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:15:11,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 14:15:11,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:15:11,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 14:15:11,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:15:11,892 INFO L87 Difference]: Start difference. First operand 381 states and 494 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 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-20 14:15:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:15:12,425 INFO L93 Difference]: Finished difference Result 396 states and 516 transitions. [2024-11-20 14:15:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 14:15:12,426 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 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 88 [2024-11-20 14:15:12,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:15:12,429 INFO L225 Difference]: With dead ends: 396 [2024-11-20 14:15:12,429 INFO L226 Difference]: Without dead ends: 392 [2024-11-20 14:15:12,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 162 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-20 14:15:12,430 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 7 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:15:12,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3056 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:15:12,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-20 14:15:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2024-11-20 14:15:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 360 states have (on average 1.2805555555555554) internal successors, (461), 378 states have internal predecessors, (461), 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-20 14:15:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 506 transitions. [2024-11-20 14:15:12,448 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 506 transitions. Word has length 88 [2024-11-20 14:15:12,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:15:12,448 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 506 transitions. [2024-11-20 14:15:12,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 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-20 14:15:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 506 transitions. [2024-11-20 14:15:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 14:15:12,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:15:12,450 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] [2024-11-20 14:15:12,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-20 14:15:12,654 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-20 14:15:12,655 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:15:12,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:15:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash -335891100, now seen corresponding path program 3 times [2024-11-20 14:15:12,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:15:12,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478308175] [2024-11-20 14:15:12,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 14:15:12,656 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-20 14:15:12,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:15:12,657 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-20 14:15:12,658 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-20 14:15:14,933 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-20 14:15:14,934 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:15:14,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 14:15:14,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:15:15,112 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-20 14:15:15,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:15:15,389 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-20 14:15:15,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:15:15,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478308175] [2024-11-20 14:15:15,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478308175] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:15:15,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:15:15,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-20 14:15:15,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518567515] [2024-11-20 14:15:15,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:15:15,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 14:15:15,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:15:15,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 14:15:15,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-20 14:15:15,391 INFO L87 Difference]: Start difference. First operand 390 states and 506 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 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-20 14:15:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:15:15,976 INFO L93 Difference]: Finished difference Result 401 states and 523 transitions. [2024-11-20 14:15:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 14:15:15,977 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 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 97 [2024-11-20 14:15:15,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:15:15,980 INFO L225 Difference]: With dead ends: 401 [2024-11-20 14:15:15,981 INFO L226 Difference]: Without dead ends: 399 [2024-11-20 14:15:15,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 178 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-20 14:15:15,983 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 8 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:15:15,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2722 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:15:15,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-20 14:15:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2024-11-20 14:15:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 367 states have (on average 1.2915531335149864) internal successors, (474), 385 states have internal predecessors, (474), 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-20 14:15:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 519 transitions. [2024-11-20 14:15:15,992 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 519 transitions. Word has length 97 [2024-11-20 14:15:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:15:15,993 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 519 transitions. [2024-11-20 14:15:15,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 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-20 14:15:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 519 transitions. [2024-11-20 14:15:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-20 14:15:15,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:15:15,994 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] [2024-11-20 14:15:16,013 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-20 14:15:16,198 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-20 14:15:16,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:15:16,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:15:16,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1746149101, now seen corresponding path program 4 times [2024-11-20 14:15:16,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:15:16,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776444054] [2024-11-20 14:15:16,200 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 14:15:16,200 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-20 14:15:16,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:15:16,203 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-20 14:15:16,204 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-20 14:15:16,828 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 14:15:16,829 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:15:16,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 14:15:16,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:15:17,011 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-20 14:15:17,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:15:17,555 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-20 14:15:17,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:15:17,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776444054] [2024-11-20 14:15:17,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776444054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:15:17,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:15:17,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-20 14:15:17,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919165873] [2024-11-20 14:15:17,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:15:17,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 14:15:17,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:15:17,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 14:15:17,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-20 14:15:17,559 INFO L87 Difference]: Start difference. First operand 397 states and 519 transitions. Second operand has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 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-20 14:15:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:15:19,132 INFO L93 Difference]: Finished difference Result 415 states and 547 transitions. [2024-11-20 14:15:19,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-20 14:15:19,133 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 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 104 [2024-11-20 14:15:19,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:15:19,143 INFO L225 Difference]: With dead ends: 415 [2024-11-20 14:15:19,143 INFO L226 Difference]: Without dead ends: 411 [2024-11-20 14:15:19,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-20 14:15:19,144 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 13 mSDsluCounter, 5091 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5433 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 14:15:19,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5433 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 14:15:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-20 14:15:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2024-11-20 14:15:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 379 states have (on average 1.2823218997361479) internal successors, (486), 397 states have internal predecessors, (486), 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-20 14:15:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 531 transitions. [2024-11-20 14:15:19,156 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 531 transitions. Word has length 104 [2024-11-20 14:15:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:15:19,156 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 531 transitions. [2024-11-20 14:15:19,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 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-20 14:15:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 531 transitions. [2024-11-20 14:15:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 14:15:19,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:15:19,158 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] [2024-11-20 14:15:19,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-20 14:15:19,358 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-20 14:15:19,359 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:15:19,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:15:19,359 INFO L85 PathProgramCache]: Analyzing trace with hash 836730707, now seen corresponding path program 5 times [2024-11-20 14:15:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:15:19,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726546280] [2024-11-20 14:15:19,360 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 14:15:19,360 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-20 14:15:19,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:15:19,363 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-20 14:15:19,364 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-20 14:15:20,384 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2024-11-20 14:15:20,384 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:15:20,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 14:15:20,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:15:20,881 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-20 14:15:20,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:15:22,288 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-20 14:15:22,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:15:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726546280] [2024-11-20 14:15:22,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726546280] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:15:22,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:15:22,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-20 14:15:22,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362553073] [2024-11-20 14:15:22,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:15:22,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-20 14:15:22,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:15:22,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-20 14:15:22,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-20 14:15:22,292 INFO L87 Difference]: Start difference. First operand 409 states and 531 transitions. Second operand has 50 states, 50 states have (on average 2.54) internal successors, (127), 50 states have internal predecessors, (127), 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-20 14:15:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:15:27,394 INFO L93 Difference]: Finished difference Result 448 states and 601 transitions. [2024-11-20 14:15:27,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-20 14:15:27,395 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.54) internal successors, (127), 50 states have internal predecessors, (127), 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 116 [2024-11-20 14:15:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:15:27,397 INFO L225 Difference]: With dead ends: 448 [2024-11-20 14:15:27,397 INFO L226 Difference]: Without dead ends: 444 [2024-11-20 14:15:27,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-20 14:15:27,400 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 25 mSDsluCounter, 8497 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8839 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:15:27,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8839 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1899 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 14:15:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-20 14:15:27,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 442. [2024-11-20 14:15:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 412 states have (on average 1.2864077669902914) internal successors, (530), 430 states have internal predecessors, (530), 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-20 14:15:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 575 transitions. [2024-11-20 14:15:27,410 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 575 transitions. Word has length 116 [2024-11-20 14:15:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:15:27,411 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 575 transitions. [2024-11-20 14:15:27,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.54) internal successors, (127), 50 states have internal predecessors, (127), 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-20 14:15:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 575 transitions. [2024-11-20 14:15:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-20 14:15:27,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:15:27,413 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] [2024-11-20 14:15:27,429 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-20 14:15:27,613 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-20 14:15:27,613 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:15:27,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:15:27,614 INFO L85 PathProgramCache]: Analyzing trace with hash 791926244, now seen corresponding path program 6 times [2024-11-20 14:15:27,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:15:27,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165329621] [2024-11-20 14:15:27,614 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-20 14:15:27,615 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-20 14:15:27,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:15:27,616 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-20 14:15:27,617 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-20 14:15:34,698 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2024-11-20 14:15:34,698 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:15:34,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 14:15:34,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:15:35,205 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-20 14:15:35,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:15:36,994 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-20 14:15:36,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:15:36,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165329621] [2024-11-20 14:15:36,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165329621] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:15:36,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:15:36,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-20 14:15:36,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715501753] [2024-11-20 14:15:36,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:15:36,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-20 14:15:36,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:15:36,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-20 14:15:36,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-20 14:15:36,997 INFO L87 Difference]: Start difference. First operand 442 states and 575 transitions. Second operand has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 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-20 14:15:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:15:43,188 INFO L93 Difference]: Finished difference Result 471 states and 628 transitions. [2024-11-20 14:15:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-20 14:15:43,189 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 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 149 [2024-11-20 14:15:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:15:43,192 INFO L225 Difference]: With dead ends: 471 [2024-11-20 14:15:43,192 INFO L226 Difference]: Without dead ends: 469 [2024-11-20 14:15:43,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-20 14:15:43,195 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 27 mSDsluCounter, 8162 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8504 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 14:15:43,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 8504 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 14:15:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-20 14:15:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 467. [2024-11-20 14:15:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 437 states have (on average 1.3249427917620138) internal successors, (579), 455 states have internal predecessors, (579), 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-20 14:15:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 624 transitions. [2024-11-20 14:15:43,205 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 624 transitions. Word has length 149 [2024-11-20 14:15:43,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:15:43,206 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 624 transitions. [2024-11-20 14:15:43,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 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-20 14:15:43,206 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 624 transitions. [2024-11-20 14:15:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-20 14:15:43,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:15:43,215 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] [2024-11-20 14:15:43,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-20 14:15:43,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:15:43,416 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:15:43,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:15:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash 428899251, now seen corresponding path program 7 times [2024-11-20 14:15:43,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:15:43,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611730033] [2024-11-20 14:15:43,418 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-20 14:15:43,419 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-20 14:15:43,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:15:43,422 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:15:43,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-20 14:15:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:15:44,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-20 14:15:44,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:15:46,446 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-20 14:15:46,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:15:51,927 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-20 14:15:51,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:15:51,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611730033] [2024-11-20 14:15:51,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611730033] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:15:51,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:15:51,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-20 14:15:51,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181312704] [2024-11-20 14:15:51,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:15:51,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-20 14:15:51,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:15:51,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-20 14:15:51,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-20 14:15:51,931 INFO L87 Difference]: Start difference. First operand 467 states and 624 transitions. Second operand has 102 states, 102 states have (on average 1.7156862745098038) internal successors, (175), 102 states have internal predecessors, (175), 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)