./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 61a67961 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_BER_test9-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 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:25:08,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:25:08,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-14 17:25:08,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:25:08,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:25:08,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:25:08,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:25:08,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:25:08,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:25:08,310 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:25:08,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:25:08,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:25:08,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:25:08,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:25:08,312 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:25:08,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:25:08,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:25:08,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:25:08,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:25:08,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:25:08,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:25:08,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:25:08,316 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:25:08,317 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:25:08,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:25:08,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:25:08,317 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:25:08,317 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:25:08,318 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:25:08,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:25:08,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:25:08,318 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:25:08,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:25:08,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:25:08,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:25:08,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:25:08,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:25:08,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:25:08,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:25:08,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:25:08,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:25:08,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:25:08,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:25:08,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:25:08,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:25:08,324 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2024-10-14 17:25:08,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:25:08,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:25:08,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:25:08,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:25:08,619 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:25:08,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-10-14 17:25:10,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:25:10,457 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:25:10,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-10-14 17:25:10,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0321a19e/c79496346b00495bab2c6ce4d315827e/FLAG394ee0188 [2024-10-14 17:25:10,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0321a19e/c79496346b00495bab2c6ce4d315827e [2024-10-14 17:25:10,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:25:10,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:25:10,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:25:10,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:25:10,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:25:10,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:25:10" (1/1) ... [2024-10-14 17:25:10,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1660d4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:10, skipping insertion in model container [2024-10-14 17:25:10,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:25:10" (1/1) ... [2024-10-14 17:25:10,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:25:11,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:25:11,319 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 17:25:11,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4009b2cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:11, skipping insertion in model container [2024-10-14 17:25:11,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:25:11,320 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:25:11,323 INFO L158 Benchmark]: Toolchain (without parser) took 815.04ms. Allocated memory is still 161.5MB. Free memory was 100.5MB in the beginning and 122.7MB in the end (delta: -22.2MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-10-14 17:25:11,323 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 161.5MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:25:11,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 813.01ms. Allocated memory is still 161.5MB. Free memory was 100.5MB in the beginning and 122.7MB in the end (delta: -22.2MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-10-14 17:25:11,325 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.53ms. Allocated memory is still 161.5MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 813.01ms. Allocated memory is still 161.5MB. Free memory was 100.5MB in the beginning and 122.7MB in the end (delta: -22.2MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: 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_BER_test9-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 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:25:13,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:25:13,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-14 17:25:13,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:25:13,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:25:13,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:25:13,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:25:13,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:25:13,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:25:13,445 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:25:13,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:25:13,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:25:13,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:25:13,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:25:13,451 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:25:13,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:25:13,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:25:13,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:25:13,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:25:13,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:25:13,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:25:13,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:25:13,458 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:25:13,458 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:25:13,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:25:13,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:25:13,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:25:13,459 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:25:13,459 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:25:13,459 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:25:13,459 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:25:13,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:25:13,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:25:13,460 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:25:13,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:25:13,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:25:13,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:25:13,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:25:13,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:25:13,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:25:13,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:25:13,463 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:25:13,464 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:25:13,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:25:13,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:25:13,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:25:13,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:25:13,465 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:25:13,465 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2024-10-14 17:25:13,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:25:13,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:25:13,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:25:13,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:25:13,799 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:25:13,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-10-14 17:25:15,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:25:15,689 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:25:15,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-10-14 17:25:15,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cbc93f66/38f7fe5e420245b791de3061d9296710/FLAGac4b40e2e [2024-10-14 17:25:15,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cbc93f66/38f7fe5e420245b791de3061d9296710 [2024-10-14 17:25:15,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:25:15,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:25:15,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:25:15,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:25:15,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:25:15,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:25:15" (1/1) ... [2024-10-14 17:25:15,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76eef572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:15, skipping insertion in model container [2024-10-14 17:25:15,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:25:15" (1/1) ... [2024-10-14 17:25:15,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:25:16,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:25:16,485 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:25:16,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:25:16,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:25:16,667 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:25:16,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:25:16,862 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:25:16,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16 WrapperNode [2024-10-14 17:25:16,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:25:16,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:25:16,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:25:16,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:25:16,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16" (1/1) ... [2024-10-14 17:25:16,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16" (1/1) ... [2024-10-14 17:25:17,036 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3043 [2024-10-14 17:25:17,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:25:17,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:25:17,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:25:17,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:25:17,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16" (1/1) ... [2024-10-14 17:25:17,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16" (1/1) ... [2024-10-14 17:25:17,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16" (1/1) ... [2024-10-14 17:25:17,187 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-14 17:25:17,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16" (1/1) ... [2024-10-14 17:25:17,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16" (1/1) ... [2024-10-14 17:25:17,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16" (1/1) ... [2024-10-14 17:25:17,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16" (1/1) ... [2024-10-14 17:25:17,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16" (1/1) ... [2024-10-14 17:25:17,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16" (1/1) ... [2024-10-14 17:25:17,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:25:17,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:25:17,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:25:17,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:25:17,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16" (1/1) ... [2024-10-14 17:25:17,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:25:17,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:25:17,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:25:17,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:25:17,430 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 17:25:17,431 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 17:25:17,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 17:25:17,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 17:25:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 17:25:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:25:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 17:25:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 17:25:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 17:25:17,433 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 17:25:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 17:25:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 17:25:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 17:25:17,433 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 17:25:17,433 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 17:25:17,433 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 17:25:17,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:25:17,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:25:17,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:25:17,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:25:17,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:25:17,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:25:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:25:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:25:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:25:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:25:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:25:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 17:25:17,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 17:25:17,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:25:17,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:25:17,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 17:25:17,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:25:17,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:25:17,695 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:25:17,697 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:25:27,077 INFO L? ?]: Removed 638 outVars from TransFormulas that were not future-live. [2024-10-14 17:25:27,077 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:25:27,129 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:25:27,130 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-14 17:25:27,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:25:27 BoogieIcfgContainer [2024-10-14 17:25:27,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:25:27,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:25:27,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:25:27,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:25:27,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:25:15" (1/3) ... [2024-10-14 17:25:27,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4a1bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:25:27, skipping insertion in model container [2024-10-14 17:25:27,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:16" (2/3) ... [2024-10-14 17:25:27,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4a1bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:25:27, skipping insertion in model container [2024-10-14 17:25:27,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:25:27" (3/3) ... [2024-10-14 17:25:27,138 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-2.i [2024-10-14 17:25:27,154 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:25:27,155 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 17:25:27,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:25:27,228 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;@2cc96a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:25:27,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 17:25:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 1202 states, 691 states have (on average 1.9088277858176557) internal successors, (1319), 1195 states have internal predecessors, (1319), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-10-14 17:25:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:25:27,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:27,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:27,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:27,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:27,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1977665458, now seen corresponding path program 1 times [2024-10-14 17:25:27,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:27,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508716206] [2024-10-14 17:25:27,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:27,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:27,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:27,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:27,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 17:25:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:27,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 17:25:27,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:25:27,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:27,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:27,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508716206] [2024-10-14 17:25:27,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508716206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:27,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:27,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:25:27,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283994363] [2024-10-14 17:25:27,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:27,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 17:25:27,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:27,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 17:25:27,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:25:27,497 INFO L87 Difference]: Start difference. First operand has 1202 states, 691 states have (on average 1.9088277858176557) internal successors, (1319), 1195 states have internal predecessors, (1319), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:27,634 INFO L93 Difference]: Finished difference Result 1200 states and 2257 transitions. [2024-10-14 17:25:27,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 17:25:27,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2024-10-14 17:25:27,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:27,686 INFO L225 Difference]: With dead ends: 1200 [2024-10-14 17:25:27,687 INFO L226 Difference]: Without dead ends: 1199 [2024-10-14 17:25:27,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:25:27,693 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:27,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2252 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:25:27,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2024-10-14 17:25:28,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2024-10-14 17:25:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 690 states have (on average 1.808695652173913) internal successors, (1248), 1192 states have internal predecessors, (1248), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-14 17:25:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 2256 transitions. [2024-10-14 17:25:28,089 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 2256 transitions. Word has length 10 [2024-10-14 17:25:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:28,091 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 2256 transitions. [2024-10-14 17:25:28,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 2256 transitions. [2024-10-14 17:25:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 17:25:28,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:28,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:28,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 (2)] Ended with exit code 0 [2024-10-14 17:25:28,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:28,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:28,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash 595513586, now seen corresponding path program 1 times [2024-10-14 17:25:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:28,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309123132] [2024-10-14 17:25:28,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:28,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:28,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:28,297 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:28,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 17:25:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:28,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:25:28,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:25:28,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:28,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:28,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309123132] [2024-10-14 17:25:28,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309123132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:28,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:28,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:25:28,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780943928] [2024-10-14 17:25:28,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:28,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:25:28,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:28,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:25:28,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:25:28,530 INFO L87 Difference]: Start difference. First operand 1199 states and 2256 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:29,262 INFO L93 Difference]: Finished difference Result 2319 states and 4412 transitions. [2024-10-14 17:25:29,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:25:29,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2024-10-14 17:25:29,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:29,282 INFO L225 Difference]: With dead ends: 2319 [2024-10-14 17:25:29,283 INFO L226 Difference]: Without dead ends: 2319 [2024-10-14 17:25:29,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:25:29,284 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 1146 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 4467 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:29,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 4467 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 17:25:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2024-10-14 17:25:29,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2288. [2024-10-14 17:25:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2288 states, 1279 states have (on average 1.8483189992181392) internal successors, (2364), 2281 states have internal predecessors, (2364), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-14 17:25:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 4372 transitions. [2024-10-14 17:25:29,631 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 4372 transitions. Word has length 12 [2024-10-14 17:25:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:29,631 INFO L471 AbstractCegarLoop]: Abstraction has 2288 states and 4372 transitions. [2024-10-14 17:25:29,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 4372 transitions. [2024-10-14 17:25:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 17:25:29,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:29,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:29,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 17:25:29,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:29,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:29,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:29,839 INFO L85 PathProgramCache]: Analyzing trace with hash 597360628, now seen corresponding path program 1 times [2024-10-14 17:25:29,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:29,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693279778] [2024-10-14 17:25:29,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:29,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:29,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:29,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:29,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 17:25:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:30,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:25:30,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:30,065 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:25:30,068 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:25:30,069 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:25:30,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-14 17:25:30,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:25:30,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-14 17:25:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:25:30,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:30,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:30,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693279778] [2024-10-14 17:25:30,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693279778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:30,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:30,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:25:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279441286] [2024-10-14 17:25:30,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:30,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:25:30,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:30,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:25:30,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:25:30,213 INFO L87 Difference]: Start difference. First operand 2288 states and 4372 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:33,477 INFO L93 Difference]: Finished difference Result 4434 states and 8563 transitions. [2024-10-14 17:25:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:25:33,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-10-14 17:25:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:33,506 INFO L225 Difference]: With dead ends: 4434 [2024-10-14 17:25:33,506 INFO L226 Difference]: Without dead ends: 4434 [2024-10-14 17:25:33,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:25:33,509 INFO L432 NwaCegarLoop]: 2467 mSDtfsCounter, 1229 mSDsluCounter, 4194 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 6661 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:33,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 6661 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 17:25:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4434 states. [2024-10-14 17:25:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4434 to 2287. [2024-10-14 17:25:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 1278 states have (on average 1.8482003129890454) internal successors, (2362), 2280 states have internal predecessors, (2362), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-14 17:25:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 4370 transitions. [2024-10-14 17:25:34,062 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 4370 transitions. Word has length 12 [2024-10-14 17:25:34,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:34,063 INFO L471 AbstractCegarLoop]: Abstraction has 2287 states and 4370 transitions. [2024-10-14 17:25:34,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 4370 transitions. [2024-10-14 17:25:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 17:25:34,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:34,067 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:34,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 17:25:34,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:34,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:34,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:34,270 INFO L85 PathProgramCache]: Analyzing trace with hash -833134923, now seen corresponding path program 1 times [2024-10-14 17:25:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:34,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172044107] [2024-10-14 17:25:34,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:34,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:34,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:34,275 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:34,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 17:25:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:34,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:25:34,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:25:34,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:34,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:34,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172044107] [2024-10-14 17:25:34,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172044107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:34,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:34,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:25:34,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690754788] [2024-10-14 17:25:34,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:34,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:25:34,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:34,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:25:34,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:25:34,743 INFO L87 Difference]: Start difference. First operand 2287 states and 4370 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:25:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:34,982 INFO L93 Difference]: Finished difference Result 2293 states and 4360 transitions. [2024-10-14 17:25:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:25:34,983 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-10-14 17:25:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:34,996 INFO L225 Difference]: With dead ends: 2293 [2024-10-14 17:25:34,997 INFO L226 Difference]: Without dead ends: 2293 [2024-10-14 17:25:34,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:25:34,999 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 30 mSDsluCounter, 4427 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6649 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:35,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6649 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:25:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2024-10-14 17:25:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2293. [2024-10-14 17:25:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 1284 states have (on average 1.8317757009345794) internal successors, (2352), 2286 states have internal predecessors, (2352), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-14 17:25:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 4360 transitions. [2024-10-14 17:25:35,296 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 4360 transitions. Word has length 81 [2024-10-14 17:25:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:35,296 INFO L471 AbstractCegarLoop]: Abstraction has 2293 states and 4360 transitions. [2024-10-14 17:25:35,296 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:25:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 4360 transitions. [2024-10-14 17:25:35,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 17:25:35,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:35,299 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:35,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 17:25:35,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:35,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:35,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:35,504 INFO L85 PathProgramCache]: Analyzing trace with hash -757174847, now seen corresponding path program 1 times [2024-10-14 17:25:35,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:35,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721880303] [2024-10-14 17:25:35,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:35,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:35,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:35,509 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:35,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 17:25:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:36,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:25:36,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:25:36,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:36,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:36,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721880303] [2024-10-14 17:25:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721880303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:36,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:36,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:25:36,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617916343] [2024-10-14 17:25:36,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:36,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:25:36,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:36,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:25:36,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:25:36,077 INFO L87 Difference]: Start difference. First operand 2293 states and 4360 transitions. Second operand has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:25:36,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:36,211 INFO L93 Difference]: Finished difference Result 2295 states and 4363 transitions. [2024-10-14 17:25:36,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:25:36,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2024-10-14 17:25:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:36,227 INFO L225 Difference]: With dead ends: 2295 [2024-10-14 17:25:36,228 INFO L226 Difference]: Without dead ends: 2295 [2024-10-14 17:25:36,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:25:36,229 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 0 mSDsluCounter, 4474 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6713 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:36,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6713 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:25:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2024-10-14 17:25:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2295. [2024-10-14 17:25:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 1285 states have (on average 1.8319066147859921) internal successors, (2354), 2288 states have internal predecessors, (2354), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-14 17:25:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 4363 transitions. [2024-10-14 17:25:36,598 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 4363 transitions. Word has length 81 [2024-10-14 17:25:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:36,599 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 4363 transitions. [2024-10-14 17:25:36,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:25:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 4363 transitions. [2024-10-14 17:25:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 17:25:36,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:36,601 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] [2024-10-14 17:25:36,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 17:25:36,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:36,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:36,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:36,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1719600183, now seen corresponding path program 1 times [2024-10-14 17:25:36,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:36,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943347804] [2024-10-14 17:25:36,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:36,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:36,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:36,807 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:36,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 17:25:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:37,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:25:37,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:25:37,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:25:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:25:37,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943347804] [2024-10-14 17:25:37,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943347804] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:25:37,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:25:37,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 17:25:37,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605936133] [2024-10-14 17:25:37,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:25:37,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:25:37,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:37,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:25:37,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:25:37,512 INFO L87 Difference]: Start difference. First operand 2295 states and 4363 transitions. Second operand has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:25:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:37,780 INFO L93 Difference]: Finished difference Result 2304 states and 4377 transitions. [2024-10-14 17:25:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:25:37,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 83 [2024-10-14 17:25:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:37,795 INFO L225 Difference]: With dead ends: 2304 [2024-10-14 17:25:37,796 INFO L226 Difference]: Without dead ends: 2304 [2024-10-14 17:25:37,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:25:37,797 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 4 mSDsluCounter, 4474 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6713 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:37,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 6713 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:25:37,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2024-10-14 17:25:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2303. [2024-10-14 17:25:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 1292 states have (on average 1.8320433436532508) internal successors, (2367), 2295 states have internal predecessors, (2367), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-14 17:25:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 4376 transitions. [2024-10-14 17:25:38,087 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 4376 transitions. Word has length 83 [2024-10-14 17:25:38,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:38,087 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 4376 transitions. [2024-10-14 17:25:38,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:25:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 4376 transitions. [2024-10-14 17:25:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 17:25:38,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:38,089 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] [2024-10-14 17:25:38,100 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-10-14 17:25:38,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:38,294 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:38,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:38,294 INFO L85 PathProgramCache]: Analyzing trace with hash -597927647, now seen corresponding path program 2 times [2024-10-14 17:25:38,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:38,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923750583] [2024-10-14 17:25:38,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:25:38,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:38,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:38,297 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:38,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 17:25:38,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:25:38,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:25:38,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:25:38,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-14 17:25:38,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:38,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:38,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923750583] [2024-10-14 17:25:38,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923750583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:38,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:38,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:25:38,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522488134] [2024-10-14 17:25:38,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:38,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:25:38,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:38,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:25:38,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:25:38,664 INFO L87 Difference]: Start difference. First operand 2303 states and 4376 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:25:43,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:25:47,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:25:49,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:25:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:54,169 INFO L93 Difference]: Finished difference Result 3435 states and 6550 transitions. [2024-10-14 17:25:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:25:54,170 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-10-14 17:25:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:54,188 INFO L225 Difference]: With dead ends: 3435 [2024-10-14 17:25:54,188 INFO L226 Difference]: Without dead ends: 3435 [2024-10-14 17:25:54,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:25:54,189 INFO L432 NwaCegarLoop]: 2310 mSDtfsCounter, 3542 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 895 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4045 SdHoareTripleChecker+Valid, 4516 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 895 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:54,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4045 Valid, 4516 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [895 Valid, 618 Invalid, 2 Unknown, 0 Unchecked, 15.4s Time] [2024-10-14 17:25:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2024-10-14 17:25:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3410. [2024-10-14 17:25:54,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 1898 states have (on average 1.8461538461538463) internal successors, (3504), 3401 states have internal predecessors, (3504), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-14 17:25:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 6516 transitions. [2024-10-14 17:25:54,596 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 6516 transitions. Word has length 87 [2024-10-14 17:25:54,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:54,596 INFO L471 AbstractCegarLoop]: Abstraction has 3410 states and 6516 transitions. [2024-10-14 17:25:54,596 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:25:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 6516 transitions. [2024-10-14 17:25:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 17:25:54,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:54,600 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:54,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 17:25:54,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:54,801 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:54,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:54,802 INFO L85 PathProgramCache]: Analyzing trace with hash -587869840, now seen corresponding path program 1 times [2024-10-14 17:25:54,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:54,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475920903] [2024-10-14 17:25:54,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:54,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:54,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:54,809 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:54,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 17:25:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:55,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 17:25:55,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:25:55,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:25:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 17:25:55,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475920903] [2024-10-14 17:25:55,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475920903] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:25:55,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:25:55,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 17:25:55,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337442210] [2024-10-14 17:25:55,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:25:55,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:25:55,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:55,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:25:55,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:25:55,609 INFO L87 Difference]: Start difference. First operand 3410 states and 6516 transitions. Second operand has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:25:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:56,203 INFO L93 Difference]: Finished difference Result 3422 states and 6536 transitions. [2024-10-14 17:25:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 17:25:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2024-10-14 17:25:56,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:56,224 INFO L225 Difference]: With dead ends: 3422 [2024-10-14 17:25:56,225 INFO L226 Difference]: Without dead ends: 3420 [2024-10-14 17:25:56,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 17:25:56,229 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 7 mSDsluCounter, 15651 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 17890 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:56,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 17890 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:25:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states. [2024-10-14 17:25:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 3419. [2024-10-14 17:25:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 1907 states have (on average 1.8437336130047195) internal successors, (3516), 3410 states have internal predecessors, (3516), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-14 17:25:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 6528 transitions. [2024-10-14 17:25:56,677 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 6528 transitions. Word has length 96 [2024-10-14 17:25:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:56,678 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 6528 transitions. [2024-10-14 17:25:56,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:25:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 6528 transitions. [2024-10-14 17:25:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 17:25:56,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:56,680 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:56,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 17:25:56,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:56,881 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:56,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:56,882 INFO L85 PathProgramCache]: Analyzing trace with hash 902003159, now seen corresponding path program 2 times [2024-10-14 17:25:56,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:56,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071647816] [2024-10-14 17:25:56,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:25:56,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:56,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:56,884 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:56,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 17:25:57,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:25:57,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:25:57,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:25:57,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:57,270 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:25:57,271 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:25:57,271 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:25:57,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-14 17:25:57,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:25:57,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-14 17:25:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-14 17:25:57,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:57,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:57,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071647816] [2024-10-14 17:25:57,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071647816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:57,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:57,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:25:57,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225111021] [2024-10-14 17:25:57,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:57,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:25:57,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:57,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:25:57,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:25:57,355 INFO L87 Difference]: Start difference. First operand 3419 states and 6528 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:25:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:59,131 INFO L93 Difference]: Finished difference Result 6597 states and 12760 transitions. [2024-10-14 17:25:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:25:59,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2024-10-14 17:25:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:59,168 INFO L225 Difference]: With dead ends: 6597 [2024-10-14 17:25:59,168 INFO L226 Difference]: Without dead ends: 6597 [2024-10-14 17:25:59,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:25:59,169 INFO L432 NwaCegarLoop]: 2671 mSDtfsCounter, 1176 mSDsluCounter, 4387 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 7058 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:59,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 7058 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 17:25:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6597 states. [2024-10-14 17:25:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6597 to 3423. [2024-10-14 17:25:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 1911 states have (on average 1.8419675562532705) internal successors, (3520), 3414 states have internal predecessors, (3520), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-14 17:25:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 6532 transitions. [2024-10-14 17:25:59,808 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 6532 transitions. Word has length 105 [2024-10-14 17:25:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:59,808 INFO L471 AbstractCegarLoop]: Abstraction has 3423 states and 6532 transitions. [2024-10-14 17:25:59,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:25:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 6532 transitions. [2024-10-14 17:25:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 17:25:59,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:59,811 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:59,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 17:26:00,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:00,012 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:26:00,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:26:00,013 INFO L85 PathProgramCache]: Analyzing trace with hash 953298136, now seen corresponding path program 1 times [2024-10-14 17:26:00,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:26:00,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331499742] [2024-10-14 17:26:00,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:26:00,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:00,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:26:00,015 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:26:00,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 17:26:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:26:00,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 17:26:00,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:26:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 17:26:00,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:26:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 17:26:01,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:26:01,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331499742] [2024-10-14 17:26:01,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331499742] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:26:01,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:26:01,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 17:26:01,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118940282] [2024-10-14 17:26:01,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:26:01,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 17:26:01,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:26:01,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 17:26:01,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 17:26:01,488 INFO L87 Difference]: Start difference. First operand 3423 states and 6532 transitions. Second operand has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:26:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:26:03,924 INFO L93 Difference]: Finished difference Result 3444 states and 6570 transitions. [2024-10-14 17:26:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 17:26:03,925 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 139 [2024-10-14 17:26:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:26:03,936 INFO L225 Difference]: With dead ends: 3444 [2024-10-14 17:26:03,937 INFO L226 Difference]: Without dead ends: 3442 [2024-10-14 17:26:03,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 17:26:03,938 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 13 mSDsluCounter, 26834 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29073 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:26:03,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 29073 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 17:26:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2024-10-14 17:26:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3441. [2024-10-14 17:26:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3441 states, 1929 states have (on average 1.8372213582166925) internal successors, (3544), 3432 states have internal predecessors, (3544), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-14 17:26:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 6556 transitions. [2024-10-14 17:26:04,371 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 6556 transitions. Word has length 139 [2024-10-14 17:26:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:26:04,371 INFO L471 AbstractCegarLoop]: Abstraction has 3441 states and 6556 transitions. [2024-10-14 17:26:04,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:26:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 6556 transitions. [2024-10-14 17:26:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-14 17:26:04,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:26:04,374 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:26:04,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 17:26:04,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:04,575 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:26:04,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:26:04,576 INFO L85 PathProgramCache]: Analyzing trace with hash 64827128, now seen corresponding path program 2 times [2024-10-14 17:26:04,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:26:04,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690550290] [2024-10-14 17:26:04,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:26:04,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:04,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:26:04,578 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:26:04,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 17:26:04,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:26:04,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:26:04,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:26:04,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:26:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2024-10-14 17:26:04,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:26:04,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:26:04,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690550290] [2024-10-14 17:26:04,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690550290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:26:04,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:26:04,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:26:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004154650] [2024-10-14 17:26:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:26:04,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:26:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:26:04,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:26:04,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:26:04,990 INFO L87 Difference]: Start difference. First operand 3441 states and 6556 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:26:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:26:05,156 INFO L93 Difference]: Finished difference Result 3501 states and 6616 transitions. [2024-10-14 17:26:05,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:26:05,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-10-14 17:26:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:26:05,169 INFO L225 Difference]: With dead ends: 3501 [2024-10-14 17:26:05,169 INFO L226 Difference]: Without dead ends: 3501 [2024-10-14 17:26:05,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:26:05,170 INFO L432 NwaCegarLoop]: 2221 mSDtfsCounter, 7 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:26:05,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4428 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:26:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2024-10-14 17:26:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3501. [2024-10-14 17:26:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 1989 states have (on average 1.811965811965812) internal successors, (3604), 3492 states have internal predecessors, (3604), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-14 17:26:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 6616 transitions. [2024-10-14 17:26:05,664 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 6616 transitions. Word has length 157 [2024-10-14 17:26:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:26:05,665 INFO L471 AbstractCegarLoop]: Abstraction has 3501 states and 6616 transitions. [2024-10-14 17:26:05,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:26:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 6616 transitions. [2024-10-14 17:26:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-14 17:26:05,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:26:05,668 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:26:05,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 17:26:05,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:05,868 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:26:05,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:26:05,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1228199932, now seen corresponding path program 1 times [2024-10-14 17:26:05,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:26:05,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585633521] [2024-10-14 17:26:05,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:26:05,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:05,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:26:05,873 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:26:05,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 17:26:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:26:06,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:26:06,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:26:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-14 17:26:07,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:26:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-14 17:26:09,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:26:09,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585633521] [2024-10-14 17:26:09,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585633521] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:26:09,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:26:09,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 17:26:09,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854830006] [2024-10-14 17:26:09,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:26:09,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 17:26:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:26:09,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 17:26:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 17:26:09,129 INFO L87 Difference]: Start difference. First operand 3501 states and 6616 transitions. Second operand has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:26:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:26:15,142 INFO L93 Difference]: Finished difference Result 3538 states and 6686 transitions. [2024-10-14 17:26:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 17:26:15,143 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 157 [2024-10-14 17:26:15,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:26:15,151 INFO L225 Difference]: With dead ends: 3538 [2024-10-14 17:26:15,151 INFO L226 Difference]: Without dead ends: 3536 [2024-10-14 17:26:15,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 17:26:15,154 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 26 mSDsluCounter, 53666 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 55905 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:26:15,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 55905 Invalid, 2067 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 17:26:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2024-10-14 17:26:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3535. [2024-10-14 17:26:15,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3535 states, 2023 states have (on average 1.8042511122095897) internal successors, (3650), 3526 states have internal predecessors, (3650), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-14 17:26:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 6662 transitions. [2024-10-14 17:26:15,546 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 6662 transitions. Word has length 157 [2024-10-14 17:26:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:26:15,547 INFO L471 AbstractCegarLoop]: Abstraction has 3535 states and 6662 transitions. [2024-10-14 17:26:15,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:26:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 6662 transitions. [2024-10-14 17:26:15,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-14 17:26:15,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:26:15,550 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:26:15,567 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-10-14 17:26:15,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:15,751 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:26:15,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:26:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash -282084836, now seen corresponding path program 2 times [2024-10-14 17:26:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:26:15,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031845616] [2024-10-14 17:26:15,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:26:15,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:15,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:26:15,753 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:26:15,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 17:26:16,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:26:16,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:26:16,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:26:16,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:26:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2350 trivial. 0 not checked. [2024-10-14 17:26:16,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:26:16,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:26:16,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031845616] [2024-10-14 17:26:16,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031845616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:26:16,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:26:16,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:26:16,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144473832] [2024-10-14 17:26:16,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:26:16,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:26:16,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:26:16,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:26:16,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:26:16,199 INFO L87 Difference]: Start difference. First operand 3535 states and 6662 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:26:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:26:16,346 INFO L93 Difference]: Finished difference Result 3484 states and 6578 transitions. [2024-10-14 17:26:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:26:16,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 191 [2024-10-14 17:26:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:26:16,354 INFO L225 Difference]: With dead ends: 3484 [2024-10-14 17:26:16,354 INFO L226 Difference]: Without dead ends: 3484 [2024-10-14 17:26:16,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:26:16,355 INFO L432 NwaCegarLoop]: 2208 mSDtfsCounter, 32 mSDsluCounter, 4404 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6612 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:26:16,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6612 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:26:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3484 states. [2024-10-14 17:26:16,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 3484. [2024-10-14 17:26:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 1972 states have (on average 1.808316430020284) internal successors, (3566), 3475 states have internal predecessors, (3566), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-14 17:26:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 6578 transitions. [2024-10-14 17:26:16,701 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 6578 transitions. Word has length 191 [2024-10-14 17:26:16,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:26:16,701 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 6578 transitions. [2024-10-14 17:26:16,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:26:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 6578 transitions. [2024-10-14 17:26:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-14 17:26:16,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:26:16,703 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:26:16,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-14 17:26:16,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:16,904 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:26:16,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:26:16,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1741851342, now seen corresponding path program 1 times [2024-10-14 17:26:16,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:26:16,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648778793] [2024-10-14 17:26:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:26:16,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:16,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:26:16,907 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:26:16,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 17:26:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:26:17,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 17:26:17,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:26:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:26:18,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:26:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:26:19,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:26:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648778793] [2024-10-14 17:26:19,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648778793] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:26:19,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:26:19,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-14 17:26:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514297029] [2024-10-14 17:26:19,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:26:19,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 17:26:19,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:26:19,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 17:26:19,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 17:26:19,983 INFO L87 Difference]: Start difference. First operand 3484 states and 6578 transitions. Second operand has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:26:27,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:26:27,099 INFO L93 Difference]: Finished difference Result 3511 states and 6632 transitions. [2024-10-14 17:26:27,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-14 17:26:27,100 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 191 [2024-10-14 17:26:27,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:26:27,110 INFO L225 Difference]: With dead ends: 3511 [2024-10-14 17:26:27,111 INFO L226 Difference]: Without dead ends: 3511 [2024-10-14 17:26:27,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-14 17:26:27,114 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 27 mSDsluCounter, 57828 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60055 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:26:27,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60055 Invalid, 1527 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [46 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 17:26:27,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2024-10-14 17:26:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3509. [2024-10-14 17:26:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3509 states, 1997 states have (on average 1.8107160741111668) internal successors, (3616), 3500 states have internal predecessors, (3616), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-14 17:26:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 6628 transitions. [2024-10-14 17:26:27,535 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 6628 transitions. Word has length 191 [2024-10-14 17:26:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:26:27,536 INFO L471 AbstractCegarLoop]: Abstraction has 3509 states and 6628 transitions. [2024-10-14 17:26:27,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:26:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 6628 transitions. [2024-10-14 17:26:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-14 17:26:27,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:26:27,539 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:26:27,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-14 17:26:27,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:27,740 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:26:27,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:26:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash -959724153, now seen corresponding path program 2 times [2024-10-14 17:26:27,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:26:27,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970805358] [2024-10-14 17:26:27,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:26:27,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:27,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:26:27,743 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:26:27,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 17:26:29,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:26:29,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:26:29,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 17:26:29,553 INFO L278 TraceCheckSpWp]: Computing forward predicates...